Abstract
fundamental challenge in improving file system performance is to design effective block replacement algorithms to minimize buffer cache misses. In this paper an algorithm is proposed for buffer cache management with prefetching. The buffer cache contains two units, the main cache unit and prefetch unit. The sizes of both the units are fixed. The total sizes of both the units are a constant. Blocks are fetched in one block look ahead prefetch principle. The block placement and replacement policies are defined. The replacement strategy depends on the most recently accessed block and the defined miss count percentage or hit count percentage of the blocks. FIFO algorithm is used for the prefetch unit.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
