![]() ![]() It offers the flexibility of utilizing a wide variety of replacements algorithms if a cache miss occurs.The placement policy provides better cache hit rate.Fully associative cache structure provides us the flexibility of placing memory block in any of the cache lines and hence full utilization of the cache.Based on the Offset, a byte is selected and returned to the processor.If it doesn’t match, then it’s a cache miss and has to be fetched from the lower memory. If it matches, the block is present in the cache and is a cache hit. The Tag field of the memory address is compared with tag bits associated with all the cache lines.The eviction of memory block from the cache is decided by the replacement policy.If the cache is completely occupied then a block is evicted and the memory block is placed in that cache line. ![]() If the valid bit is 0, the new memory block can be placed in the cache line, else it has to be placed in another cache line with valid bit 0.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |