Computer Memory Basic Concepts

1. Computer MemoryBasic Concepts Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University

2. The Memory Component • The memory stores the instructions and data for an executing program. • At this level, we are considering memory as a unit without structure. Cache memory will be covered fully in a future lecture.

3. Memory Addressability • Memory is characterized by the smallest addressable unit:Byte addressablethe smallest unit is an 8–bit byte.Word addressablethe smallest unit is a word, usually 16 or 32 bits. • Almost all modern computers use byte addressability to simplifies processing of character data.

4. Memory Control • The CPU has 2 registers dedicated to handling memory. • The MAR (Memory Address Register) holds the address being accessed. • The MBR (Memory Buffer Register) holds the data being written to the memory or being read from the memory. This is sometimes called the Memory Data Register.

5. Memory Control Signals • Read / Write Memory must do three actions: • READcopy contents of an addressed wordinto the MBR • WRITEcopy contents of the MBR into the location being addresses. • NOTHING the memory is expected to retain the contents written into it until those contents have been rewritten.

6. One Option for Memory Control • The CPU can issue one of two control signals.These are usually asserted high.

7. Asserting Control Signals • A control signal is a binary signal with only two values: 0 (logic low) and 1 (logic high). • When a control signal is to activate some circuit element, it is said to be asserted. • An active high signal is asserted when its value is 1. It is denoted by the signal name. • An active low signal is asserted when its value is 0. It is denoted by appending a “#” to its name, as in Select#.

8. Alternate Notation for Active Low • A signal asserted low might be denoted as • The first notation is older, and harder to depict using word processors. • A two-value control signal enables one of two actions depending on its value. A signal to indicate either read or write might be denoted

9. Modern Memory Control • Most modern designs avoid the READ and WRITE control signals, using Select# and R/W# • If R/W# = 0, a memory write is called for.If R/W# = 1, a memory read is called for.

10. (Classical) Memory Timings Memory Access Time is defined in terms of reading from memory. It is the time between the address becoming stable in the MAR and the data becoming available in the MBR. Memory cycle time is the minimum time interval between two independent memory accesses.

11. Synchronous Memory Timings • Synchronous memory, typically SDRAM, is rated by the speed of the memory bus. • The speed is normally quoted in megahertz, as in 166 MHz or 250 MHz, or some other value. • A 250 MHz memory can be attached to a 250 MHz synchronous memory bus, and transfer data at the rate of 250 million transfers/sec. • This is one transfer every 4 nanoseconds. • The data transfer rate depends on the width of the data bus, often as high as 64 bits.

12. RAM and ROM • Technically, the term “RAM” stands for “random access memory” with no further connotations. • In common usage, the term RAM refers to memory that is “read/write”; the CPU can both read from and write to RAM. • The term “ROM” stands for “read only memory”. In standard operations, the CPU cannot change the values stored in ROM.

13. Varieties of ROM • “Plain ROM” The contents of the memory are set at manufacture and cannot be changed without destroying the chip. • PROM The contents of the chip are set by a special device called a “PROM Programmer”. Once programmed the contents are fixed. • EPROM is same as a PROM, but that the contents can be erased and reprogrammed by the PROM Programmer device.

14. Memory Mapped Input / Output • The old PDP–11/20 supported a 16–bit address space. This supported addresses in the range 0 through 65,535 or 0 through 0177777 in octal. • Addresses 0 though 61,439 were reserved for physical memory.In octal these addresses are given by 0 through 167,777. • Addresses 61,440 through 65,535 (octal 170,000 through 177,777) were reserved for registers associated with Input / Output devices. • Examples: CR11 Card Reader 177,160 Control & Status Register 177,162 Data buffer 1177,164 Data buffer 2 • Reading from address 0177162 would access the card reader data buffer.

15. Memory Mapped I/O in the MIPS

16. The Linear View of Memory • This logical view is not easily implemented.

17. Standard Memory Organization • Modern computer memory is organized as a collection of modules connected to a bus. • Each module comprises 8 or 9 data chips.

18. Module Organization • A standard module will have 8 data chips, one for each bit in the Memory Buffer. • Assigning one bit per chip is more efficient.

19. Memory Chip Organization • As an example, here is a 4 megabit chip. It is organized as a 2-D array.

20. Two Options for Addressing • The option at left has 28 pins, the option at right has 19 pins. The signals RAS# and CAS# indicate the meaning of the 11-bit address.

21. Memory Interleaving • Suppose a 64MB memory made up of the 4Mb chips discussed above. • We organize the memory into 4MB banks. • The memory thus has 16 banks, each of 4MB. • 16 = 24 4 bits to select the bank4M = 222 22 bits address to each chip • Not surprisingly, 64M = 226.

22. Two Interleaving Options • The type of interleaving dictates how the memory address is divided. • Low-order interleaving • High-order interleaving (banking)

23. Speed Up Access by Interleaving Memory • Suppose an 8–way low–order interleaved memory. The chip timings are:80 nanosecond cycle time, and40 nanosecond access time. • Each chip has the following timing diagram.

24. Timings for the Interleaved Memory

25. Faster Memory Chips • After the row address is asserted, a number of column reads may proceed.

26. SDRAM • SDRAM is synchronous dynamic RAM. • In SDRAM, the memory transfers take place on a timing dictated by the memory bus clock rate. In “plain” SDRAM, the transfers all take place on the rising edge of the bus clock. • In DDR SDRAM (Double Data Rate), the transfers take place on both the rising and falling clock edges.

27. A Synchronous Bus Timing Diagram

28. SDRAM with a Wide Bus • DDR–SDRAM makes two transfers for every cycle of the memory bus, 1 on the rising edge of the clock cycle 1 on the falling edge of the clock cycle. • For a 100 MHz memory bus, DDR–SDRAM would have 200 million transfers per second. • Now consider a 64–bit data bus, which can transfer 64 bits (8 bytes) at a time. • Thus our sample DDR–SDRAM bus would transfer 1,600 million bytes per second. • This is 1.49 GB / second, as 1 GB = 232 bytes.

29. Word Addressing in a Byte Addressable Machine • Each 8–bit byte has a distinct address. • A 16-bit word at address Z contains bytes at addresses Z and Z + 1. • A 32-bit word at address Z contains bytes at addresses Z, Z + 1, Z + 2, and Z + 3. • Question: How is the value stored in a 32-bit register stored in computer memory?

30. Big–Endian vs. Little–Endian • Address Big-Endian Little-Endian • Z 01 04 • Z + 1 02 03 • Z + 2 03 02 • Z + 3 04 01

31. Big–Endian vs. Little–Endian

32. Example: “Core Dump” at Address 0x200 • Here is a sample memory map. • What is the 32-bit integer stored at address 0x200? • Big Endian: The number is 0x02040608. Its decimal value is22563 + 42562 + 62561 + 81 = 33,818,120 • Little Endian: The number is 0x08060402. Its decimal value is82563 + 62562 + 42561 + 21 = 134,611,970.

33. Another “Core Dump” • Here is the same memory map. • The 16–bit integer stored at address 0x200 is stored in the two bytes at addresses 0x200 and 0x201. • Big Endian:The value is 0x0204. The decimal value is 2256 + 4 = 516 • Little Endian: The value is 0x0402.The decimal value s 4256 + 2 = 1,026

34. Evolution of Modern Memory