Penn ESE534 Spring2010 -- DeHon 1 ESE534: Computer Organization Day 5: February 1, 2010 Memories.

Slides:



Advertisements
Similar presentations
Prith Banerjee ECE C03 Advanced Digital Design Spring 1998
Advertisements

+ CS 325: CS Hardware and Software Organization and Architecture Internal Memory.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 14: March 19, 2014 Compute 2: Cascades, ALUs, PLAs.
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.
Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University Memory See: P&H Appendix C.8, C.9.
CS.305 Computer Architecture Memory: Structures Adapted from Computer Organization and Design, Patterson & Hennessy, © 2005, and from slides kindly made.
ENGIN112 L30: Random Access Memory November 14, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 30 Random Access Memory (RAM)
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 21: April 2, 2007 Time Multiplexing.
11/29/2004EE 42 fall 2004 lecture 371 Lecture #37: Memory Last lecture: –Transmission line equations –Reflections and termination –High frequency measurements.
1 Lecture 16B Memories. 2 Memories in General Computers have mostly RAM ROM (or equivalent) needed to boot ROM is in same class as Programmable Logic.
Memory Hierarchy.1 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 9: February 7, 2007 Instruction Space Modeling.
ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 3: January 26, 2009 Scheduled Operator Sharing.
Computer ArchitectureFall 2007 © November 7th, 2007 Majd F. Sakr CS-447– Computer Architecture.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day4: October 4, 2000 Memories, ALUs, and Virtualization.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 11: February 14, 2007 Compute 1: LUTs.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 4: January 22, 2007 Memories.
1 Lecture 16B Memories. 2 Memories in General RAM - the predominant memory ROM (or equivalent) needed to boot ROM is in same class as Programmable Logic.
Penn ESE Spring DeHon 1 FUTURE Timing seemed good However, only student to give feedback marked confusing (2 of 5 on clarity) and too fast.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 5: January 24, 2007 ALUs, Virtualization…
8-5 DRAM ICs High storage capacity Low cost Dominate high-capacity memory application Need “refresh” (main difference between DRAM and SRAM) -- dynamic.
Contemporary Logic Design Sequential Case Studies © R.H. Katz Transparency No Chapter #7: Sequential Logic Case Studies 7.6 Random Access Memories.
Physical Memory and Physical Addressing By: Preeti Mudda Prof: Dr. Sin-Min Lee CS147 Computer Organization and Architecture.
Memory Technology “Non-so-random” Access Technology:
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 28: November 15, 2013 Memory Periphery.
Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University See P&H Appendix B.8 (register files) and B.9.
ITEC 352 Lecture 24 Memory. Review Questions? Reminder: HW due on Wed. Night Intel 8080 CPU.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 30: November 12, 2014 Memory Core: Part.
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
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 11: March 3, 2014 Instruction Space Modeling 1.
Review: Basic Building Blocks  Datapath l Execution units -Adder, multiplier, divider, shifter, etc. l Register file and pipeline registers l Multiplexers,
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 28: November 16, 2012 Memory Periphery.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 9: February 24, 2014 Operator Sharing, Virtualization, Programmable Architectures.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 7: February 6, 2012 Memories.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 27: November 14, 2011 Memory Core.
Lecture 13 Main Memory Computer Architecture COE 501.
Main Memory CS448.
CPEN Digital System Design
Memory Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 24: November 5, 2010 Memory Overview.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 7: January 24, 2003 Instruction Space.
+ CS 325: CS Hardware and Software Organization and Architecture Memory Organization.
Computer Organization & Assembly Language © by DR. M. Amer.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 28: November 7, 2014 Memory Overview.
COMP541 Memories II: DRAMs
Architectural Considerations A Review of Some Architectural Concepts.
Penn ESE534 Spring DeHon 1 ESE534 Computer Organization Day 19: March 28, 2012 Minimizing Energy.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 28: November 8, 2013 Memory Overview.
Penn ESE534 Spring DeHon 1 ESE534 Computer Organization Day 9: February 13, 2012 Interconnect Introduction.
Caltech CS184 Winter DeHon CS184a: Computer Architecture (Structure and Organization) Day 4: January 15, 2003 Memories, ALUs, Virtualization.
Adapted from Computer Organization and Design, Patterson & Hennessy, UCB ECE232: Hardware Organization and Design Part 14: Memory Hierarchy Chapter 5 (4.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 27: November 14, 2012 Memory Core: Part.
CS 1410 Intro to Computer Tecnology Computer Hardware1.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 11: February 20, 2012 Instruction Space Modeling.
CS35101 Computer Architecture Spring 2006 Lecture 18: Memory Hierarchy Paul Durand ( ) [Adapted from M Irwin (
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 8: February 19, 2014 Memories.
CSE431 L18 Memory Hierarchy.1Irwin, PSU, 2005 CSE 431 Computer Architecture Fall 2005 Lecture 18: Memory Hierarchy Review Mary Jane Irwin (
COMP541 Memories II: DRAMs
Lecture 3. Lateches, Flip Flops, and Memory
ESE532: System-on-a-Chip Architecture
ESE534 Computer Organization
Day 26: November 11, 2011 Memory Overview
ESE534: Computer Organization
Day 29: November 11, 2013 Memory Core: Part 1
ESE532: System-on-a-Chip Architecture
ESE534: Computer Organization
ESE534: Computer Organization
ESE532: System-on-a-Chip Architecture
Presentation transcript:

Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 5: February 1, 2010 Memories

Penn ESE534 Spring DeHon 2 Previously… Arithmetic: addition, subtraction Reuse: –pipelining –bit-serial (vectorization) –shared datapath elements FSMDs Area/Time Tradeoffs Latency and Throughput

Penn ESE534 Spring DeHon 3 Today Memory –features –area/delay intuition and modeling –design –technology

Preclass 1 Penn ESE534 Spring DeHon 4 When is:

Preclass 2 Penn ESE534 Spring DeHon 5 Find m to minimize:

Preclass 2 Related? Penn ESE534 Spring DeHon 6

Preclass 3, 4 Delay –Scale with bd? –Scale with bw? Penn ESE534 Spring DeHon 7

8 Memory What’s a memory? What’s special about a memory?

Penn ESE534 Spring DeHon 9 Memory Function Typical: –Data Input Bus –Data Output Bus –Address (location or name) –read/write control

Penn ESE534 Spring DeHon 10 Memory Block for storing data for later retrieval State element What’s different between a memory and a collection of registers like we’ve been discussing?

Penn ESE534 Spring DeHon 11 Collection of Registers

Penn ESE534 Spring DeHon 12 Memory Uniqueness Cost Compact state element Packs data very tightly At the expense of sequentializing access Example of Area-Time tradeoff –and a key enabler

Penn ESE534 Spring DeHon 13 Memory Organization Key idea: sharing –factor out common components among state elements –can have big elements if amortize costs –state element unique  small

Penn ESE534 Spring DeHon 14 SRAM Memory bit Source:

Penn ESE534 Spring DeHon 15 Memory Organization Share: Interconnect –Input bus –Output bus –Control routing very topology/wire cost aware design Note: local, abuttment wiring

Penn ESE534 Spring DeHon 16 Share Interconnect Input Sharing –wiring –drivers Output Sharing –wiring –sensing –driving

Penn ESE534 Spring DeHon 17 Address/Control Addressing and Control –an overhead –paid to allow this sharing

Penn ESE534 Spring DeHon 18 Memory Organization

Penn ESE534 Spring DeHon 19 Dynamic RAM Goes a step further Share refresh/restoration logic as well Minimal storage is a capacitor “Feature” DRAM process is ability to make capacitors efficiently

Penn ESE534 Spring DeHon 20 Some Numbers (memory) Unit of area = 2 (F=2  –[more next week] Register as stand-alone element  4K 2 –e.g. as needed/used last lecture Static RAM cell  1K 2 –SRAM Memory (single ported) Dynamic RAM cell (DRAM process)  Dynamic RAM cell (SRAM process)  300 2

DRAM Layout Penn ESE534 Spring DeHon 21 Source: bitline wordline

Penn ESE534 Spring DeHon 22 DRAM Latency µProc 60%/yr. DRAM 7%/yr DRAM CPU 1982 Processor-Memory Performance Gap: (grows 50% / year) Performance Time “Moore’s Law” [From Patterson et al., IRAM:

Penn ESE534 Spring DeHon 23 Contemporary DRAM 1GB DDR3 SDRAM from Micron – –96 pin pakage –16b datapath IO –Operate at 500+MHz –37.5ns random access latency

Penn ESE534 Spring DeHon 24 Memory Access Timing RAS/CAS access Optimization for access within a row

Penn ESE534 Spring DeHon 25 Contemporary DRAM 1GB DDR3 SDRAM from Micron – –96 pin pakage –16b datapath IO –Operate at 500+MHz –37.5ns random access latency

Penn ESE534 Spring DeHon 26 1 Gigabit DDR2 SDRAM [Source:

Penn ESE534 Spring DeHon 27 Contemporary DRAM 4GB DDR3 SDRAM from Micron – es/ddr3/ksf16c256_512x64hz.pdfhttp://download.micron.com/pdf/datasheets/modul es/ddr3/ksf16c256_512x64hz.pdf –Operate at 800MHz –50ns random access latency

Penn ESE534 Spring DeHon 28 DRAM Latency µProc 60%/yr. DRAM 7%/yr DRAM CPU 1982 Processor-Memory Performance Gap: (grows 50% / year) Performance Time “Moore’s Law” [From Patterson et al., IRAM:

Penn ESE534 Spring DeHon 29 Basic Memory Design Space Width Depth Internal vs. External Width Banking –To come

Penn ESE534 Spring DeHon 30 Depth What happens as make deeper?

Penn ESE534 Spring DeHon 31 Banking Tile Banks/memory blocks

Penn ESE534 Spring DeHon 32 Independent Bank Access

Penn ESE534 Spring DeHon 33 Memory Key Idea –Memories hold state compactly –Do so by minimizing key state storage and amortizing rest of structure across large array

Penn ESE534 Spring DeHon 34 Yesterday vs. Today (Memory Technology) What’s changed?

Penn ESE534 Spring DeHon 35 Yesterday vs. Today (Memory Technology) What’s changed? –Capacity single chip –Integration memory and logic dram and logic embedded memories –Room on chip for big memories And many memories… –Don’t have to make a chip crossing to get to memory

Penn ESE534 Spring DeHon 36 Important Technology Cost IO between chips << IO on chip –pad spacing –area vs. perimeter (4s vs. s 2 ) –wiring technology BIG factor in multi-chip system designs Memories nice –very efficient with IO cost vs. internal area

Penn ESE534 Spring DeHon 37 On-Chip vs. Off-Chip BW Use Micron 1Gb DRAM as example On Chip BW: assume b banks? assume 8× b banks? assume 1024 × 1024b banks?

Penn ESE534 Spring DeHon 38 Costs Change Design space changes when whole system goes on single chip Can afford –wider busses –more banks –memory tailored to application/architecture Beware of old (stale) answers –their cost model was different

Penn ESE534 Spring DeHon 39 What is Importance of Memory? Radical Hypothesis: –Memory is simply a very efficient organization which allows us to store data compactly (at least, in the technologies we’ve seen to date) –A great engineering trick to optimize resources Alternative: –memory is a primary State is a primary, but state≠memory

Penn ESE534 Spring DeHon 40 Admin Added paper on modeling memories as supplemental reading for today Reading for next Monday on web –Classic paper on MOS scaling Reading for next Wednesday in Blackboard

Penn ESE534 Spring DeHon 41 Big Ideas [MSB Ideas] Memory: efficient way to hold state Resource sharing: key trick to reduce area Memories are a great example of resource sharing

Penn ESE534 Spring DeHon 42 Big Ideas [MSB-1 Ideas] Tradeoffs in memory organization Changing cost of memory organization as we go to on-chip, embedded memories

Preclass 2 Related? m=bw bw*bd=N –So bd=N/m Penn ESE534 Spring DeHon 43

Preclass 2 C 3 is for area of single memory cell log 2 (n) is for decoder –In red C 1 is for gates in decoder C 2 is for amps at bottom of row and drivers at top Penn ESE534 Spring DeHon 44

Preclass 1 Penn ESE534 Spring DeHon 45 When we solved for N, we found m is proportional to √N If we approximate log 2 (N) as a constant, we get