COMP203/NWEN201 2009 Memory Technologies 0 Plan for Memory Technologies Topic Static RAM (SRAM) Dynamic RAM (DRAM) Memory Hierarchy DRAM Accelerating Techniques.

Slides:



Advertisements
Similar presentations
Outline Memory characteristics SRAM Content-addressable memory details DRAM © Derek Chiou & Mattan Erez 1.
Advertisements

Figure (a) 8 * 8 array (b) 16 * 8 array.
Computer Organization and Architecture
Prith Banerjee ECE C03 Advanced Digital Design Spring 1998
+ CS 325: CS Hardware and Software Organization and Architecture Internal Memory.
COEN 180 DRAM. Dynamic Random Access Memory Dynamic: Periodically refresh information in a bit cell. Else it is lost. Small footprint: transistor + capacitor.
Memory (RAM) Organization Each location is addressable Addresses are binary numbers Addresses used at different granularities –each bit is possible, but.
What is memory? Memory is used to store information within a computer, either programs or data. Programs and data cannot be used directly from a disk or.
Chapter 9 Memory Basics Henry Hexmoor1. 2 Memory Definitions  Memory ─ A collection of storage cells together with the necessary circuits to transfer.
ENGIN112 L30: Random Access Memory November 14, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 30 Random Access Memory (RAM)
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.
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.
Overview Memory definitions Random Access Memory (RAM)
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.
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.
CS 151 Digital Systems Design Lecture 30 Random Access Memory (RAM)
Chapter 5 Internal Memory
©UCB CS 162 Ch 7: Virtual Memory LECTURE 13 Instructor: L.N. Bhuyan
IT Systems Memory EN230-1 Justin Champion C208 –
Memory Key component of a computer system is its memory system to store programs and data. ITCS 3181 Logic and Computer Systems 2014 B. Wilkinson Slides12.ppt.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Hao Ji.
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.
1 EE365 Read-only memories Static read/write memories Dynamic read/write memories.
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.
Memory Technology “Non-so-random” Access Technology:
EKT 221 Digital Electronics II
Memory Basics Chapter 8.
Physical Memory By Gregory Marshall. MEMORY HIERARCHY.
Lecture on Electronic Memories. What Is Electronic Memory? Electronic device that stores digital information Types –Volatile v. non-volatile –Static v.
1 Random-Access Memory (RAM) Note: We’re skipping Sec 7.5 Today: First Hour: Static RAM –Section 7.6 of Katz’s Textbook –In-class Activity #1 Second Hour:
THE MEMORY SYSTEM & INTERCONNECTION STRUCTURE OBJECTIVES Define Memory hierarchy and its characteristics Define various types of memories Define the.
EKT 221 : Digital 2 Memory Basics
Lecture 19 Today’s topics Types of memory Memory hierarchy.
Memory and Storage Dr. Rebhi S. Baraka
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS 352: Digital Systems.
Memory System Unit-IV 4/24/2017 Unit-4 : Memory System.
Main Memory CS448.
CPEN Digital System Design
Digital Logic Design Instructor: Kasım Sinan YILDIRIM
SEQUENTIAL CIRCUITS Component Design and Use. Register with Parallel Load  Register: Group of Flip-Flops  Ex: D Flip-Flops  Holds a Word of Data 
+ CS 325: CS Hardware and Software Organization and Architecture Memory Organization.
Memory and Storage. Computer Memory Processor registers – Temporary storage locations within the CPU – Examples Instruction register – holds the instruction.
Physical Memory and Physical Addressing By Alex Ames.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /3/2013 Lecture 9: Memory Unit Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
Feb. 26, 2001Systems Architecture I1 Systems Architecture I (CS ) Lecture 12: State Elements, Registers, and Memory * Jeremy R. Johnson Mon. Feb.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Dr. Shi Dept. of Electrical and Computer Engineering.
Semiconductor Memory Types
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 8 – Memory Basics Logic and Computer Design.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 22 Memory Definitions Memory ─ A collection of storage cells together with the necessary.
07/11/2005 Register File Design and Memory Design Presentation E CSE : Introduction to Computer Architecture Slides by Gojko Babić.
Memory 2 ©Paul Godin Created March 2008 Memory 2.1.
DIGITAL SYSTEMS Read Only– and Random Access Memory ( ROM – RAM) Rudolf Tracht and A.J. Han Vinck.
Computer Architecture Chapter (5): Internal Memory
RAM RAM - random access memory RAM (pronounced ramm) random access memory, a type of computer memory that can be accessed randomly;
Components of Computer. Memory Unit Most important part of the computer Used to store data and instructions that are currently in use Main memory consists.
COMP211 Computer Logic Design
Morgan Kaufmann Publishers
Memory Units Memories store data in units from one to eight bits. The most common unit is the byte, which by definition is 8 bits. Computer memories are.
Computer Architecture & Operations I
Hakim Weatherspoon CS 3410 Computer Science Cornell University
William Stallings Computer Organization and Architecture 7th Edition
2.C Memory GCSE Computing Langley Park School for Boys.
AKT211 – CAO 07 – Computer Memory
Bob Reese Micro II ECE, MSU
Presentation transcript:

COMP203/NWEN Memory Technologies 0 Plan for Memory Technologies Topic Static RAM (SRAM) Dynamic RAM (DRAM) Memory Hierarchy DRAM Accelerating Techniques –Reading B.5

COMP203/NWEN Memory Technologies 1 Static Random Access Memory (SRAM) Registers are not cost-effective for main memory –Too much logic per bit –SRAM and DRAM used instead SRAM –Static Random access memory Made of D-latches Contents persists as long as power is on Read and write times are constant –Described by height (number of cells) × width (bits per cell) –e.g. 256K x 1 or even 1G x 1 18 address inputs or 30 address inputs 1 output (1 bit of data per cell)

COMP203/NWEN Memory Technologies 2 A Simplified Layout of a Memory Matrix wordlineswordlines memory cell (physical word) memory element (1 bit) 2 bit line SRAM 1 bit line DRAM bit lines (input/output)

COMP203/NWEN Memory Technologies 3 Example: A Typical SRAM Chip Chip select is used to turn this particular chip on - required prior to R or W Output enable allows the selected cell to assert its contents on Dout Write enable makes the selected cell update itself Typical spec – ns read time –4M x 1 (1997) –512Mx1 (2003) –1G X 1 (2008) Address Chip select Output enable Write enable Din7 - Din SRAM 32K x 8 Dout7 - Dout0 8

COMP203/NWEN Memory Technologies 4 Three-State (or Tri-State) Buffers register 0 register 1 32-to-1 multiplexor Dout The register file used a 32- to-1 multiplexor to ensure only one register drives Dout For a 64Kx1 SRAM a ‘centralised’ multiplexor is not practical Instead we let multiple memory elements drive each output via a three- state buffer As long as only one tri-state buffer is enabled all others will have a high impedance output Dout Select 0 Data 0 elem 0 Select 1 Data 1 elem 1 32 register Tri-state buffer

COMP203/NWEN Memory Technologies 5 Decoding Addresses in SRAMs This design is okay for small SRAM But for large SRAMs the decoder becomes the limiting factor Solution: two-level decoding (next slide)

COMP203/NWEN Memory Technologies 6 Example: Two-Level Decoding 32 KB In the first level each SRAM enables one 64-bit cell out of 512 cells –9 address lines needed In second level each multiplexor chooses one bit out of 64 –6 address lines needed Net effect is a large savings in PLAs size

COMP203/NWEN Memory Technologies 7 Dynamic Random Access Memory SRAMs use two inverters to store bits –bits can be stored indefinitely DRAMs use one transistor and one capacitor –much less hardware –but charge leaks away over time –bits need to be refreshed i.e. read out and written back in Capacitor Pass transistor Word line Bit line SRAM latch DRAM

COMP203/NWEN Memory Technologies 8 Refreshing Mechanisms Can be done by processor –but to refresh megabytes several times a second becomes costly More often done by memory chips themselves –entire rows can be refreshed at once –approximately 1% of memory cycles are lost to refreshing

COMP203/NWEN Memory Technologies 9 Two-Level DRAM In the first level the decoder enables one row out of 2048 –11 address lines needed –Each row has 2048 bits In the second level the multiplexor selects 1 bit out of 2048 –11 address lines needed Refresh involves writing a row from the column latches into the array row decoder x 2048 DRAM array 2048 column latches multiplexor Dout Address 10 to Address 0 Address 21 to Address 11 RefreshRefresh bits 1

COMP203/NWEN Memory Technologies 10 SRAM Performance in Early Sixties IC memory chips appeared in early sixties: –Capacity (size): 128 bits –Time to read (speed): ~ 1 microsecond –Power consumption: ~ 1 mW The same time Morris Mini was very popular: –Capacity: 4 persons –Speed: 100 km/hour –Consumption: 5 liters/100 km

COMP203/NWEN Memory Technologies 11 SRAM Performance After Fifty Years Capacity (size): 1.0 Gbits Time to read (speed): ~ 5 nanoseconds Power consumption: ~ 1 microWatt The net result of the development: –Capacity increase: 10 million times –Speed increase: 500 times –Consumption decrease: 1000 times

COMP203/NWEN Memory Technologies 12 What about Morris Mini? Morris Mini is still running on our streets What if it had undergone the same neck breaking development? –Capacity: persons (10 times the whole NZ) –Speed: km/hour –Consumption: 5 mill liters/100 km

COMP203/NWEN Memory Technologies 13 Example Memory Architecture CPU Registers (Flip-Flops) L1 Cache (SRAM) Main Memory (DRAM) Fastest, most expensive, smallest Slower, less expensive, greater Hard Disk Even slower, even less expensive, even greater

COMP203/NWEN Memory Technologies 14 Modern DRAM To access 1 bit: must set row and then column address –Fast page-mode DRAMS Provide faster access to subsequent bits on same row First access sets row and column addresses Subsequent accesses only change column address –Nibble-mode DRAMs go better Automatically generate next 3 column addresses So, each row access reads 4 bits sequentially –No need to wait for new column either –Extended Data Out (EDO) DRAM Similar to Fast page-mode But, can start loading new row address while still reading from previous row Provides ~50% speedup of page-mode –Bursting – fast delivering several consecutive words

COMP203/NWEN Memory Technologies 15 Summary SRAM –D-latches as memory elements –Separate word, bit input and bit output lines –Address decoding, 2-level decoding –Tri-state buffers –Very fast, but not very dense DRAM –Transistor/capacitor elements, need for refreshing –Word lines and common bit input/output lines –Slower but very dense –FPM, EDO, SDRAM Bursting