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.

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
Computer Organization and Architecture
Prith Banerjee ECE C03 Advanced Digital Design Spring 1998
Multi-Level Caches Vittorio Zaccaria. Preview What you have seen: Data organization, Associativity, Cache size Policies -- how to manage the data once.
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.
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.
CS.305 Computer Architecture Memory: Structures Adapted from Computer Organization and Design, Patterson & Hennessy, © 2005, and from slides kindly made.
10/11/2007EECS150 Fa07 - DRAM 1 EECS Components and Design Techniques for Digital Systems Lec 14 – Storage: DRAM, SDRAM David Culler Electrical Engineering.
1 The Basic Memory Element - The Flip-Flop Up until know we have looked upon memory elements as black boxes. The basic memory element is called the flip-flop.
Lecture 12: DRAM Basics Today: DRAM terminology and basics, energy innovations.
1 Lecture 14: Cache Innovations and DRAM Today: cache access basics and innovations, DRAM (Sections )
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.
©UCB CS 161 Ch 7: Memory Hierarchy LECTURE 16 Instructor: L.N. Bhuyan
EECC722 - Shaaban #1 lec # 12 Fall Computer System Components SDRAM PC100/PC MHZ bits wide 2-way interleaved ~ 900 MBYTES/SEC.
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.
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 )
©UCB CS 162 Ch 7: Virtual Memory LECTURE 13 Instructor: L.N. Bhuyan
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.
Main Memory by J. Nelson Amaral.
Contemporary Logic Design Sequential Case Studies © R.H. Katz Transparency No Chapter #7: Sequential Logic Case Studies 7.6 Random Access Memories.
Overview Booth’s Algorithm revisited Computer Internal Memory Cache memory.
Computing Systems Memory Hierarchy.
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.
Lecture 19 Today’s topics Types of memory Memory hierarchy.
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.
Asynchronous vs. Synchronous Counters Ripple Counters Deceptively attractive alternative to synchronous design style State transitions are not sharp! Can.
+ CS 325: CS Hardware and Software Organization and Architecture Memory Organization.
1 Lecture 14: DRAM Main Memory Systems Today: cache/TLB wrap-up, DRAM basics (Section 2.3)
The Memory Hierarchy Lecture # 30 15/05/2009Lecture 30_CA&O_Engr Umbreen Sabir.
Caches Hiding Memory Access Times. PC Instruction Memory 4 MUXMUX Registers Sign Ext MUXMUX Sh L 2 Data Memory MUXMUX CONTROLCONTROL ALU CTL INSTRUCTION.
Semiconductor Memory Types
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.
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.
1 Lecture: DRAM Main Memory Topics: DRAM intro and basics (Section 2.3)
CS35101 Computer Architecture Spring 2006 Lecture 18: Memory Hierarchy Paul Durand ( ) [Adapted from M Irwin (
Computer Architecture Chapter (5): Internal Memory
CPEG3231 Integration of cache and MIPS Pipeline  Data-path control unit design  Pipeline stalls on cache misses.
CMSC 611: Advanced Computer Architecture Memory & Virtual Memory Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material.
CS 704 Advanced Computer Architecture
COMP541 Memories II: DRAMs
Cache Memory Presentation I
Morgan Kaufmann Publishers Memory & Cache
CMSC 611: Advanced Computer Architecture
Lecture: DRAM Main Memory
Lecture: DRAM Main Memory
Digital Logic & Design Dr. Waseem Ikram Lecture 40.
If a DRAM has 512 rows and its refresh time is 9ms, what should be the frequency of row refresh operation on the average?
Bob Reese Micro II ECE, MSU
Presentation transcript:

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 law - 1 MB per MIP needed for system balance »real key here is to avoid those costly page faults –latency »how long does it take to get the data back »by addressing big chunks - like an entire cache block (amortize the latency) »critical to cache performance when the miss is to main –bandwidth »affects the time it takes to transfer the block »a key issue when DMA service from an I/O device is considered »also a key issue with the very large block sizes in lower level caches

CS/EE 5810 CS/EE 6810 F00: 3 Memory Technology SRAM’s and DRAM’s are different –DRAM density is 16x SRAM at same feature size »hence cost is much cheaper since it tracks area –SRAM speed is 8 to 16x that of DRAM Main memory today means DRAM –Multiplexed address lines - RAS then CAS –2 dimensional address - rows go to a buffer »subsequent CAS selects subrow –Refresh needed every few milliseconds - another parasite –Where are we today –256 Mbit - 1 Gb chips »RAS access time between 40 and 65ns »CAS access 10 ns »cycle time - 90 ns (separation between subsequent accesses)

CS/EE 5810 CS/EE 6810 F00: 4 Example Consider –1 cycle to send the address –6 cycles per word of access –1 cycle to transmit the data Hence if main memory is organized by word –8 cycles for every word gets spent Given a cache line of 4 words –32 cycles is the miss penalty Clearly we need a better organizational model

CS/EE 5810 CS/EE 6810 F00: 5 Memory Organization Improvements Wider memory –make a word of main memory look like a cache line »easy to do - need 4 words - just parallel 4 chips and decode the chip selects –problem is the cost of the wider bus »especially true if this contributes to the pin count on the CPU Interleaved or phased memory –keep the memory bus the same but make it run faster –still n-banks »but split phase delivery makes the bus bandwidth go up by the interleave factor. Both are optimized for sequential memory accesses –e.g. capitalizes on spatial locality principle just like caches do

CS/EE 5810 CS/EE 6810 F00: 6 DRAM-Specific Interleaving Options Since 1 MB DRAM days other options exist –Row is usually the square root of the DRAM size »1K for 1M and so on Nibble Mode - RAS then CAS, next, next, etc. Page Mode - Page Mode - RAS then any CAS –hence after CAS the row is random addressable Static Column (SCRAM) –similar to page mode –no need to do a CAS - can also supply CAS next quickly Synchronous DRAM’s and RAMBUS –internally pipelined - lots of activity here presently

CS/EE 5810 CS/EE 6810 F00: 7 DRAM Memory Block Diagram Row Address (RAS) Column Address (CAS) Row Buffer 1 bit out Memory (DRAM) Array