Journal of the ACM Bibliography
P. A. Franaszek and T. J. Wagner. Some
distribution-free aspects of paging algorithm performance. Journal
of the ACM, 21(1):31-39, January 1974.
[BibTeX entry]
Additional Key Words and Phrases:
paging algorithms, demand paging algorithms, demand paging, replacement
algorithms, storage hierarchies
Selected papers that cite this one
- Sabah al Binali. The competitive analysis of
risk taking with applications to online trading. In 38th
Annual Symposium on Foundations of Computer Science, pages
336-344, Miami Beach, Florida, 20-22 October 1997. IEEE.
- Allan Borodin, Sandy Irani, Prabhakar Raghavan, and Baruch Schieber. Competitive
paging with locality of reference. Journal of Computer and
System Sciences, 50(2):244-258, April 1995.
- Duane Buck and Mukesh Singhal. An analytic study of
caching in computer systems. Journal of Parallel and
Distributed Computing, 32(2):205-214, 1 February 1996.
- Amos Fiat and Anna R. Karlin. Randomized and multipointer
paging with locality of reference. In Proceedings of the
Twenty-Seventh Annual ACM Symposium on the Theory of Computing,
pages 626-634, Las Vegas, Nevada, 29 May-1 June 1995.
- Sandy Irani, Anna R. Karlin, and Steven Phillips. Strongly
competitive algorithms for paging with locality of reference.
SIAM Journal on Computing, 25(3):477-497, June 1996.
Selected references
Shortcuts: