Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Empirical investigation of the Markov reference model
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Caching in networks (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
A New Competitive Analysis of Randomized Caching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Experimental Results on Statistical Approaches to Page Replacement Policies
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Performance Prediction in Production Environments
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Approximating the optimal replacement algorithm
Proceedings of the 1st conference on Computing frontiers
An optimal algorithm for minimizing run-time reconfiguration delay
ACM Transactions on Embedded Computing Systems (TECS)
Strongly competitive algorithms for caching with pipelined prefetching
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Least-recently-used caching with dependent requests
Theoretical Computer Science
On paging with locality of reference
Journal of Computer and System Sciences
SIGACT news online algorithms column 8
ACM SIGACT News
A page fault equation for modeling the effect of memory size
Performance Evaluation
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
Closing the gap between theory and practice: new measures for on-line algorithm analysis
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
On certain new models for paging with locality of reference
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Outperforming LRU via competitive analysis on parametrized inputs for paging
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
What is the best paging algorithm if one has partial information about the possible sequences of page requests? We give a partial answer to this question by presenting the analysis of strongly competitive paging algorithms in the access graph model. This model restricts page requests so that they conform to a notion of locality of reference given by an arbitrary access graph. We first consider optimal algorithms for undirected access graphs. Borodin et al. [ Proc. 23rd ACM Symposium on Theory of Computing, 1991, pp. 249--259] define an algorithm, called FAR, and prove that it is within a logarithmic factor of the optimal online algorithm. We prove that FAR is in fact strongly competitive, i.e., within a constant factor of the optimum. For directed access graphs, we present an algorithm that is strongly competitive on structured program graphs---graphs that model a subset of the request sequences of structured programs.