Washington University

Slides:



Advertisements
Similar presentations
Chapter 5 Internal Memory
Advertisements

Computer Organization and Architecture
Prith Banerjee ECE C03 Advanced Digital Design Spring 1998
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)
COEN 180 DRAM. Dynamic Random Access Memory Dynamic: Periodically refresh information in a bit cell. Else it is lost. Small footprint: transistor + capacitor.
These slides incorporate figures from Digital Design Principles and Practices, third edition, by John F. Wakerly, Copyright 2000, and are used by permission.
1 DIGITAL DESIGN I DR. M. MAROUF MEMORY Read-only memories Static read/write memories Dynamic read/write memories Author: John Wakerly (CHAPTER 10.1 to.
EKT 221 : DIGITAL 2. Today’s Outline  Dynamic RAM (DRAM)  DRAM Cell – The Hydraulic Analogy  DRAM Block Diagram  Types of DRAM.
EECC341 - Shaaban #1 Lec # 19 Winter Read Only Memory (ROM) –Structure of diode ROM –Types of ROMs. –ROM with 2-Dimensional Decoding. –Using.
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)
CS 151 Digital Systems Design Lecture 30 Random Access Memory (RAM)
1 EE365 Read-only memories Static read/write memories Dynamic read/write memories.
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.
CompE 460 Real-Time and Embedded Systems Lecture 5 – Memory Technologies.
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.
Faculty of Information Technology Department of Computer Science Computer Organization and Assembly Language Chapter 5 Internal Memory.
CS/CoE 536 : Lockwood 1 CS/CoE 536 Reconfigurable System On Chip Design Lecture 9 : MP3 Working Draft Washington University Fall 2002
Survey of Existing Memory Devices Renee Gayle M. Chua.
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.
CPEN Digital System Design
Digital Logic Design Instructor: Kasım Sinan YILDIRIM
Topics to be covered : How to model memory in Verilog RAM modeling Register Bank.
Asynchronous vs. Synchronous Counters Ripple Counters Deceptively attractive alternative to synchronous design style State transitions are not sharp! Can.
Overview Memory definitions Random Access Memory (RAM)
Computer Architecture Lecture 24 Fasih ur Rehman.
Feb. 26, 2001Systems Architecture I1 Systems Architecture I (CS ) Lecture 12: State Elements, Registers, and Memory * Jeremy R. Johnson Mon. Feb.
How do you model a RAM in Verilog. Basic Memory Model.
Semiconductor Memory Types
COMP541 Memories II: DRAMs
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.
CS/CoE 536 : Lockwood 1 Step 1 : Submit Project Information Visit : –Provide Project.
CS/CoE 536 : Lockwood 1 CS/CoE 536 Reconfigurable System On Chip Design Lecture 11 : Priority and Per-Flow Queuing in Machine Problem 3 (Revision 2) Washington.
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š.
CS/CoE 536 : Lockwood 1 CS/CoE 536 Reconfigurable System On Chip Design Lecture 10 : MP3 Working Draft Washington University Fall 2002
“With 1 MB RAM, we had a memory capacity which will NEVER be fully utilized” - Bill Gates.
Chapter 3 Memory Basics. Memory ??? A major component of a digital computer and many digital systems. Stores binary data, either permanently or temporarily.
Mini project Viva Schedule – choose date
COMP541 Memories II: DRAMs
Overview Memory definitions Random Access Memory (RAM)
Chapter 3 Memory Basics.
Chapter 5 Internal Memory
William Stallings Computer Organization and Architecture 7th Edition
7-5 DRAM ICs High storage capacity Low cost
Reducing Hit Time Small and simple caches Way prediction Trace caches
Recap DRAM Read Cycle DRAM Write Cycle FAST Page Access Mode
COMP541 Memories II: DRAMs
Chapter 5 Memory.
William Stallings Computer Organization and Architecture 7th Edition
William Stallings Computer Organization and Architecture 8th Edition
EE345: Introduction to Microcontrollers Memory
William Stallings Computer Organization and Architecture 7th Edition
William Stallings Computer Organization and Architecture 8th Edition
Digital Logic & Design Dr. Waseem Ikram Lecture 40.
Washington University
DRAM Hwansoo Han.
William Stallings Computer Organization and Architecture 8th Edition
Bob Reese Micro II ECE, MSU
FIGURE 7-1 Block Diagram of Memory
Presentation transcript:

Washington University CS/CoE 536 Reconfigurable System On Chip Design Lecture 12 : Random Access Memory Washington University Fall 2002 http://www.arl.wustl.edu/~lockwood/class/cs536/ John Lockwood Copyright 2002 Lockwood@arl.wustl.edu

Dynamic RAM DRAMs commonly used as main memory in processor based embedded systems High capacity Low cost Many variations of DRAMs proposed FPM DRAM: fast page mode DRAM EDO DRAM: extended data out DRAM SDRAM: Synchronous DRAM RDRAM: rambus DRAM Typically found off-chip Due to process technology limitations Slide From: Embedded Systems Design: A Unified Hardware/Software Introduction, (c) 2000 Vahid/Givargis

Basic DRAM Address bus multiplexed between row and column components Row latched by strobing ras Column latched by cas Refresh circuitry can be external or internal strobes consecutive memory address periodically causing memory content to be refreshed Refresh circuitry disabled during read or write operation Data In Buffer Out Buffer rd/ wr data Row Addr. Buffer Col Addr . Buffer address ras cas Bit storage array Row Decoder Col Decoder Refresh Circuit cas, ras, clock Sense Amplifiers Slide From: Embedded Systems Design: A Unified Hardware/Software Introduction, (c) 2000 Vahid/Givargis

Fast Page Mode DRAM (FPM DRAM) Each row of memory bit array is viewed as a page Page contains multiple words Individual words addressed by column address Timing diagram: Row (page) address sent 3 words read by sending column address for each row col data ras cas address Slide From: Embedded Systems Design: A Unified Hardware/Software Introduction, (c) 2000 Vahid/Givargis

Extended data out DRAM (EDO DRAM) Improvement of FPM DRAM Extra latch before output buffer allows strobing of cas before data read operation completed Reduces read/write latency by additional cycle row col data Speedup through overlap ras cas address Slide From: Embedded Systems Design: A Unified Hardware/Software Introduction, (c) 2000 Vahid/Givargis

Synchronous DRAM (SDRAM) SDRAM latches data on active edge of clock Eliminates time to detect ras/cas and rd/wr signals A counter incremented on edge of clock to access consecutive memory columns locations clock ras cas address data row col row col data Slide From: Embedded Systems Design: A Unified Hardware/Software Introduction, (c) 2000 Vahid/Givargis

SDRAM Interface Specification Off-Chip Synchronous Random Access Memory (SDRAM) .. Sarang .. SDRAM_GRANT1 SDRAM Interface SDRAM_RQ SDRAM_GRANT2 SDRAM_REQUEST_BUS[22:0] SDRAM_DATA[63:0]

Detailed Operation of the Flow Buffer Off-Chip Synchronous Random Access Memory (SDRAM) 3: Packet Data stored in M[x] 2: packet from M[z] Free List Manager 5: z returned to the Free List 4: New memory pointer, y, provided from free list Free.Ptr 4: M[z].data transmitted Flow Buffer Packet Data p p Packet Data 2: Queue Manager provides an address Memory pointer, x = Flow[i].tail Tail.Ptr Head.Ptr 3: QM sets Flow[I].head = M[z].next Flow# Queue Manager 1: New packet data arrives on Flow Number i 5: Queue Manager provided with new memory pointer, y. Set Flow[i].tail = y 1: QM Decides it is time for a packet to depart. Reads Flow[i].head = z

Detailed Machine Problem 3 Structure Off-Chip Synchronous Random Access Memory (SDRAM) Off-Chip Static Random Access Memory (SRAM) SDRAM Controller SRAM Controller Identify packets Based on SDRAM Free List Manager SDRAM Free pointers Content- based Match (regex) (MP2) CAM-based Firewall (MP1 w/extra entries & FlowID) Flow Buffer p p p p Head Pointers Tail Pointers SRAM Interface Input Traffic Data From Linecard 16 Output Traffic Data To Linecard or switch Queue Manager (MP 3) Scheduler (RR, DRR, 3DQ) Match vector Flow# from CAM Layered Protocol Wrappers Firewall on a Chip ( Implemented on the RAD on the FPX, a VirtexE 2000 FPGA )