Suppose that the register A and register K have the bit configuration. Only the three leftmost bits of A are compared with memory words because K has 1's in these positions. Because of its organization, this type of memory is uniquely suited to parallel searches by data association. This type of memory is known as
Content addressable memory
Content-addressable memory compares the search word with stored words in parallel. The mask register K selects which bit positions participate; with ones only in the three leftmost positions, only those three bits of every stored word are compared with the corresponding bits of the search register A. This is associative (content-addressable) memory.
Important Questions from Memory Hierarchy
A computer has a memory hierarchy consisting of two-level cache (L1 and L2) and a main memory. If the processor needs to access data from memory, it first looks into L1 cache. If the data is not found in L1 cache, it goes to L2 cache. If it fails to get the data from L2 cache, it goes to main memory, where the data is definitely available. Hit rates and access times of various memory units are shown in the figure. The average memory access time in nanoseconds (ns) is ________. (rounded off to two decimal places)
- Match List I with List II
List I List II A. Address Space I. Associative Mapping B. Memory Space II. Logical address C. Cache Memory III. physical address D. Segmented Program IV. Virtual address
Choose the correct answer from the options given below: - What unit of memory is largest out of the following?
Related to computers, what is 'Wetware'?
____ number of lines are required to select __________ memory locations.
