Pei Cao, Edward W. Felten, and Kai Li
Department of Computer Science
Princeton, NJ 08544 USA
We demonstrate that for applications that do not perform well under traditional caching policies, the combination of good application-chosen replacement strategies, and our kernel allocation policy LRU-SP, can reduce the number of block I/Os by up to 80 , and can reduce the elapsed time by up to 45 . We also show that LRU-SP is crucial to the performance improvement for multiple concurrent applications: LRU-SP fairly distributes cache blocks and offers protection against foolish applications.
To Become a USENIX Member, please see our Membership Information.