Main Mem.. CSE 471 Autumn 011 Main Memory The last level in the cache – main memory hierarchy is the main memory made of DRAM chips DRAM parameters (memory.

Slides:



Advertisements
Similar presentations
Main MemoryCS510 Computer ArchitecturesLecture Lecture 15 Main Memory.
Advertisements

Outline Memory characteristics SRAM Content-addressable memory details DRAM © Derek Chiou & Mattan Erez 1.
Chapter 5 Internal Memory
Miss Penalty Reduction Techniques (Sec. 5.4) Multilevel Caches: A second level cache (L2) is added between the original Level-1 cache and main memory.
5-1 Memory System. Logical Memory Map. Each location size is one byte (Byte Addressable) Logical Memory Map. Each location size is one byte (Byte Addressable)
Anshul Kumar, CSE IITD CSL718 : Main Memory 6th Mar, 2006.
COEN 180 DRAM. Dynamic Random Access Memory Dynamic: Periodically refresh information in a bit cell. Else it is lost. Small footprint: transistor + capacitor.
CS.305 Computer Architecture Memory: Structures Adapted from Computer Organization and Design, Patterson & Hennessy, © 2005, and from slides kindly made.
Memories and the Memory Subsystem; The Memory Hierarchy; Caching; ROM.
Chapter 9 Memory Basics Henry Hexmoor1. 2 Memory Definitions  Memory ─ A collection of storage cells together with the necessary circuits to transfer.
Lecture 12: DRAM Basics Today: DRAM terminology and basics, energy innovations.
1 Lecture 15: DRAM Design Today: DRAM basics, DRAM innovations (Section 5.3)
1 COMP 206: Computer Architecture and Implementation Montek Singh Wed., Nov. 19, 2003 Topic: Main Memory (DRAM) Organization.
EECC722 - Shaaban #1 lec # 12 Fall Computer System Components SDRAM PC100/PC MHZ bits wide 2-way interleaved ~ 900 MBYTES/SEC.
EECC550 - Shaaban #1 Lec # 10 Spring Main Memory Main memory generally utilizes Dynamic RAM (DRAM), which use a single transistor to store.
Memory Hierarchy.1 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output.
ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )
1 COMP 206: Computer Architecture and Implementation Montek Singh Wed., Nov. 13, 2002 Topic: Main Memory (DRAM) Organization.
Registers  Flip-flops are available in a variety of configurations. A simple one with two independent D flip-flops with clear and preset signals is illustrated.
EECC550 - Shaaban #1 Lec # 10 Summer Main Memory Main memory generally utilizes Dynamic RAM (DRAM), which use a single transistor to store.
1 Lecture 13: Cache Innovations Today: cache access basics and innovations, DRAM (Sections )
1 Lecture 14: Virtual Memory Today: DRAM and Virtual memory basics (Sections )
EECC551 - Shaaban #1 Lec # 11 Fall Main Memory Main memory generally utilizes Dynamic RAM (DRAM), which use a single transistor to store.
1 COMP 206: Computer Architecture and Implementation Montek Singh Mon., Nov. 18, 2002 Topic: Main Memory (DRAM) Organization – contd.
Main Memory by J. Nelson Amaral.
8-5 DRAM ICs High storage capacity Low cost Dominate high-capacity memory application Need “refresh” (main difference between DRAM and SRAM) -- dynamic.
Overview Booth’s Algorithm revisited Computer Internal Memory Cache memory.
Computing Systems Memory Hierarchy.
CSIT 301 (Blum)1 Memory. CSIT 301 (Blum)2 Types of DRAM Asynchronous –The processor timing and the memory timing (refreshing schedule) were independent.
Memory Technology “Non-so-random” Access Technology:
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 8 – Memory Basics Logic and Computer Design.
Main Memory Background Random Access Memory (vs. Serial Access Memory) Cache uses SRAM: Static Random Access Memory –No refresh (6 transistors/bit vs.
CPE232 Memory Hierarchy1 CPE 232 Computer Organization Spring 2006 Memory Hierarchy Dr. Gheith Abandah [Adapted from the slides of Professor Mary Irwin.
CSIE30300 Computer Architecture Unit 07: Main Memory Hsin-Chou Chi [Adapted from material by and
Survey of Existing Memory Devices Renee Gayle M. Chua.
Chapter 5 Internal Memory. Semiconductor Memory Types.
Systems Overview Computer is composed of three main components: CPU Main memory IO devices Refers to page
EEE-445 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output Cache Main Memory Secondary Memory (Disk)
Lecture 13 Main Memory Computer Architecture COE 501.
Main Memory CS448.
CS 312 Computer Architecture Memory Basics Department of Computer Science Southern Illinois University Edwardsville Summer, 2015 Dr. Hiroshi Fujinoki
CPEN Digital System Design
Memory Hierarchy— Reducing Miss Penalty Reducing Hit Time Main Memory Professor Alvin R. Lebeck Computer Science 220 / ECE 252 Fall 2008.
University of Tehran 1 Interface Design DRAM Modules Omid Fatemi
Memory Cell Operation.
Modern DRAM Memory Architectures Sam Miller Tam Chantem Jon Lucas CprE 585 Fall 2003.
CS/EE 5810 CS/EE 6810 F00: 1 Main Memory. CS/EE 5810 CS/EE 6810 F00: 2 Main Memory Bottom Rung of the Memory Hierarchy 3 important issues –capacity »BellÕs.
COMP541 Memories II: DRAMs
1 Adapted from UC Berkeley CS252 S01 Lecture 18: Reducing Cache Hit Time and Main Memory Design Virtucal Cache, pipelined cache, cache summary, main memory.
1 Memory Hierarchy (I). 2 Outline Random-Access Memory (RAM) Nonvolatile Memory Disk Storage Suggested Reading: 6.1.
Contemporary DRAM memories and optimization of their usage Nebojša Milenković and Vladimir Stanković, Faculty of Electronic Engineering, Niš.
1 Chapter Seven. 2 SRAM: –value is stored on a pair of inverting gates –very fast but takes up more space than DRAM (4 to 6 transistors) DRAM: –value.
© Wen-mei Hwu and S. J. Patel, 2005 ECE 511, University of Illinois Lecture 5-6: Memory System.
1 Lecture: DRAM Main Memory Topics: DRAM intro and basics (Section 2.3)
Chapter 11 System Performance Enhancement. Basic Operation of a Computer l Program is loaded into memory l Instruction is fetched from memory l Operands.
CS35101 Computer Architecture Spring 2006 Lecture 18: Memory Hierarchy Paul Durand ( ) [Adapted from M Irwin (
CSE431 L18 Memory Hierarchy.1Irwin, PSU, 2005 CSE 431 Computer Architecture Fall 2005 Lecture 18: Memory Hierarchy Review Mary Jane Irwin (
“With 1 MB RAM, we had a memory capacity which will NEVER be fully utilized” - Bill Gates.
CPEG3231 Integration of cache and MIPS Pipeline  Data-path control unit design  Pipeline stalls on cache misses.
RAM RAM - random access memory RAM (pronounced ramm) random access memory, a type of computer memory that can be accessed randomly;
1 Lecture: Memory Basics and Innovations Topics: memory organization basics, schedulers, refresh,
Administration Midterm on Thursday Oct 28. Covers material through 10/21. Histogram of grades for HW#1 posted on newsgroup. Sample problem set (and solutions)
CS 704 Advanced Computer Architecture
COMP541 Memories II: DRAMs
Reducing Hit Time Small and simple caches Way prediction Trace caches
Cache Memory Presentation I
Lecture: DRAM Main Memory
CSE 586 Computer Architecture Lecture 6
Main Memory Background
Bob Reese Micro II ECE, MSU
Presentation transcript:

Main Mem.. CSE 471 Autumn 011 Main Memory The last level in the cache – main memory hierarchy is the main memory made of DRAM chips DRAM parameters (memory latency at the DRAM level): –Access time: time between the read is requested and the desired word arrives –Cycle time: minimum time between requests to memory (cycle time > access time because need for stabilization of address lines)

Main Mem.. CSE 471 Autumn 012 DRAM’s Address lines split into row and column addresses. A read operation consists of: –RAS (Row access strobe) –CAS (Column access strobe) –If device has been precharged, access time = RAS + CAS –If not, have to add precharge time –RAS, CAS, and Precharge are of the same order of magnitude –In DRAM, data needs to be written back after a read, hence cycle time > access time

Main Mem.. CSE 471 Autumn 013 DRAM array Row address Column address page Page buffer

Main Mem.. CSE 471 Autumn 014 DRAM and SRAM D stands for “dynamic” –Each bit is single transistor (plus capacitor; hence the need to rewrite info after a read). –Needs to be recharged periodically. Hence refreshing. All bits in a row can be refreshed concurrently (just read the row). –For each row it takes RAS time to refresh (can lead to up to 5% loss in performance). S stands for “static” –Uses 6 transistors/bit (some use 4). No refresh and no need to write after read (i.e., information is not lost by reading; very much like a F/F in a register).

Main Mem.. CSE 471 Autumn 015 DRAM vs. SRAM Cycle time of SRAM 10 to 20 times faster than DRAM For same technology, capacity of DRAM 5 to 10 times that of SRAM Hence –Main memory is DRAM –On-chip caches are SRAM –Off-chip caches (it depends) DRAM growth –Capacity: Factor of 4 every 3 years (60% per year) –Cycle time. Improvement of 20% per generation (7% per year)

Main Mem.. CSE 471 Autumn 016 How to Improve Main Memory Bandwidth It’s easier to improve on bandwidth than on latency Sending address: can’t be improved (and this is latency) –Although split-transaction bus allows some overlap Make memory wider (assume monolithic memory) –Sending one address, yields transfer of more than one word if the bus width allows it (and it does nowadays) –But less modularity (buy bigger increments of memory)

Main Mem.. CSE 471 Autumn 017 Interleaving (introducing parallelism at the DRAM level) Memory is organized in banks Bank i stores all words at address j modulo i All banks can read a word in parallel –Ideally, number of banks should match (or be a multiple of) the L2 block size (in words) Bus does not need to be wider (buffer in the DRAM bank) Writes to individual banks for different addresses can proceed without waiting for the preceding write to finish (great for write-through caches)

Main Mem.. CSE 471 Autumn 018 Banks of Banks Superbanks interleaved by some bits other than lower bits Superbanks composed of banks interleaved on low order bits for sequential access Superbanks allow parallel access to memory –Great for lock-up free caches, for concurrent I/O and for multiprocessors sharing main memory

Main Mem.. CSE 471 Autumn 019 Limitations of Interleaving (sequential access) Number of banks limited by increasing chip capacity –With 1M x 1 bit chips, it takes 64 x 8 = 512 chips to get 64 MB (easy to put 16 banks of 32 chips) –With 16 M x 1 chips, it takes only 32 chips (only one bank) –More parallelism in using 4M x 4 chips (32 chips in 4 banks ) In the N * m (N number of MB, m width of bits out of each chip) m is limited by electronic constraints to about 8 or maybe 16.

Main Mem.. CSE 471 Autumn 0110 Example Memory Path of a Workstation CPU + L1 L2 Data switch DRAM Bank n Bank 0 16B32B Processor bus Memory bus To/from I/O bus

Main Mem.. CSE 471 Autumn 0111 Page-mode and Synchronous DRAMs Introduce a page buffer –In page mode no need for a RAS –But if a miss, need to precharge + RAS + CAS In SDRAM, same as page-mode but subsequent accesses even faster (burst mode)

Main Mem.. CSE 471 Autumn 0112 Cached DRAM and Processor in Memory Put some SRAM on DRAM chip –More flexibility in buffer size than page mode –Can precharge DRAM while accessing SRAM –But fabrication is different hence has not caught up in mass market Go one step further (1 billion transistors/chip) –Put “simple” processor and SRAM and DRAM on chip –Great bandwidth for processor-memory interface –Cache with very large block size since parallel access to many banks is possible –Can’t have too complex of a processor –Need to invest in new fabs

Main Mem.. CSE 471 Autumn 0113 Processor in Memory (PIM) Generality depends on the intended applications IRAM –Vector processor; data stream apps; low power FlexRAM –Memory chip = Host + Simple multiprocessor + banks of DRAM; memory intensive apps. Active Pages –Co-processor paradigm; reconfigurable logic in memory FBRAM –Graphics in memory

Main Mem.. CSE 471 Autumn 0114 Rambus Specialized memory controller (scheduler), channel, and RDRAM’s Parallelism and pipelining, e.g. –Independent row, column, and data buses (narrow -- 2 bytes) –Pipelined memory subsystem (several packets/access; packets are 4 cycles = 10 ns) –Parallelism within the RDRAMs (many banks with 4 possible concurrent operations) –Parallelism among RDRAM’s (large number of them) Great for “streams of data” (Graphics, games)

Main Mem.. CSE 471 Autumn 0115 Direct Rambus Memory controller Row [2:0] Column [4:0] Data [15:0] RDRAM 0RDRAM n, n up to 31 Bk 0 Bk 15 Pg 0 Pg 15 Extremely fast bus (400 MHz clock, 800 MHz transfer rate) Great bandwidth for stream data but still high latency for random read/writes

Main Mem.. CSE 471 Autumn 0116 Split-transaction Bus Allows transactions (address, control, data) for different requests to occur simultaneously Required for efficient Rambus Great for SMP’s sharing a single bus