Abstract
Let R 1,…, R n be a linear list of n elements. We assume the independent reference model, with a fixed but unknown access probability vector. We survey briefly the problem of reorganizing the list dynamically, on the basis of accrued references, with the objective of minimizing the expected access cost. The counter scheme (CS) is known to be asymptotically optimal for this purpose. The paper explores the CS, with the aim of reducing its storage requirements. We start with a detailed exposition of its cost function and then point out that it interacts with the access model to produce some remarkable synergistic effects. These make it possible to use very effective “truncated versions” of the CS, which have very modest space requirements. The versions we consider are: (i) the “limited-counters scheme”, which bounds each of the frequency counters to a maximal value c; (ii) the original CS with a bound on the number of references during which the scheme is active. The bound is chosen so as to achieve a desired level of performance compared with the optimal policy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have