The Memory Hierarchy

HNDIT24012
Computer Architecture

Topics
 Storage technologies and trends
 Locality of reference
 Caching in the memory hierarchy

class12.ppt
Random-Access Memory (RAM)
Key features
 RAM is packaged as a chip.
 Basic storage unit is a cell (one bit per cell).
 Multiple RAM chips form a memory.
Static RAM (SRAM)
 Each cell stores bit with a six-transistor circuit.
 Retains value indefinitely, as long as it is kept powered.
 Relatively insensitive to disturbances such as electrical noise.
 Faster and more expensive than DRAM.
Dynamic RAM (DRAM)
 Each cell stores bit with a capacitor and transistor.
 Value must be refreshed every 10-100 ms.
 Sensitive to disturbances.
 Slower and cheaper than SRAM.
–2– 15-213, F’02
SRAM vs DRAM Summary

Tran. Access
per bit time Persist? Sensitive? Cost Applications

SRAM 6 1X Yes No 100x cache memories

DRAM 1 10X No Yes 1X Main memories,

frame buffers

–3– 15-213, F’02

Conventional DRAM Organization
d x w DRAM:
 dw total bits organized as d supercells of size w bits

16 x 8 DRAM chip
cols
0 1 2 3
2 bits 0
/
addr
1
rows
memory supercell
2
controller (2,1)
(to CPU)
3
8 bits
/
data

–4– internal row buffer 15-213, F’02

Reading DRAM Supercell (2,1)
Step 1(a): Row access strobe (RAS) selects row 2.
Step 1(b): Row 2 copied from DRAM array to row buffer.
16 x 8 DRAM chip
cols
0 1 2 3
RAS = 2
2
/ 0
addr
1
rows
memory
controller 2

8 3
/
data

–5– internal row buffer 15-213, F’02

Reading DRAM Supercell (2,1)
Step 2(a): Column access strobe (CAS) selects column 1.
Step 2(b): Supercell (2,1) copied from buffer to data lines,
and eventually back to the CPU.
16 x 8 DRAM chip
cols
0 1 2 3
CAS = 1
2
/ 0
addr
To CPU
1
rows
memory
controller 2

supercell 3
8
(2,1) /
data

supercell
–6– internal row buffer 15-213, F’02
(2,1)
Memory Modules
addr (row = i, col = j)
: supercell (i,j)
DRAM 0
64 MB
memory module
consisting of
DRAM 7
eight 8Mx8 DRAMs

bits bits bits bits bits bits bits bits

56-63 48-55 40-47 32-39 24-31 16-23 8-15 0-7

63 56 55 48 47 40 39 32 31 24 23 16 15 8 7 0
Memory
controller
64-bit doubleword at main memory address A

64-bit doubleword
–7– 15-213, F’02
Enhanced DRAMs
All enhanced DRAMs are built around the conventional
DRAM core.
 Fast page mode DRAM (FPM DRAM)
 Access contents of row with [RAS, CAS, CAS, CAS, CAS]
instead of [(RAS,CAS), (RAS,CAS), (RAS,CAS), (RAS,CAS)].
 Extended data out DRAM (EDO DRAM)
 Enhanced FPM DRAM with more closely spaced CAS signals.
 Synchronous DRAM (SDRAM)
 Driven with rising clock edge instead of asynchronous control
signals.
 Double data-rate synchronous DRAM (DDR SDRAM)
 Enhancement of SDRAM that uses both clock edges as control
signals.
 Video RAM (VRAM)
 Like FPM DRAM, but output is produced by shifting row buffer
 Dual ported (allows concurrent reads and writes)

–8– 15-213, F’02

Nonvolatile Memories
DRAM and SRAM are volatile memories
 Lose information if powered off.
Nonvolatile memories retain value even if powered off.
 Generic name is read-only memory (ROM).
 Misleading because some ROMs can be read and modified.
Types of ROMs
 Programmable ROM (PROM)
 Eraseable programmable ROM (EPROM)
 Electrically eraseable PROM (EEPROM)
 Flash memory
Firmware
 Program stored in a ROM
 Boot time code, BIOS (basic input/ouput system)
 graphics cards, disk controllers.

–9– 15-213, F’02

 Typical Bus Structure Connecting
CPU and Memory
A bus is a collection of parallel wires that carry
address, data, and control signals.
Buses are typically shared by multiple devices.

CPU chip

register file

ALU

system bus memory bus

I/O main
bus interface
bridge memory

– 10 – 15-213, F’02
 Memory Read Transaction (1)
CPU places address A on the memory bus.

register file Load operation: movl A, %eax

ALU
%eax

main memory
I/O bridge 0
A
bus interface x A

– 11 – 15-213, F’02
 Memory Read Transaction (2)
Main memory reads A from the memory bus, retreives
word x, and places it on the bus.

register file
Load operation: movl A, %eax

ALU
%eax

main memory
I/O bridge x 0

bus interface x A

– 12 – 15-213, F’02
 Memory Read Transaction (3)
CPU read word x from the bus and copies it into
register %eax.

register file Load operation: movl A, %eax

ALU
%eax x

main memory
I/O bridge 0

bus interface x A

– 13 – 15-213, F’02
 Memory Write Transaction (1)
CPU places address A on bus. Main memory reads it
and waits for the corresponding data word to arrive.

register file Store operation: movl %eax, A

ALU
%eax y

main memory
I/O bridge 0
A
bus interface A

– 14 – 15-213, F’02
 Memory Write Transaction (2)
CPU places data word y on the bus.

register file Store operation: movl %eax, A

ALU
%eax y

main memory
I/O bridge 0
y
bus interface A

– 15 – 15-213, F’02
 Memory Write Transaction (3)
Main memory read data word y from the bus and stores
it at address A.

register file
Store operation: movl %eax, A

ALU
%eax y

main memory
I/O bridge 0

bus interface y A

– 16 – 15-213, F’02
 Disk Geometry
Disks consist of platters, each with two surfaces.
Each surface consists of concentric rings called tracks.
Each track consists of sectors separated by gaps.
tracks
surface
track k gaps

spindle

sectors
– 17 – 15-213, F’02
 Disk Geometry (Muliple-Platter View)
Aligned tracks form a cylinder.
cylinder k

surface 0
platter 0
surface 1
surface 2
platter 1
surface 3
surface 4
platter 2
surface 5

spindle

– 18 – 15-213, F’02
 Disk Capacity
Capacity: maximum number of bits that can be stored.
 Vendors express capacity in units of gigabytes (GB), where 1 GB =
10^9.
Capacity is determined by these technology factors:
 Recording density (bits/in): number of bits that can be squeezed
into a 1 inch segment of a track.
 Track density (tracks/in): number of tracks that can be squeezed
into a 1 inch radial segment.
 Areal density (bits/in2): product of recording and track density.
Modern disks partition tracks into disjoint subsets called recording
zones
 Each track in a zone has the same number of sectors, determined
by the circumference of innermost track.
 Each zone has a different number of sectors/track

– 19 – 15-213, F’02
 Computing Disk Capacity
Capacity = (# bytes/sector) x (avg. # sectors/track) x
(# tracks/surface) x (# surfaces/platter) x
(# platters/disk)
Example:
 512 bytes/sector
 300 sectors/track (on average)
 20,000 tracks/surface
 2 surfaces/platter
 5 platters/disk

Capacity = 512 x 300 x 20000 x 2 x 5

= 30,720,000,000
= 30.72 GB
– 20 – 15-213, F’02
 Disk Operation (Single-Platter View)

The disk
The read/write head
surface
is attached to the end
spins at a fixed
of the arm and flies over
rotational rate
the disk surface on
a thin cushion of air.

spindle
spindle
spindle
spindle

By moving radially, the arm

can position the read/write
head over any track.

– 21 – 15-213, F’02
 Disk Operation (Multi-Platter View)
read/write heads
move in unison
from cylinder to cylinder

arm

spindle

– 22 – 15-213, F’02
 Disk Access Time
Average time to access some target sector approximated by :
 Taccess = Tavg seek + Tavg rotation + Tavg transfer
Seek time (Tavg seek)
 Time to position heads over cylinder containing target sector.
 Typical Tavg seek = 9 ms
Rotational latency (Tavg rotation)
 Time waiting for first bit of target sector to pass under r/w head.
 Tavg rotation = 1/2 x 1/RPMs x 60 sec/1 min
Transfer time (Tavg transfer)
 Time to read the bits in the target sector.
 Tavg transfer = 1/RPM x 1/(avg # sectors/track) x 60 secs/1 min.

– 23 – 15-213, F’02
 Disk Access Time Example
Given:
 Rotational rate = 7,200 RPM
 Average seek time = 9 ms.
 Avg # sectors/track = 400.
Derived:
 Tavg rotation = 1/2 x (60 secs/7200 RPM) x 1000 ms/sec = 4 ms.
 Tavg transfer = 60/7200 RPM x 1/400 secs/track x 1000 ms/sec =
0.02 ms
 Taccess = 9 ms + 4 ms + 0.02 ms
Important points:
 Access time dominated by seek time and rotational latency.
 First bit in a sector is the most expensive, the rest are free.
 SRAM access time is about 4 ns/doubleword, DRAM about 60 ns
 Disk is about 40,000 times slower than SRAM,
 2,500 times slower then DRAM.
– 24 – 15-213, F’02
 Logical Disk Blocks
Modern disks present a simpler abstract view of the
complex sector geometry:
 The set of available sectors is modeled as a sequence of b-
sized logical blocks (0, 1, 2, ...)
Mapping between logical blocks and actual (physical)
sectors
 Maintained by hardware/firmware device called disk
controller.
 Converts requests for logical blocks into
(surface,track,sector) triples.
Allows controller to set aside spare cylinders for each
zone.
 Accounts for the difference in “formatted capacity” and
“maximum capacity”.

– 25 – 15-213, F’02
 I/O Bus
CPU chip
register file

ALU
system bus memory bus

I/O main
bus interface
bridge memory

I/O bus Expansion slots for

other devices such
USB graphics disk as network adapters.
controller adapter controller

mouse keyboard monitor

disk 15-213, F’02
– 26 –
 Reading a Disk Sector (1)
CPU chip
CPU initiates a disk read by writing a
register file
command, logical block number, and
destination memory address to a port
ALU
(address) associated with disk controller.

main
bus interface
memory

I/O bus

USB graphics disk

controller adapter controller

mouse keyboard monitor

disk
– 27 – 15-213, F’02
 Reading a Disk Sector (2)
CPU chip
Disk controller reads the sector and
register file
performs a direct memory access (DMA)
transfer into main memory.
ALU

main
bus interface
memory

I/O bus

USB graphics disk

controller adapter controller

mouse keyboard monitor

disk
– 28 – 15-213, F’02
 Reading a Disk Sector (3)
CPU chip
When the DMA transfer completes, the
register file
disk controller notifies the CPU with an
interrupt (i.e., asserts a special “interrupt”
ALU
pin on the CPU)

main
bus interface
memory

I/O bus

USB graphics disk

controller adapter controller

mouse keyboard monitor

disk
– 29 – 15-213, F’02
 Storage Trends
metric 1980 1985 1990 1995 2000 2000:1980

SRAM $/MB 19,200 2,900 320 256 100 190

access (ns) 300 150 35 15 2 100

metric 1980 1985 1990 1995 2000 2000:1980

DRAM $/MB 8,000 880 100 30 1 8,000

access (ns) 375 200 100 70 60 6
typical size(MB) 0.064 0.256 4 16 64 1,000

metric 1980 1985 1990 1995 2000 2000:1980

$/MB 500 100 8 0.30 0.05 10,000

Disk access (ms) 87 75 28 10 8 11
typical size(MB) 1 10 160 1,000 9,000 9,000

– 30 – (Culled from back issues of Byte and PC Magazine) 15-213, F’02

 CPU Clock Rates

1980 1985 1990 1995 2000 2000:1980

processor 8080 286 386 Pent P-III
clock rate(MHz) 1 6 20 150 750 750
cycle time(ns) 1,000 166 50 6 1.6 750

– 31 – 15-213, F’02
 The CPU-Memory Gap
The increasing gap between DRAM, disk, and CPU
speeds.

100,000,000
10,000,000
1,000,000
100,000 Disk seek time
DRAM access time
ns

10,000
SRAM access time
1,000
CPU cycle time
100
10
1
1980 1985 1990 1995 2000
year

– 32 – 15-213, F’02
 Locality
Principle of Locality:
 Programs tend to reuse data and instructions near those
they have used recently, or that were recently referenced
themselves.
 Temporal locality: Recently referenced items are likely to be
referenced in the near future.
 Spatial locality: Items with nearby addresses tend to be
referenced close together in time.

Locality Example: sum = 0;

for (i = 0; i < n; i++)
• Data sum += a[i];
– Reference array elements in succession return sum;
(stride-1 reference pattern): Spatial locality
– Reference sum each iteration: Temporal locality
• Instructions
– Reference instructions in sequence: Spatial locality
– Cycle through loop repeatedly: Temporal locality
– 33 – 15-213, F’02
 Locality Example
Claim: Being able to look at code and get a qualitative
sense of its locality is a key skill for a professional
programmer.

Question: Does this function have good locality?

int sumarrayrows(int a[M][N])

{
int i, j, sum = 0;

for (i = 0; i < M; i++)

for (j = 0; j < N; j++)
sum += a[i][j];
return sum
}
– 34 – 15-213, F’02
 Locality Example
Question: Does this function have good locality?

int sumarraycols(int a[M][N])

{
int i, j, sum = 0;

for (j = 0; j < N; j++)

for (i = 0; i < M; i++)
sum += a[i][j];
return sum
}

– 35 – 15-213, F’02
 Locality Example
Question: Can you permute the loops so that the
function scans the 3-d array a[] with a stride-1
reference pattern (and thus has good spatial
locality)?

int sumarray3d(int a[M][N][N])

{
int i, j, k, sum = 0;

for (i = 0; i < M; i++)

for (j = 0; j < N; j++)
for (k = 0; k < N; k++)
sum += a[k][i][j];
return sum
}

– 36 – 15-213, F’02
 Memory Hierarchies
Some fundamental and enduring properties of hardware
and software:
 Fast storage technologies cost more per byte and have less
capacity.
 The gap between CPU and main memory speed is widening.
 Well-written programs tend to exhibit good locality.

These fundamental properties complement each other

beautifully.

They suggest an approach for organizing memory and

storage systems known as a memory hierarchy.
– 37 – 15-213, F’02
 An Example Memory Hierarchy
Smaller, L0:
faster, registers CPU registers hold words retrieved
and from L1 cache.
costlier L1: on-chip L1
(per byte) cache (SRAM) L1 cache holds cache lines retrieved
storage from the L2 cache memory.
devices L2: off-chip L2
cache (SRAM) L2 cache holds cache lines
retrieved from main memory.

L3: main memory

Larger, (DRAM)
Main memory holds disk
slower, blocks retrieved from local
and disks.
cheaper local secondary storage
L4:
(per byte) (local disks)
storage Local disks hold files
retrieved from disks on
devices remote network servers.

L5: remote secondary storage

(distributed file systems, Web servers)

– 38 – 15-213, F’02
 Caches
Cache: A smaller, faster storage device that acts as a
staging area for a subset of the data in a larger,
slower device.
Fundamental idea of a memory hierarchy:
 For each k, the faster, smaller device at level k serves as a
cache for the larger, slower device at level k+1.
Why do memory hierarchies work?
 Programs tend to access the data at level k more often than
they access the data at level k+1.
 Thus, the storage at level k+1 can be slower, and thus larger
and cheaper per bit.
 Net effect: A large pool of memory that costs as much as
the cheap storage near the bottom, but that serves data to
programs at the rate of the fast storage near the top.

– 39 – 15-213, F’02
 Caching in a Memory Hierarchy
Smaller, faster, more expensive
Level k: 8
4 9 14
10 3 device at level k caches a
subset of the blocks from level k+1

Data is copied between

10
4 levels in block-sized transfer
units

0 1 2 3

4 5 6 7 Larger, slower, cheaper storage

Level k+1:
device at level k+1 is partitioned
8 9 10 11 into blocks.

12 13 14 15

– 40 – 15-213, F’02
 General Caching Concepts
Program needs object d, which is stored
Request
14
12
12
14
in some block b.
0 1 2 3 Cache hit
Level 4* 14  Program finds b in the cache at level
12 9 3
k:
k. E.g., block 14.

12
4* Request Cache miss
12
 b is not at level k, so level k cache
must fetch it from level k+1.
E.g., block 12.
0 1 2 3  If level k cache is full, then some
Level 4
4* 5 6 7 current block must be replaced
k+1: (evicted). Which one is the “victim”?
8 9 10 11
 Placement policy: where can the new
12 13 14 15 block go? E.g., b mod 4
 Replacement policy: which block
should be evicted? E.g., LRU

– 41 – 15-213, F’02
 General Caching Concepts
Types of cache misses:
 Cold (compulsary) miss
 Cold misses occur because the cache is empty.
 Conflict miss
 Most caches limit blocks at level k+1 to a small subset
(sometimes a singleton) of the block positions at level k.
 E.g. Block i at level k+1 must be placed in block (i mod 4) at
level k+1.
 Conflict misses occur when the level k cache is large enough,
but multiple data objects all map to the same level k block.
 E.g. Referencing blocks 0, 8, 0, 8, 0, 8, ... would miss every time.
 Capacity miss
 Occurs when the set of active cache blocks (working set) is
larger than the cache.

– 42 – 15-213, F’02
 Examples of Caching in the Hierarchy
Cache Type What Cached Where Cached Latency Managed
(cycles) By
Registers 4-byte word CPU registers 0 Compiler
TLB Address On-Chip TLB 0 Hardware
translations
L1 cache 32-byte block On-Chip L1 1 Hardware
L2 cache 32-byte block Off-Chip L2 10 Hardware
Virtual 4-KB page Main memory 100 Hardware+
Memory OS
Buffer cache Parts of files Main memory 100 OS
Network buffer Parts of files Local disk 10,000,000 AFS/NFS
cache client
Browser cache Web pages Local disk 10,000,000 Web
browser
Web cache Web pages Remote server 1,000,000,000 Web proxy
disks server

– 43 – 15-213, F’02