The internal structure of Memory either RAM or ROM is made of memory cells that contain a memory bit. A group of 8 bits makes a byte. The memory is formed in a multidimensional array of rows and columns. In which each cell stores a bit and a complete row contains a word. A memory simply can be divided into this below form.
2n = N
where,n is the no. of address lines and N is the total memory in bytes.
There will be 2n words.
2D Memory organization –
In 2D organization, memory is divided in the form of rows and columns(Matrix). Each row contains a word, now in this memory organization, there is a decoder. A decoder is a combinational circuit that contains n input lines and 2n output lines. One of the output lines will select the row which address is contained in the MAR and the word which is represented by that row that will get selected and either read or write through the data lines.
2.5D Memory organization –
In 2.5D Organization the scenario is the same but we have two different decoders one is column decoder and another is row decoder. Column decoder used to select the column and row decoder is used to select the row. The address from the MAR will go in decoders’ input. Decoders will select the respective cell through the bit outline, the data from that location will be read or through the bit in line data will be written at that memory location.
Read and Write Operations –
- If the select line is in Read mode then the Word/bit which is represented by the MAR that will be coming out to the data lines and get read.
- If the select line is in write mode then the data from memory data register (MDR) will go to the respective cell which is addressed by the memory address register (MAR).
- With the help of the select line the data will get selected where the read and write operations will take place.
Comparison between 2D & 2.5D Organizations –
- In 2D organization hardware is fixed but in 2.5D hardware changes.
- 2D Organization requires more no. of Gates while 2.5D requires less no. of Gates.
- 2D is more complex in comparison to the 2.5D Organization.
- Error correction is not possible in the 2D organization but In 2.5D error correction is easy.
- 2D is more difficult to fabricate in comparison to the 2.5D organization.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Cache Memory in Computer Organization
- Cache Hits in Memory Organization
- Random Access Memory (RAM) and Read Only Memory (ROM)
- Introduction to memory and memory units
- Difference between Byte Addressable Memory and Word Addressable Memory
- Difference between Random Access Memory (RAM) and Content Addressable Memory (CAM)
- Difference between Virtual memory and Cache memory
- Difference between Uniform Memory Access (UMA) and Non-uniform Memory Access (NUMA)
- Computer Organization and Architecture | Pipelining | Set 1 (Execution, Stages and Throughput)
- Computer Organization and Architecture | Pipelining | Set 3 (Types and Stalling)
- Computer Organization and Architecture | Pipelining | Set 2 (Dependencies and Data Hazard)
- Computer Organization | Amdahl's law and its proof
- Computer Organization | Instruction Formats (Zero, One, Two and Three Address Instruction)
- Computer Organization | Locality and Cache friendly code
- Differences between Computer Architecture and Computer Organization
- Computer Organization | RISC and CISC
- Cache Organization | Set 1 (Introduction)
- Computer Organization | Hardwired v/s Micro-programmed Control Unit
- Computer Organization | Micro-Operation
- Computer Organization | Different Instruction Cycles
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.