04 - 02 Memory Organization
04 - 02 Memory Organization
UNIT – IV
Memory Organization
Prof. Murali Nath R S, Ms. Kavitha P & Ms. Nagamani G
Department of Computer Science & Engineering
Memory
Examples Hierarchy
Main Memory
Auxiliary memory
Associate Memory
Cache Memory
BVRIT HYDERABAD College of Engineering for Women
Why Should I Study this course?
Memory Hierarchy
Examples
Examples
Access Mode
Access Time
- Seek Time
- Transfer Time
Transfer Rate
Capacity
Cost
The number of accesses to memory depends on the location of the item and the
efficiency of the search algorithm.
The time for search can be reduced considerably if stored data can be identified for
access by the content of the data rather than by an address.
BVRIT HYDERABAD College of Engineering for Women
A memory unit accessed by content is called an Associative Memory or
Content Addressable Memory (CAM).
This can be accessed simultaneously and in parallel on the basis of data
content. not by specific address or location.
The memory locates all words matching the specified content and marks them
for reading.
This memory is uniquely suited to do parallel searches by data association.
CAM is more expensive than RAM, as each cell must have storage capability
as well as logic circuits for matching its content with an external argument.
BVRIT HYDERABAD College of Engineering for Women
Why Should I Study this course?
Hardware Organization
Examples
First, neglect the key bits and compare the argument in A with the bits
stored in the cells of the words.
Word i is equal to the argument in A if Aj = Fij for j = 1, 2, …, n.
The equality of two bits can be expressed logically by the Boolean function:
xj = AjFij + AjFij
The match logic for word i in an associative memory can now be expressed by the
following Boolean function:
Mi = (x1 + Kl )(x2 + K2)(x3 + K3) · · · (xn + Kn)
𝑛
𝑀𝑖 = 𝐴𝑗 𝐹𝑖𝑗 + 𝐴𝑗 𝐹𝑖𝑗 + 𝐾𝑗
𝑗=1
The execution time can be reduced by placing the active portions of the
program and data in a fast small memory, cache memory.
Examples
Examples
Examples