A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Dynamic RAM (DRAM) Organization and Refresh Cycles

College Depth 95 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
359prerequisites beneath it
See this on the map →
Memory Organization and AddressingMemory Bus Architecture and Interconnect→→Memory Interleaving and Bandwidth Optimization
dram memory-design refresh timing

Core Idea

A DRAM cell stores charge on a capacitor; a transistor gate controls access. DRAM is dense and cheap but must be refreshed (rewritten) periodically before charge leaks. Access is slower than SRAM and requires address multiplexing (row and column addresses on the same pins). Main memory uses DRAM; refresh cycles reduce available bandwidth.

Explainer

From your study of memory array organization, you know that memory is structured as a grid of rows and columns, with each intersection holding one bit. A DRAM cell is the simplest possible storage element: just one transistor and one tiny capacitor. The capacitor holds a charge (representing 1) or no charge (representing 0), and the transistor acts as a switch connecting the capacitor to a shared wire called the bit line. Compare this to an SRAM cell, which uses six transistors to hold its state in a feedback loop. DRAM's one-transistor design is why it achieves far higher density and lower cost per bit — and why virtually all main memory in computers is DRAM.

The fundamental tradeoff is that a capacitor leaks charge. Left alone, a DRAM cell will lose its stored value within milliseconds as the charge dissipates through the transistor and surrounding silicon. This means every cell must be periodically refreshed — read out and written back — before its charge drops below the threshold where the sense amplifier can distinguish 0 from 1. Modern DRAM refreshes every row in the array within a 64-millisecond window, typically using distributed refresh that spreads refresh operations across time rather than stalling the entire array at once. Each refresh cycle occupies the memory bus, stealing bandwidth from actual read and write requests. This refresh overhead is a constant tax on DRAM performance.

Accessing a DRAM cell is a multi-step process. First, the row address is sent and the corresponding row is activated — all cells in that row dump their charge onto the bit lines, where sense amplifiers detect and latch the values. This destructive read (the capacitors lose their charge) is why every access implicitly refreshes the row. Then the column address selects which bits from the activated row to output. The two-step addressing allows DRAM to share address pins between row and column signals (multiplexing), cutting the pin count in half compared to sending the full address at once. This pin reduction was a critical design decision that kept DRAM packages small and cheap, at the cost of requiring two address cycles per access.

Modern DRAM standards like DDR (Double Data Rate) build on this foundation with techniques to improve effective bandwidth: transferring data on both rising and falling clock edges, widening the internal bus, and allowing multiple banks to operate concurrently so one bank can be accessed while another refreshes. Understanding the basic cell structure and refresh requirement explains why DRAM latency is fundamentally higher than SRAM — and why the memory hierarchy you will study next uses small, fast SRAM caches in front of large, slow DRAM main memory to bridge the performance gap.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Binary Counters: Design and Analysis → Binary Arithmetic → Fixed-Point Number Representation → Two's Complement Representation → Overflow and Underflow Detection → Binary Adders: Half-Adders and Full-Adders → Full Adder and Carry Propagation → Carry Lookahead Adder Design → Half Adder Circuit Design → Multiplication Circuit Design → Sequential Circuit Design → Registers and Register Files → Instruction Set Architecture (ISA) → Assembly Language Basics → Memory Organization and Addressing → Memory Address Decoding → Memory Bus Architecture and Interconnect → Dynamic RAM (DRAM) Organization and Refresh Cycles

Longest path: 96 steps · 359 total prerequisite topics

Prerequisites (2)

Leads To (1)