/
Memory Organization in Computer Systems
Save to my account
Sign up
Memory Organization in Computer Systems
Memory Organization in Computer Systems
Study
1
Question
What are the different types of memory organization in a computer system?
Answer
Memory units are organized in a hierarchy, including Registers, Cache, Main Memory, Virtual Memory, and ROM.
2
Question
What is RAM?
Answer
RAM stands for Random Access Memory and is a type of main memory.
3
Question
What is Dynamic RAM (DRAM)?
Answer
DRAM is made of capacitors that discharge over time and needs constant refreshing.
4
Question
What is Static RAM (SRAM)?
Answer
SRAM does not need constant refreshing, is made from D-flip-flops circuits, is faster, but more expensive than DRAM.
5
Question
What is ROM?
Answer
ROM stands for Read-Only Memory, which does not allow writing access, does not require refreshing, and retains memory with little charge.
6
Question
What distinguishes main memory from other types of memory?
Answer
Main memory can either be RAM or ROM and is characterized as memory that is of a faster speed but also more expensive as it approaches the CPU.
7
Question
How does the CPU access data if it is not in its registers?
Answer
If the data is not in the CPU's registers, it requests data from the nearest memory cache; if not found, it checks the main memory, and if not there, it requests it from the disk.
8
Question
What is a 'cache hit'?
Answer
A cache hit occurs when data is found on a device.
9
Question
What is a 'cache miss'?
Answer
A cache miss occurs when data isn't found on a device.
10
Question
What is the 'hit rate'?
Answer
The hit rate is the percentage of time data is found in a device.
11
Question
What is the 'miss rate'?
Answer
The miss rate is the percentage of time data isn't found in a device.
12
Question
What is the formula for calculating miss rate?
Answer
Miss rate = 1 - hit rate.
13
Question
What is 'hit time'?
Answer
Hit time is the time it takes to find and access data.
14
Question
What is 'miss penalty'?
Answer
Miss penalty is the time wasted processing a miss, including replacing blocks of memory and delivering data to the processor.
15
Question
What are registers in the context of memory access?
Answer
Registers are the smallest access time memory units, directly addressing data for the CPU.
16
Question
What are the levels of cache memory?
Answer
Cache memory typically contains levels such as Level 1 and Level 2.
17
Question
What is virtual memory?
Answer
Virtual memory involves hard disks and SSDs, has higher access time, and provides more storage space at a lower cost.
18
Question
What is the principle of locality?
Answer
The principle of locality states that if a piece of data is needed, nearby data will likely be needed soon after.
19
Question
What is 'temporal locality'?
Answer
Temporal locality refers to the concept that recently accessed data will be accessed again soon.
20
Question
What is 'spatial locality'?
Answer
Spatial locality indicates that access tends to cluster, with related data being accessed together.
21
Question
What is 'sequential locality'?
Answer
Sequential locality describes the accessing of instructions in a sequential manner.
22
Question
What is content addressable memory?
Answer
Content addressable memory speeds up access to data and is smaller than main memory.
23
Question
Why is one large cache not ideal?
Answer
One large cache is not ideal because the 'content' that searches the cache is in a part of the memory address called a field, and it's inefficient to manage.
24
Question
What is a tag field in cache memory?
Answer
A tag field selects a block to search through in cache memory.
25
Question
What is the significance of the offset field in cache memory?
Answer
The offset field points to the specific data within the selected block in cache memory.
26
Question
What is a direct mapped cache?
Answer
In a direct mapped cache, each main memory block is assigned a specific block in the cache.
27
Question
How can a cache block be calculated?
Answer
Cache block can be calculated using the formula: Cache block = block from memory mod number of cache blocks.
28
Question
What is meant by fully associative cache?
Answer
In a fully associative cache, not each memory block is mapped to a specific cache address. Instead, each address has tag and offset fields.
29
Question
What is set associative cache?
Answer
Set associative cache combines concepts of direct mapped and fully associative caches, mapping a block of memory to different cache blocks.
30
Question
What is a replacement policy in cache memory?
Answer
A replacement policy selects which cache block to evict when the cache is full.