Characteristics of Memory Systems
Key Characteristics of Computer Memory Systems
Location
- Processor
- Internal (main)
- External (secondary)
Figure 1.1 Processor
Capacity
- Word size
- Number of words
Unit of Transfer
- Word
- Block
Word: The “natural” unit of organization of memory. The size of word is typically equal to the number of bits used to represent a number and to the instruction length. Unfortunately, there are many exceptions.
Addressable units: In some systems, the addressable unit is the word. However, many systems allow addressing at the byte level. In any case, the relationship between the length in bits A of an address and the number N of addressable units is 2A = N
For main memory, the unit of transfer is the number of bits read out of or written into memory at time. It need not equal a word or an addressable unit. For external memory, data are often transferred in much larger units than a word and these are referred to as blocks.
Access Method
- Sequential
- Direct
- Random
- Associative
Direct access: As with sequential access, direct access involves a shared read-write mechanism. However, individual blocks or records have a unique address based on physical location. Access is accomplished by direct access to reach a general vicinity plus sequential searching, counting or waiting to reach the final location. Access time is variable. Disk units are direct access.
Figure 1.2 Disk
Random access: Each addressable location in memory has a unique. Physically wired-in addressing mechanism. The time to access a given location is independent of the sequence of prior accesses and is constant. Thus, any location can be selected at random and directly addressed and accessed. Main memory and some cache systems are random access.
Associative: This is a random-access type of memory that enables one to make a comparison of desired bit locations within a word for a specified match and to do this for all words simultaneously. Thus, a word is retrieved based on a portion of its contents rather than its address. As with ordinary random-access memory, each location has its own addressing mechanism and retrieval time is constant independent of location or prior access patterns. Cache memories may employ associative access.
Performance
- Access time
- Cycle time
- Transfer rate
Memory cycle time: This concept is primarily applied to random-access memory and consists of the access time plus any additional time required before a second access can commence. This additional time may be required for transients to die out on signal lines or to regenerate data if they are read destructively. Note that memory cycle time is concerned with the system bus, not the processor.
Transfer rate: This is the rate at which data can be transferred into or out of a memory unit. For random-access memory, it is equal to 1/(cycle time). For non-random-access memory, the following relationship holds: TN = TA + N/R
where TN = Average time to read or write N bits
TA = Average access time
N = Number of bits
R = Transfer rate, in bits per second (bps)
As one goes down in the hierarchy, the following occur:
a) Decreasing cost per bit
b) Increasing capacity
c) Increasing access time
d) Decreasing frequency of access of the memory by the processor
The fastest, smallest and most expensive type of memory consists of the registers internal to the processor. Typically, a processor will contain a few dozen such registers, although some machines contain hundreds of registers. Main memory is the principal internal memory system of the computer. Each location in main memory has a unique address. Main memory is usually extended with a higher-speed, smaller cache.
Reference: William Stallings. (2003). Computer Organization & Architecture DESIGN FOR PERFORMANCE(6th ed.): Computer Memory System Overview(pp 96-101). Upper Saddle River, NJ: Pearson
N = Number of bits
R = Transfer rate, in bits per second (bps)
Physical Type
- Semiconductor
- Magnetic
- Optical
- Magneto-optical
Physical Characteristics
- Volatile/nonvolatile
- Erasable/nonerasable
Figure 1.3 Read Only Memory (ROM)
Organization
For random-access memory, the organization is a key design issue. By organization is meant the physical arrangement of bits to form words.The Memory Hierarchy
Figure 1.4 The Memory Hierarchy
As one goes down in the hierarchy, the following occur:
a) Decreasing cost per bit
b) Increasing capacity
c) Increasing access time
d) Decreasing frequency of access of the memory by the processor
The fastest, smallest and most expensive type of memory consists of the registers internal to the processor. Typically, a processor will contain a few dozen such registers, although some machines contain hundreds of registers. Main memory is the principal internal memory system of the computer. Each location in main memory has a unique address. Main memory is usually extended with a higher-speed, smaller cache.
Reference: William Stallings. (2003). Computer Organization & Architecture DESIGN FOR PERFORMANCE(6th ed.): Computer Memory System Overview(pp 96-101). Upper Saddle River, NJ: Pearson
No comments:
Post a Comment