3391ch8.pdf
(
2133 KB
)
Pobierz
Microelectronics, Second Edition
8
Memory Devices
8.1 Introduction
.........................................
8
-1
8.2 Memory Organization
...............................
8
-2
Memory Hierarchy
•
System Level Memory Organization
•
Memory Device Organization
8.3 Memory Device Types
................................
8
-
5
Read-Only Memory
•
Random Access Memory (RAM)
•
Special Memory Structures
8.4 Interfacing Memory Devices
..........................
8
-
15
Accessing DRAMs
•
Refreshing the DRAM
8.5 Error Detection and Correction
Shih-Lien Lu
......................
8
-
20
8.1 Introduction
Memory is an essential part of any computation system. It is used to store both the computation instructions
and the data. Logically, memory can be viewed as a collection of sequential locations, each with a unique
address as its label and capable of storing information. Accessing memory is accomplished by supplying
the address of the desired data to the device.
Memory devices can be categorized according to their functionality and fall into two major categories,
read-only-memory (ROM)
, and write-and-read memory or random-access memory (RAM). There is also
another subcategory of ROM: mostly read but sometimes write memory or flash ROM memory. Within
the RAM category there are two types of memory devices differentiated by storage characteristics,
static
RAM (SRAM)
and
dynamic RAM (DRAM)
respectively. DRAM devices need to be refreshed periodically
to prevent the corruption of their contents due to charge leakage. SRAM devices, on the other hand, do
not need to be refreshed.
Both SRAM and DRAM are volatile memory devices, which means that their contents are lost if the
power supply is removed from these devices. Nonvolatile memory, the opposite of volatile memory, retains
its contents even when the supply power is turned off. All current ROM devices, including mostly read
sometimes write devices are nonvolatile memories. Except for a very few special memories, these devices
are all interfaced in a similar way. When an address is presented to a memory device, and sometimes
after a control signal is strobed, the information stored at the specified address is retrieved after a certain
delay. This process is called a
memory read
. This delay, defined as the time taken from address valid to
data ready, is called
memory read access time
. Similarly, data can be stored into the memory device by
performing a
memory write
. When writing, data and an address are presented to the memory device with
the activation of a write control signal. There are also other control signals used to interface. For example,
most of the memory devices in packaged chip format has a chip select (or chip enable) pin. Only when this
pin is asserted, the particular memory device gets active. Once an address is supplied to the chip, internal
address decoding logic is used to pinpoint the particular content for output. Because of the nature of
the circuit structure used in implementing the decoding logic, a memory device usually needs to recover
before a subsequent read or write can be performed. Therefore, the time between subsequent address
issues is called
cycle time
. Cycle time is usually twice as long as the access time. There are other timing
requirements for memory devices. These timing parameters play a very important role in interfacing the
8
-
1
© 2006 by Taylor & Francis Group, LLC
8
-2
Microelectronics
memory devices with computation processors. In many situations, a memory device’s timing parameters
affect the performance of the computation system greatly.
Some special memory structures do not follow the general accessing scheme of using an address. Two of
the most frequently used are content addressable memory (CAM), and first-in-first-out (FIFO) memory.
Another type of memory device, which accepts multiple addresses and produces several results at different
ports, is called multiport memory. There is also a type of memory that can be written in parallel, but is
read serially. It is referred to as video RAM or VDRAM since they are used primarily in graphic display
applications. We will discuss these in more detail later.
8.2 Memory Organization
There are several aspects to memory organization. We will take a top down approach in discussing them.
Memory Hierarchy
The speed of memory devices has been lagging behind the speed of processors. As processors become
faster and more capable, larger memory spaces are required to keep up with the every increasing software
complexity written for these machines. Figure 8.1(a) illustrates the well-known Moore’s law, depicting
the exponential growth in central processing unit (CPU) and memory capacity. Although CPUs’ speed
continues to grow with the advancement of technology and design technique (in particular pipelining),
due to the nature of increasing memory size, more time is needed to decode wider and wider addresses
and to sense the information stored in the ever-shrinking storage element. The speed gap between CPU
and memory devices continues to grow wider. Figure 8.1(b) illustrates this phenomenon.
(a)
1970
2000
PROCESSOR COMPLEXITY IN NUMBER OF TRANSISTORS (INTEL)
DRAM CAPACITY
(b)
1970
2000
CPU CYCLE TIME
DRAM ACCESS TIME
FIGURE 8.1
(a) Processor and memory development trend, (b) speed difference between RAM and CPU.
© 2006 by Taylor & Francis Group, LLC
Memory Devices
8
-3
REGISTER
REGISTER
ON CHIP CACHE
LEVEL 2 CACHE
(MCM)
CACHE
LEVEL 3 CHACHE
MAIN MEMORY
RAMBUS DRAM
SYNC. DRAM
MAIN MEMORY
DISK
DISK
FLASH
EEPROM
(a)
TAPE
(b)
TAPE
FIGURE 8.2
Traditional memory hierarchy.
The strategy used to remedy this problem is called
memory hierarchy
.Memoryhierarchyworksbe-
cause of the locality property of memory references due to the sequentially fetched program instructions
and the conjugation of related data. In a hierarchical memory system there are many levels of memory
hierarchies. A small amount of very fast memory is usually allocated and brought right next to the central
processing unit to help match up the speed of the CPU and memory. As the distance becomes greater
between the CPU and memory, the performance requirement for the memory is relaxed. At the same
time, the size of the memory grows larger to accommodate the overall memory size requirement. Some
of the memory hierarchies are
registers, cache, main memory,
and
disk
. Figure 8.2 illustrates the general
memory hierarchy employed in a traditional system. When a memory reference is made, the processor
accesses the memory at the top of the hierarchy. If the desired data is in the higher hierarchy, a “bit” is
encountered and information is obtained quickly. Otherwise a
miss
is encountered. The requested infor-
mation must be brought up from a lower level in the hierarchy. Usually memory space is divided into
blocks so that it can be transferred between levels in groups. At the cache level a chunk is called a
cache
block
or a
cache line
. At the main memory level a chunk is referred to as a memory
page
. A miss in the
cache is called a
cache miss
and a miss in the main memory is called a
page fault
. When a miss occurs,
the whole block of memory containing the requested missing information is brought in from the lower
hierarchy as mentioned before. If the current memory hierarchy level is full when a miss occurs, some
existing blocks or pages must be removed and sometimes written back to a lower level to allow the new
one(s) to be brought in. There are several different
replacement algorithms
. One of the most commonly
used is the
least recently used
(LRU) replacement algorithm.
In modern computing systems, there may be several sublevels of cache within the hierarchy of cache. The
general principle of memory hierarchy is that the farther away from the CPU it is, the larger its size, slower
its speed, and the cheaper its price per memory unit becomes. Because the memory space addressable by
the CPU is normally larger than necessary for a particular software program at a given time, disks are used
to provide an economical supplement to main memory. This technique is called
virtual memory
. Besides
disks there are tapes, optical drives, and other backup devices, which we normally call
backup storage
. They
are used mainly to store information that is no longer in use, to protect against main memory and disk
failures, or to transfer data between machines.
System Level Memory Organization
On the system level, we must organize the memory to accomplish different tasks and to satisfy the need
of the program. In a computation system, addresses are supplied by the CPU to access the data or in-
struction. With a given address width a fixed number of memory locations may be accessed. This is
referred to as the
memory address space
. Some processing systems have the ability to access another sepa-
rate space called
input/output
(I/O)
address space
. Others use part of the memory space for I/O purposes.
© 2006 by Taylor & Francis Group, LLC
8
-4
Microelectronics
This style of performing I/O functions is called
memory–mapped I/O
. The memory address space de-
fines the maximum size of the directly addressable memory that a computation system can access using
memory type instructions. For example, a processor with address width of 16-b can access up to 64
K different locations (memory entries), whereas a 32-b address width can access up to 4 Gig different
locations. However, sometimes we can use indirection to increase the address space. The method used
by 80X86 processors provides an excellent example of how this is done. The address used by the user
or programmer in specifying a data item stored in the memory system is called a
logical address
.The
address space accessed by the logical address is named
logical address space
. However, this logical ad-
dress may not necessarily be used directly to index the physical memory. We called the memory space
accessed by physical address the
physical address space
. When the logical space is larger than the phys-
ical space, then memory hierarchy is required to accommodate the difference of space sizes and store
them in a lower hierarchy. In most of the current computing systems, a hard-disk is used as this lower
hierarchy memory. This is termed
virtual memory system
. This mapping of logical address to physical
address could be either linear or nonlinear. The actual address calculation to accomplish the mapping
process is done by the CPU and the memory management unit (MMU). Thus far, we have not specified
the exact size of a memory entry. A commonly used memory entry size is one byte. For historical rea-
sons, memory is organized in bytes. A byte is usually the smallest unit of information transferred with
each memory access. Wider memory entries are becoming more popular as the CPU continues to grow
in speed and complexity. There are many modern systems that have a data width wider than a byte. A
common size is a double word (32 b). in current desktop. As a result, memory in bytes is organized
in sections of multibytes. However, due to need for backward compatibility, these wide datapath sys-
tems are also organized to be byte addressable. The maximum width of the memory transfer is usually
called
memory word length
, and the size of the memory in bytes is called
memory capacity
. Since there
are different memory device sizes, the memory system can be populated with different sized memory
devices.
Memory Device Organization
Physically, within a memory device, cells are arranged in a two-dimensional array with each of the cell
capable of storing 1 b of information. This matrix of cells is accessed by specifying the desired row and
column addresses. The individual row enable line is generated using an address decoder while the column
2
c
ADDDRESS
n
r
ARRAY OF CELLS
(CORE)
2
r
COLUMN MUX
c
DATA
FIGURE 8.3
Generic memory structure.
© 2006 by Taylor & Francis Group, LLC
Memory Devices
8
-5
2
c/2
2
c/2
ARRAY OF CELLS
(CORE)
ARRAY OF CELLS
(CORE)
2
r
2
r
COLUMN MUX
COLUMN MUX
c/
2
c/
2
DATA
ADDRESS
DATA
FIGURE 8.4
Divided memory structure.
c
address bits, this memory structure contains 2
r
+
c
number of bits. As the size of memory array
increases, the row enable lines, as well as the column bit lines, become longer. To reduce the capacitive load
of a long row enable line, the row decoders, sense amplifiers, and column multiplexers are often placed in
the middle of divided matrices of cells, as illustrated in Fig. 8.4. By designing the multiplexer differently we
are able to construct memory with different output width, for example,
16, etc. In fact, memory
designers go to great efforts to design the column multiplexers so that most of the fabrication masks may
be shared for memory devices that have the same capacity but with different configurations.
×
1,
×
8,
×
8.3 Memory Device Types
As mentioned before, according to the functionality and characteristics of memory, we may divide memory
devices into two major categories: ROM and RAM. We will describe these different type of devices in the
following sections.
Read-Only Memory
In many systems, it is desirable to have the system level software (for example, basic input/output system
[BIOS])storedinaread-onlyformat,becausethesetypes ofprograms are seldomchanged. Manyembedded
systems also use read-only memory to store their software routines because these programs also are never
changed during their lifetime, in general. Information stored in the read-only memory is permanent. It is
retained even if the power supply is turned off. The memory can be read out reliably by a simple current
sensing circuit without worrying about destroying the stored data.
Figure 8.5
shows the general structure
of a read-only memory (ROM). The effective switch position at the intersection of the word-line/bit-line
determines the stored value. This switch could be implemented using different technologies resulting in
different types of ROMs.
Masked Read-Only Memory (ROM)
The most basic type of this read-only-memory is called masked ROM, or simply ROM. It is pro-
grammed at manufacturing time using fabrication processing masks. ROM can be produced using different
© 2006 by Taylor & Francis Group, LLC
is selected through a multiplexer. There is usually a sense amplifier between the column bit line and the
multiplexer input to detect the content of the memory cell it is accessing.
Figure 8.3
illustrates this general
memory cell array described with
r
bit of row address and
c
bit of column address. With the total number
of
r
+
Plik z chomika:
Januszek66
Inne pliki z tego folderu:
Back Seat_ A Mumbai Tale - Aditya Kripalani.mobi
(755 KB)
Brief Wondrous Life of Oscar Wao, The - Junot Diaz.opf
(3 KB)
Don't Make Me Think, Revisited_ - Steve Krug.mobi
(9256 KB)
M. T. Anderson - Norumbegan 03 - The Empire of Gut and Bone # (v5.0).epub
(2209 KB)
M. T. Anderson - Norumbegan 02 - The Suburb Beyond the Stars # (v5.0).epub
(2105 KB)
Inne foldery tego chomika:
Dokumenty
Galeria
LUDLUM ROBERT
Midi - Kar
Mszał Rzymski PL
Zgłoś jeśli
naruszono regulamin