Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Design and analysis of efficient application-specific on-line page replacement techniques
GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
On paging with locality of reference
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Paging on a RAM with Limited Resources
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Integrated prefetching and caching in single and parallel disk systems
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Strongly competitive algorithms for caching with pipelined prefetching
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
On paging with locality of reference
Journal of Computer and System Sciences
Integrated prefetching and caching in single and parallel disk systems
Information and Computation
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Integrated prefetching and caching in single and parallel disk systems
Information and Computation
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Real-time integrated prefetching and caching
Journal of Scheduling
| Hi-index | 0.00 |
The access graph model for paging, defined by (Borodin et al., 1991) and studied in (Irani et al., 1992) has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access graph itself may be very large. We present a truly online strongly competitive paging algorithm in the access graph model that does not have any prior information on the access sequence. We give both strongly competitive deterministic and strongly competitive randomized algorithms. Our algorithms need only O(k log n) bits of memory, where k is the number of page slots available and n is the size of the virtual address space, i.e., no more memory than needed to store the virtual translation tables for pages in memory. In fact, we can reduce this to O(k log k) bits using appropriate probabilistic data structures. We also extend the locality of reference concept captured by the access graph model to allow changes in the behavior of the underlying process. We formalize this by introducing the concept of an "extended access graph". We consider a graph parameter /spl Delta/ that captures the degree of change allowed. We study this new model and give algorithms that are strongly competitive for the (unknown) extended access graph. We can do so for almost all values of /spl Delta/ for which it is possible.