Competitive Paging With Locality of Reference (1991)

Cached

Download Links

by Allan Borodin , Prabhakar Raghavan , Sandy Irani , Baruch Schieber
Venue:Journal of Computer and System Sciences
Citations:124 - 3 self

Active Bibliography

Access Graph Based Heuristics for On-line Paging Algorithms – Beverly Sackler, Faculty Exact Science, Ziv Rosen, Ziv Rosen - 1996
Abstract Competitive Paging with Locality of Reference – Allan Borodin S, Y Irani
31 Experimental Studies of Access Graph Based Heuristics: Beating the LRU standard? – Amos Fiat, Ziv Rosen - 1997
60 MARKOV PAGING – Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan - 2000
73 Strongly Competitive Algorithms for Paging with Locality of Reference – Sandy Irani, et al. - 1995
555 Optimal Aggregation Algorithms for Middleware – Ronald Fagin, Amnon Lotem , Moni Naor - 2001
521 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
575 Lightweight causal and atomic group multicast – Kenneth Birman, Andre Schiper, Pat Stephenson - 1991
893 Memory Coherence in Shared Virtual Memory Systems – Kai Li, Paul Hudak - 1989