Professional Documents
Culture Documents
INTERLEAVED MEMORY
William Stallings
Supplement to
Computer Organization and Architecture, Tenth Edition
© Pearson 2015
http://williamstallings.com/ComputerOrganization/
G-2
© 2016 Pearson Education, Inc., Hoboken, NJ. All rights reserved.
Bank 0 Bank 1
0 N
1 N+1
2 N+2
N–2 2N–2
N–1 2N–1
buffer
Data bus
(a) Non-interleaved memory organization
Clock
DRAM Accesses 1st word 2nd word 3rd word 4th word
Bank 0 Bank 1
0 1
2 3
4 5
2N–4 2N–3
2N–2 2N–1
buffer buffer
Data bus
(c ) Interleaved memory organization
Clock
DRAM Accesses 1st word 2nd word
3rd word 4th word
G-3
© 2016 Pearson Education, Inc., Hoboken, NJ. All rights reserved.
If the memory controller supports interleaved memory, then memory
addresses are organized as shown in Figure G.1c. Memory location
addresses alternate between the two banks. This configuration speeds up
the burst transfer of four words, as shown in the timing diagram of Figure
G.1d. Because the four words of a burst access are spread across two
physical banks of DRAM, the individual accesses can be overlapped to hide
part, or all, of the DRAM access time delay.
Figure G.2 shows the organization of an interleaved memory with 2k
DRAM banks. Multiple memory banks are connected to a single bus
(channel) and differentiated by the lower (least significant) k bits of the
address bus. They share the bus by time division and overlapping the
operations. If the address length is m + k, bits, then the upper (most
significant) m bits of the address select a word within a memory bank, while
the lower k bits select the given memory bank.
The interleaved memory system is most effective when the number of
memory banks is equal to or an integer multiple of the number of words in a
cache line.
k
Bank 0 Bank 1 Bank 2 Bank 2 –1
word address
bank
select
MSBs LSBs
m bits k bits
Data bus
G-4
© 2016 Pearson Education, Inc., Hoboken, NJ. All rights reserved.