Survey of Existing Memory Devices Renee Gayle M. Chua.

Slides:



Advertisements
Similar presentations
Chapter 5 Internal Memory
Advertisements

Computer Organization and Architecture
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.
Memory Chapter 3. Slide 2 of 14Chapter 1 Objectives  Explain the types of memory  Explain the types of RAM  Explain the working of the RAM  List the.
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.
EECC551 - Shaaban #1 Lec # 10 Fall Computer System Components SDRAM PC100/PC MHZ bits wide 2-way inteleaved ~ 900 MBYTES/SEC.
Chapter 9 Memory Basics Henry Hexmoor1. 2 Memory Definitions  Memory ─ A collection of storage cells together with the necessary circuits to transfer.
DRAM. Any read or write cycle starts with the falling edge of the RAS signal. –As a result the address applied in the address lines will be latched.
1 COMP 206: Computer Architecture and Implementation Montek Singh Wed., Nov. 19, 2003 Topic: Main Memory (DRAM) Organization.
Memory Hierarchy.1 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output.
1 COMP 206: Computer Architecture and Implementation Montek Singh Mon., Nov. 18, 2002 Topic: Main Memory (DRAM) Organization – contd.
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.
* Definition of -RAM (random access memory) :- -RAM is the place in a computer where the operating system, application programs & data in current use.
CSIT 301 (Blum)1 Memory. CSIT 301 (Blum)2 Types of DRAM Asynchronous –The processor timing and the memory timing (refreshing schedule) were independent.
CompE 460 Real-Time and Embedded Systems Lecture 5 – Memory Technologies.
Memory Technology “Non-so-random” Access Technology:
Spring 2007W. Rhett DavisNC State UniversityECE 747Slide 1 ECE 747 Digital Signal Processing Architecture SoC Lecture – Working with DRAM April 3, 2007.
SDRAM Synchronous dynamic random access memory (SDRAM) is dynamic random access memory (DRAM) that is synchronized with the system bus. Classic DRAM has.
Chapter 1 Upgrading Memory Prepared by: Khurram N. Shamsi.
Types of RAM By Alysha Gould. TYPES OF RAM SIMM’S DIMM’S DRAM SDRAM RDAM VDRAM.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 8 – Memory Basics Logic and Computer Design.
RAM (Random Access Memory) By Nick Cary, Zach Taylor, and Sam Gurnsey.
Computer Architecture Part III-A: Memory. A Quote on Memory “With 1 MB RAM, we had a memory capacity which will NEVER be fully utilized” - Bill Gates.
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
Chapter 5 Internal Memory. Semiconductor Memory Types.
EEE-445 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output Cache Main Memory Secondary Memory (Disk)
Memory System Unit-IV 4/24/2017 Unit-4 : Memory System.
Main Memory CS448.
University of Tehran 1 Interface Design DRAM Modules Omid Fatemi
Asynchronous vs. Synchronous Counters Ripple Counters Deceptively attractive alternative to synchronous design style State transitions are not sharp! Can.
Memory Cell Operation.
Modern DRAM Memory Architectures Sam Miller Tam Chantem Jon Lucas CprE 585 Fall 2003.
Dynamic Random Access Memory (DRAM) CS 350 Computer Organization Spring 2004 Aaron Bowman Scott Jones Darrell Hall.
Computer Architecture Lecture 24 Fasih ur Rehman.
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.
How do you model a RAM in Verilog. Basic Memory Model.
Semiconductor Memory Types
The Evolution of Dynamic Random Access Memory (DRAM) CS 350 Computer Organization and Architecture Spring 2002 Section 1 Nicole Chung Brian C. Hoffman.
Digital Circuits Introduction Memory information storage a collection of cells store binary information RAM – Random-Access Memory read operation.
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š.
Chapter 5 Internal Memory. contents  Semiconductor main memory - organisation - organisation - DRAM and SRAM - DRAM and SRAM - types of ROM - types of.
CS35101 Computer Architecture Spring 2006 Lecture 18: Memory Hierarchy Paul Durand ( ) [Adapted from M Irwin (
Computer Architecture Chapter (5): Internal Memory
“With 1 MB RAM, we had a memory capacity which will NEVER be fully utilized” - Bill Gates.
Types of RAM (Random Access Memory) Information Technology.
COMP541 Memories II: DRAMs
Chapter 5 Internal Memory
William Stallings Computer Organization and Architecture 7th Edition
Types of RAM (Random Access Memory)
COMP541 Memories II: DRAMs
William Stallings Computer Organization and Architecture 7th Edition
William Stallings Computer Organization and Architecture 8th Edition
William Stallings Computer Organization and Architecture 8th Edition
AKT211 – CAO 07 – Computer Memory
William Stallings Computer Organization and Architecture 8th Edition
Bob Reese Micro II ECE, MSU
Presentation transcript:

Survey of Existing Memory Devices Renee Gayle M. Chua

Introduction  Dynamic RAM (DRAM)  Most commonly used type of system memory  Requires refreshing every few milliseconds  Holds data for a very short time  Less expensive than static RAM

Introduction  These are the steps in order to access a cell in DRAM: A row command to latch in Row address A column command to latch in Column address A necessary delay between the two commands as well as a delay after the column command for the I/O circuit to drive valid data.

Introduction  Fast Page Mode (FPM) DRAM  Sending the row address just once for many accesses to memory in locations near each other, improving access time  takes advantage of the fact that when cells within the same row are accessed, the row command doesn’t need to be repeated.  Page mode - operation mode where multiple column commands follow a single row command  Burst mode access - memory is not read one byte at a time (32 or 64 bits at a time), but in several consecutive chunks of memory

FPM/EDO Memory  Read Timing & Memory Access Diagrams

Synchronous DRAM  SDRAM is designed to synchronize itself with the timing of the CPU  take advantage of interleaving and burst mode functions, which make memory retrieval even faster.  SDRAM modules come in several different speeds so as to synchronize to the clock speeds of the systems they'll be used in.  E.g. PC66 SDRAM runs at 66MHz; PC100 SDRAM runs at 100MHz

Burst Mode Feature  Burst Mode  Bursting is a rapid data-transfer technique that automatically generates a block of data (a series of consecutive addresses) every time the processor requests a single address.  The assumption is that the next data-address the processor will request will be sequential to the previous one.

Important Timing Terms 1. t RP - The time required to switch internal memory banks. (RAS Precharge) 2. t RCD - The time required between /RAS (Row Address Select) and /CAS (Column Address Select) access. 3. t AC - The amount of time necessary to "prepare" for the next output in burst mode. 4. t CAC - The Column Access Time. 5. t CL - (or CL) CAS Latency. 6. t CLK - The Length of a Clock Cycle. 7. RAS - Row Address Strobe or Row Address Select. 8. CAS - Column Address Strobe or Column Address Select. 9. Read Cycle Time - The time required to make data ready by the next clock cycle in burst mode.  Note #1: t RAC (Random Access Time) is calculated as t RCD + t CAC = t RAC Note #2: RAS and CAS normally appear in technical manuals with an over-line as in RAS or CAS.

SDRAM Read Cycle Clock 1: ACTIVATE the row by turning on /CS and /RAS. (place the proper row address on the address bus – chip will know which row you want to ACTIVATE. Clock 3: READ the column you want from the row you've ACTIVATED by turning on /CAS while placing the column's address on the address bus. Clocks 5-10: The data from the row and column that you gave the chip goes out onto the Data Bus, followed by a BURST of other columns, the order of which depends on which BURST MODE you've set. (More on BURST in a second). t CAC - The Column Access Time t RAC (Random Access Time)

Double Data Rate DRAM  the next generation SDRAM.  DDR reads data on both the rising and falling edges of the clock signal (SDRAM only carries information on the rising edge of a signal)  Data transfer is then twice as fast: i.e. instead of a data rate of 133MHz, DDR memory transfers data at 266MHz.  DDR is not backward compatible with SDRAM- designed motherboards

DDR DRAM  Added circuitry: produces a data output strobe (DQS)  syncs data output to the external clock  allows DDR to transfer the results of a read on both clock edges.  Writes: DQS signal generated by the chipset's memory interface to sync the write data to both edges of the clock

Rambus DRAM  A revolutionary step from SDRAM  Has changes to the bus structure and how signals are carried  Rambus memory sends less information on the data bus (which is 18 bits wide as opposed to the standard 32 or 64 bits) but it sends data more frequently.  It also reads data on both the rising and falling edges of the clock signal, as DDR does. As a result, Rambus memory is able to achieve effective data transfer speeds of 800MHz and higher.

Rambus DRAM  Each RAMBUS chip has only 16 data pins on it, just like an SDRAM chip, which is enough to spit out only two bytes at a time.  How, then, does an RDRAM provide full system bandwidth with only 16 data pins?  Multiplexing is the key to RAMBUS' excellent granularity and low pin count

Multiplexor: sits in between the DRAM core's 16-byte internal data bus and the two, single-byte Data A and Data B buses that make up the two-byte wide RAMBUS data channel. These muxes take data in 8-byte wide chunks off of the two internal buses and stream them a byte at a time down the 1-byte wide Data A and Data B buses.

RDRAM RDRAM READ: The data from the banks travels over the two, 8-byte core buses, is multiplexed onto the Data A and Data B buses, and then travels out the 16 data pins and onto the 16-bit data bus towards the CPU.