Chapter 9 - Question #5 of 7

How would the size of the cache affect the performance? How about the replacement strategy used?  Advanced Question: Given three replacement strategies (FIFO, LRU, LFU) give a short program sequence involving references to cache where each of these strategies would give a different hit ratio.

 

A larger cache would require less accesses to physical memory, thereby decreasing processing time (or throughput).  The FIFO method appears to be the quickest for computers that run many types of programs.  This is because many accesses of different data is replaced and changed ( for instance my home computer).  If data wasn't changing much or if it was the same data I think that LFU is the best method; because programs that access the same data will do less exchanging of data to/from memory.  I think this is inefficient in home PCs because of the large number of programs running at any one time.  By having to track the usage and compare usage processing slows.  I think this would be more evident when large caches are involved.

 

To view my previous feedbacks, visit www.FaulknerWeb.com, then click on the UMUC link

E-mail me at Home

 

 

Home | Photos | WaterMark Multimedia | Online Shopping Outlet

Matt's Bio | UMUC | Feedback | Guest book | E-mail me

 

FaulknerWeb.com is designed and managed by Matt Faulkner.

Domain Name service provided by Namesecure

Web Service by eDataRack
Copyright © 1998 - 2011 [FaulknerWeb.com]. All rights reserved.
Updated: October 15, 2011 21:53 .