Amortized efficiency of list update and paging rules
Communications of the ACM
ACM Computing Surveys (CSUR)
The input/output complexity of sorting and related problems
Communications of the ACM
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Bounding the diffuse adversary
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line paging against adversarially biased random inputs
Journal of Algorithms
The working set model for program behavior
Communications of the ACM
The Accommodating Function: A Generalization of the Competitive Ratio
SIAM Journal on Computing
SIAM Journal on Computing
SIAM Journal on Computing
Self-Organizing Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Competitive Analysis of Paging
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
On paging with locality of reference
Journal of Computer and System Sciences
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The relative worst order ratio for on-line algorithms
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
On the relative dominance of paging algorithms
ISAAC'07 Proceedings of the 18th 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
| Hi-index | 0.01 |
We compare the theory and practice of online algorithms, and show that in certain instances there is a large gap between the predictions from theory and observed practice. In particular, the competitive ratio which is the main technique for analysis of online algorithms is known to produce unrealistic measures of performance in certain settings. Motivated by this we examine first the case of paging. We present a study of the reasons behind this apparent failure of the theoretical model. We then show that a new measure derived from first principles and introduced by [Angelopoulos, Dorrigiv and López-Ortiz, SODA 2007] better corresponds to observed practice. Using these ideas, we derive a new framework termed the cooperative ratio that generalizes to all other online analysis settings and illustrate with examples in list update.