dram
play

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

Dec 05, 2022 •229 likes •550 views

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

  1. DRAM 1

  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 Only one bit line is read at a time. • Refresh data The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown. 2

  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 Wordline 1 SRAM • Reading • Precharge • Assert word line + - • Sense output Only one bit line is read at a time. • Refresh data The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown. 2

  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 Wordline 1 SRAM • Reading • Precharge • Assert word line + - • Sense output Only one bit line is read at a time. • Refresh data The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown. 2

  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 Wordline 1 SRAM • Reading • Precharge • Assert word line + - • Sense output Only one bit line is read at a time. • Refresh data The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown. 2

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

  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 Wordline 1 SRAM • Reading • Precharge • Assert word line + - • Sense output Only one bit line is read at a time. • Refresh data The other bit line serves as a reference. The bit cells attached to Wordline 1 are not shown. 2

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

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

  10. DRAM Lithography 4

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  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 6

  27. DRAM: Micron MT47H512M4 7

  28. DRAM: Micron MT47H512M4 8

Recommend

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
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
2018 2019 Demand Response Auction Mechanism ( DRAM DRAM 3) 3) Pre Bi Pre Bid

2018 2019 Demand Response Auction Mechanism ( DRAM DRAM 3) 3) Pre Bi Pre Bid

2018 2019 Demand Response Auction Mechanism ( DRAM DRAM 3) 3) Pre Bi Pre Bid (Bidder dders) Web Conf We Confer erence ence Ma March 21, 21, 2017 2017 Presenta Pre entation will ill begi begin at at 10:00 10:00 a.m a.m.

693 views • 51 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
Gather-Scatter DRAM In-DRAM Address Translation to Improve the Spatial Locality of Non-unit

Gather-Scatter DRAM In-DRAM Address Translation to Improve the Spatial Locality of Non-unit

Gather-Scatter DRAM In-DRAM Address Translation to Improve the Spatial Locality of Non-unit Strided Accesses Vivek Seshadri Thomas Mullins, Amirali Boroumand, Onur Mutlu, Phillip B. Gibbons, Michael A. Kozuch, Todd C. Mowry Executive summary

532 views • 28 slides
DRAM Dynamic Random Access Memory (DRAM) Storage Charge on a capacitor Decays

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

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

721 views • 32 slides
AGENDA Just a quick overview of what DRAM is, how it works, and what you should know about it

AGENDA Just a quick overview of what DRAM is, how it works, and what you should know about it

WHAT GRAPHICS PROGRAMERS NEED TO KNOW ABOUT DRAM ERIK BRUNVAND, NILADRISH CHATTERJEE, DANIEL KOPTA AGENDA Just a quick overview of what DRAM is, how it works, and what you should know about it as a programmer. A look at the circuits so

602 views • 38 slides
Viyojit: Decoupling Battery and DRAM Capacities for Battery-Backed DRAM Rajat Kateja # Anirudh

Viyojit: Decoupling Battery and DRAM Capacities for Battery-Backed DRAM Rajat Kateja # Anirudh

Viyojit: Decoupling Battery and DRAM Capacities for Battery-Backed DRAM Rajat Kateja # Anirudh Badam*, Sriram Govindan*, Bikash Sharma + , Greg Ganger # # CMU, *Microsoft, + Facebook (work done while at Microsoft) Overview Problem

284 views • 13 slides
DRAM CONTROLLER Mahdi Nazm Bojnordi Assistant Professor School of Computing University of Utah

DRAM CONTROLLER Mahdi Nazm Bojnordi Assistant Professor School of Computing University of Utah

DRAM CONTROLLER Mahdi Nazm Bojnordi Assistant Professor School of Computing University of Utah CS/ECE 6810: Computer Architecture Overview Announcement Homework 5 submission deadline: Apr. 10 th This lecture DRAM control DRAM

137 views • 11 slides
DRAM CONTROLLER Mahdi Nazm Bojnordi Assistant Professor School of Computing University of Utah

DRAM CONTROLLER Mahdi Nazm Bojnordi Assistant Professor School of Computing University of Utah

DRAM CONTROLLER Mahdi Nazm Bojnordi Assistant Professor School of Computing University of Utah CS/ECE 6810: Computer Architecture Overview Announcement Homework 4 will be released on Nov. 28 th This lecture DRAM control DRAM

654 views • 34 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
ACCORD: Associativity for DRAM Caches by Coordinating Way-Install and Way-Prediction ISCA 2018

ACCORD: Associativity for DRAM Caches by Coordinating Way-Install and Way-Prediction ISCA 2018

ACCORD: Associativity for DRAM Caches by Coordinating Way-Install and Way-Prediction ISCA 2018 Vinson Young (GT) Chiachen Chou (GT) Authors: Aamer Jaleel (NVIDIA) Moinuddin K. Qureshi (GT) 1 3D-DRAM MITIGATES BANDWIDTH WALL Modern system

625 views • 37 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
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
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
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
Performance Optimization Y. Kim, V. Seshadri, D. Lee, J. Liu, and O. Mutlu. A case for

Performance Optimization Y. Kim, V. Seshadri, D. Lee, J. Liu, and O. Mutlu. A case for

DRAM Refresh J. Liu, B. Jaiyen, Y. Kim, C. Wilkerson, and O. Mutlu. An experimental study of data retention behavior in modern dram devices: Implications for retention time profiling mechanisms. In International Symposium on Computer

727 views • 3 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
Mitigating Wordline Crosstalk using Adaptive Trees of Counters Mohammad Seyedzadeh , Alex Jones,

Mitigating Wordline Crosstalk using Adaptive Trees of Counters Mohammad Seyedzadeh , Alex Jones,

Mitigating Wordline Crosstalk using Adaptive Trees of Counters Mohammad Seyedzadeh , Alex Jones, Rami Melhem University of Pi8sburgh Wordline Crosstalk in DRAM DRAM Scaling High Memory Capacity Voltage Fluctua<ons DRAM Cells

527 views • 33 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
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
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
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

More recommend