dram dynamic random access memory dram
play

DRAM Dynamic Random Access Memory (DRAM) Storage Charge on a - PowerPoint PPT Presentation

Jul 13, 2023 •396 likes •721 views

DRAM Dynamic Random Access Memory (DRAM) Storage Charge on a capacitor Decays over time (us-scale) This is the dyanamic part. About 6F 2 : 20x better than SRAM Reading Precharge Assert word line

  1. DRAM

  2. Dynamic Random Access Memory (DRAM) • Storage • Charge on a capacitor • Decays over time (us-scale) • This is the “dyanamic” part. • About 6F 2 : 20x better than SRAM • Reading • Precharge • Assert word line • Sense output • Refresh data Only one bit line is read at a time. The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown.

  3. Dynamic Random Access Memory (DRAM) • Storage Bitline 0 Bitline 1 • Charge on a capacitor • Wordline 0 Decays over time (us-scale) • This is the “dyanamic” part. • About 6F 2 : 20x better than SRAM • Reading Wordline 1 • Precharge • Assert word line • Sense output • Refresh data + - Only one bit line is read at a time. The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown.

  4. Dynamic Random Access Memory (DRAM) • Storage Bitline 0 Bitline 1 • Charge on a capacitor • Wordline 0 Decays over time (us-scale) • This is the “dyanamic” part. • About 6F 2 : 20x better than SRAM • Reading Wordline 1 • Precharge • Assert word line • Sense output • Refresh data + - Only one bit line is read at a time. The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown.

  5. Dynamic Random Access Memory (DRAM) • Storage Bitline 0 Bitline 1 • Charge on a capacitor • Wordline 0 Decays over time (us-scale) • This is the “dyanamic” part. • About 6F 2 : 20x better than SRAM • Reading Wordline 1 • Precharge • Assert word line • Sense output • Refresh data + - Only one bit line is read at a time. The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown.

  6. Dynamic Random Access Memory (DRAM) • Storage Bitline 0 Bitline 1 • Charge on a capacitor • Wordline 0 Decays over time (us-scale) • This is the “dyanamic” part. Bit destroyed! • About 6F 2 : 20x better than SRAM • Reading Wordline 1 • Precharge • Assert word line • Sense output • Refresh data + - Only one bit line is read at a time. The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown.

  7. Dynamic Random Access Memory (DRAM) • Storage Bitline 0 Bitline 1 • Charge on a capacitor • Wordline 0 Decays over time (us-scale) • This is the “dyanamic” part. • About 6F 2 : 20x better than SRAM • Reading Wordline 1 • Precharge • Assert word line • Sense output • Refresh data + - Only one bit line is read at a time. The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown.

  8. Dynamic Random Access Memory (DRAM) • Storage Bitline 0 Bitline 1 • Charge on a capacitor • Wordline 0 Decays over time (us-scale) • Bit Restored This is the “dyanamic” part. • About 6F 2 : 20x better than SRAM • Reading Wordline 1 • Precharge • Assert word line • Sense output • Refresh data + - Only one bit line is read at a time. The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown.

  9. DRAM: Write and Refresh Bitline 0 Bitline 1 Wordline 0 • Writing • Turn on the wordline • Override the sense amp. • Refresh Wordline 1 • Every few micro-seconds, read and re-write every bit. • Consumes power • Takes time + -

  10. DRAM Lithography

  11. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) • Reads and/or writes

  12. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) Row Address • Reads and/or writes

  13. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) Row Address • Reads and/or writes

  14. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) Row Address • Reads and/or writes

  15. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) • Reads and/or writes

  16. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) Column Address • Reads and/or writes

  17. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) Column Address • Reads and/or writes

  18. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) Column Address • Reads and/or writes

  19. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) Column Address • Reads and/or writes

  20. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) • Reads and/or writes

  21. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) • Reads and/or writes Column Address

  22. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) • Reads and/or writes Column Address

  23. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) • Reads and/or writes Column Address

  24. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) • Reads and/or writes Column Address

  25. Accessing DRAM One DD3 8K bits DRAM bank • Apply the row address Row decoder • “opens a page” High order bits DRAM array 16k Rows • Slow (~12ns read + 24 ns precharge) • Contents in a “row Sense Amps buffer” Row Buffer • Apply one or more Low order bits Column decoder column addrs • fast (~3ns) • Reads and/or writes

  26. DRAM Devices • There are many banks per die (16 at left) • Multiple pages can be open at once. • Can keep pages open longer • Parallelism • Example • open bank 1, row 4 • open bank 2, row 7 • open bank 3, row 10 • read bank 1, column 8 • read bank 2, column 32 • ... Micron 78nm 1Gb DDR3

  27. DRAM: Micron MT47H512M4

  28. DRAM: Micron MT47H512M4

Recommend

DRAM 1 Dynamic Random Access Memory (DRAM) Storage Charge on a capacitor Decays

DRAM 1 Dynamic Random Access Memory (DRAM) Storage Charge on a capacitor Decays

DRAM 1 Dynamic Random Access Memory (DRAM) Storage Charge on a capacitor Decays over time (us-scale) This is the dyanamic part. About 6F 2 : 20x better than SRAM Reading Precharge Assert word line

550 views • 31 slides
UMBC A B M A L T F O U M B C I M Y O R T 1 (12/8/04) I E S R C E O V U

UMBC A B M A L T F O U M B C I M Y O R T 1 (12/8/04) I E S R C E O V U

Advanced VLSI Design Memory CMPE 640 Memory Can be categorized into: Read Write Memory (RWM) Random Access Memory (RAM): static SRAM (faster) verses dynamic DRAM (smaller) structures possible. Access time independent of physical

381 views • 21 slides
COMP 590-154: Computer Architecture Memory / DRAM SRAM vs. DRAM SRAM = Static RAM As

COMP 590-154: Computer Architecture Memory / DRAM SRAM vs. DRAM SRAM = Static RAM As

COMP 590-154: Computer Architecture Memory / DRAM SRAM vs. DRAM SRAM = Static RAM As long as power is present, data is retained DRAM = Dynamic RAM If you dont do anything, you lose the data SRAM: 6T per bit built with

1.41k views • 38 slides
Module 6.1 Memory Access Performance DRAM Bandwidth Objective To learn that memory

Module 6.1 Memory Access Performance DRAM Bandwidth Objective To learn that memory

GPU Teaching Kit Accelerated Computing Module 6.1 Memory Access Performance DRAM Bandwidth Objective To learn that memory bandwidth is a first-order performance factor in a massively parallel processor DRAM bursts, banks, and

464 views • 12 slides
Virtual Memory Lecture 25 CS301 DRAM as cache What about programs larger than DRAM?

Virtual Memory Lecture 25 CS301 DRAM as cache What about programs larger than DRAM?

Virtual Memory Lecture 25 CS301 DRAM as cache What about programs larger than DRAM? When we run multiple programs, all must fit in DRAM! Add another larger, slower level to the memory hierarchy - use part of the hard drive.

834 views • 61 slides
Memory Devices Small: Register file (group of numbered registers) Medium: SRAM (Static Random

Memory Devices Small: Register file (group of numbered registers) Medium: SRAM (Static Random

Memory Devices Small: Register file (group of numbered registers) Medium: SRAM (Static Random Access Memory) Large: DRAM (Dynamic Random Access Memory) Future? 1 Processor: Data Path Components 1 3 2 Instruction ALU Registers Memory Fetch

402 views • 22 slides
Main Memory and DRAM Nima Honarmand Spring 2016 :: CSE 502 Computer Architecture SRAM vs.

Main Memory and DRAM Nima Honarmand Spring 2016 :: CSE 502 Computer Architecture SRAM vs.

Spring 2016 :: CSE 502 Computer Architecture Main Memory and DRAM Nima Honarmand Spring 2016 :: CSE 502 Computer Architecture SRAM vs. DRAM SRAM = Static RAM As long as power is present, data is retained DRAM = Dynamic RAM

497 views • 37 slides
Why Use Scheduling? Sequential accesses to DRAM Memory Access are wasteful Scheduler

Why Use Scheduling? Sequential accesses to DRAM Memory Access are wasteful Scheduler

Why Use Scheduling? Sequential accesses to DRAM Memory Access are wasteful Scheduler Improve latency and bandwidth of memory requests Matthew Cohen, Alvin Lin Order requests to take advantage 6.884 Complex Digital Systems of

91 views • 5 slides
Memory technologies Access time Technologi Cost $/GB SRAM 1 ns 1000 DRAM 50 ns 100 HDD

Memory technologies Access time Technologi Cost $/GB SRAM 1 ns 1000 DRAM 50 ns 100 HDD

Memory technologies Access time Technologi Cost $/GB SRAM 1 ns 1000 DRAM 50 ns 100 HDD 10 ms 1 Fast memory is expensive and inexpensive memories are slow! Principal figures. William Sandqvist william@kth.se Memory Hierarchy

918 views • 87 slides
Large Scale DRAM Model DRAM Engineers DRAM Engineers Team: Abdulrahman Alqahtani,

Large Scale DRAM Model DRAM Engineers DRAM Engineers Team: Abdulrahman Alqahtani,

Large Scale DRAM Model DRAM Engineers DRAM Engineers Team: Abdulrahman Alqahtani, Demetria Shepherd, Colby Weber, Jinming Yang, Zeyu Zhang Client: Daniel Eichenberger, Microns Test Engineer/Recruiter Capstone Mentor: Ashwija

306 views • 8 slides
Memory RWM NVRWM ROM Random Non-Random EPROM Mask-Programmed Access Access E 2 PROM

Memory RWM NVRWM ROM Random Non-Random EPROM Mask-Programmed Access Access E 2 PROM

Memory RWM NVRWM ROM Random Non-Random EPROM Mask-Programmed Access Access E 2 PROM Programmable (PROM) FLASH FIFO SRAM LIFO DRAM Shift Register CAM Memory Decoders M bits M bits S 0 S 0 Word 0 Word 0 S 1 Word 1 Word 1 A 0 S

1.55k views • 61 slides
Page 1 Increasing Bandwidth - Interleaving Main Memory Performance Access Pattern without

Page 1 Increasing Bandwidth - Interleaving Main Memory Performance Access Pattern without

Classical DRAM Organization (square) bit (data) lines EECS 252 Graduate Computer r Each intersection represents o a 1-T DRAM Cell w Architecture RAM Cell d Array e c o Lec 23 Storage Technology d word (row) select e r David

277 views • 14 slides
Chapter 5 Internal Memory Contents Semiconductor main memory Organization DRAM and

Chapter 5 Internal Memory Contents Semiconductor main memory Organization DRAM and

Chapter 5 Internal Memory Contents Semiconductor main memory Organization DRAM and SRAM Types of ROM Chip logic Chip packaging Module organization Error correction Advanced DRAM organization Synchronous

304 views • 27 slides
Memory Hierarchy Instructor: Jun Yang 1 11/19/2009 Motivation Processor-DRAM Memory Gap

Memory Hierarchy Instructor: Jun Yang 1 11/19/2009 Motivation Processor-DRAM Memory Gap

Memory Hierarchy Instructor: Jun Yang 1 11/19/2009 Motivation Processor-DRAM Memory Gap (latency) Proc 1000 CPU 60%/yr. Moores Law (2X/1.5yr) Performance 100 Processor-Memory Performance Gap: (grows 50% / year) 10 DRAM

862 views • 36 slides
The CPU-Memory Gap 100,000,000.0 10,000,000.0 Disk 1,000,000.0 SSD 100,000.0 Disk seek time

The CPU-Memory Gap 100,000,000.0 10,000,000.0 Disk 1,000,000.0 SSD 100,000.0 Disk seek time

High-Performance Data Storage Sean Barker 1 Data Storage Disks Hard disk (HDD) Solid state drive (SSD) Random Access Memory Dynamic RAM (DRAM) Static RAM (SRAM) Registers %rax, %rbx, ... Sean Barker 2 The

453 views • 9 slides
Emerging Non Volatile Memory Resistive Memory Technologies Key concept: replace DRAM cell

Emerging Non Volatile Memory Resistive Memory Technologies Key concept: replace DRAM cell

Emerging Non Volatile Memory Resistive Memory Technologies Key concept: replace DRAM cell capacitor with a programmable resistor 1T-1C DRAM 1T-1R STT-MRAM, PCM, RRAM Charge based sensing Resistance based sensing

666 views • 19 slides
Analyzing the Performance Benefit of Near-Memory Acceleration based on Commodity DRAM Devices

Analyzing the Performance Benefit of Near-Memory Acceleration based on Commodity DRAM Devices

Analyzing the Performance Benefit of Near-Memory Acceleration based on Commodity DRAM Devices Hadi Asghari-Moghaddam and Nam Sung Kim University of Illinois at Urbana-Champaign 2 Why Near-DRAM Acceleration? higher bandwidth demand but

400 views • 16 slides
Who Cares About the Impact on Performance Memory Hierarchy? Suppose a processor executes at

Who Cares About the Impact on Performance Memory Hierarchy? Suppose a processor executes at

8/20/08 Technology Trends Computer System Architecture Capacity Speed (latency) Logic: 2x in 3 years 2x in 3 years DRAM: 4x in 3 years 2x in 10 years Memory Part I Disk: 4x in 3 years 2x in 10 years DRAM Chalermek

290 views • 5 slides
Main Memory and DRAM Instructor: Nima Honarmand Spring 2015 :: CSE 502 Computer Architecture

Main Memory and DRAM Instructor: Nima Honarmand Spring 2015 :: CSE 502 Computer Architecture

Spring 2015 :: CSE 502 Computer Architecture Main Memory and DRAM Instructor: Nima Honarmand Spring 2015 :: CSE 502 Computer Architecture SRAM vs. DRAM SRAM = Static RAM As long as power is present, data is retained DRAM =

484 views • 37 slides
Modern DRAM Memory Systems Brian T. Davis MTU Interview Seminar Advanced Computer Architecture

Modern DRAM Memory Systems Brian T. Davis MTU Interview Seminar Advanced Computer Architecture

Modern DRAM Memory Systems Brian T. Davis MTU Interview Seminar Advanced Computer Architecture Laboratory University of Michigan April 24, 2000 page 1 Brian T. Davis Introduction Memory system Research objective DRAM

526 views • 38 slides
DRAM Access Reduction by Node Fusion with TVM Chia-Wei Chang, Jing-Jia Liou, Chih-Tsun Huang,

DRAM Access Reduction by Node Fusion with TVM Chia-Wei Chang, Jing-Jia Liou, Chih-Tsun Huang,

DRAM Access Reduction by Node Fusion with TVM Chia-Wei Chang, Jing-Jia Liou, Chih-Tsun Huang, Wei-Chung Hsu & Juin-Ming Lu National Tsing Hua University & Industrial Technology Research Institute Dec 5th, 2019 1 DRAM Access Consumes

233 views • 6 slides
Persistent Memory Use Cases in Modern Software Architectures Olasoji Denloye SW Engineer Intel

Persistent Memory Use Cases in Modern Software Architectures Olasoji Denloye SW Engineer Intel

Persistent Memory Use Cases in Modern Software Architectures Olasoji Denloye SW Engineer Intel Corporation Persistent Memory 3 Properties of Persistent Memory Byte-addressable like DRAM Direct user-level access Lowers DRAM

503 views • 23 slides
Introduction Modern DRAM Memory Architectures Sam Miller Memory subsystem is a bottleneck

Introduction Modern DRAM Memory Architectures Sam Miller Memory subsystem is a bottleneck

Introduction Modern DRAM Memory Architectures Sam Miller Memory subsystem is a bottleneck Tam Chantem Memory stall time will become dominant Jon Lucas New architectures & accessing techniques proposed to combat these issues

422 views • 4 slides
Kilo Instruction Processors Adrin Cristal 2/7/2019 YALE 80 Processor-DRAM Gap (latency)

Kilo Instruction Processors Adrin Cristal 2/7/2019 YALE 80 Processor-DRAM Gap (latency)

Kilo Instruction Processors Adrin Cristal 2/7/2019 YALE 80 Processor-DRAM Gap (latency) Proc 1000 CPU 60%/yr. Moores Law Performance 100 Processor-Memory Performance Gap: (grows 50% / year) 10 DRAM 7%/yr. DRAM 1

248 views • 22 slides

More recommend