|Title:||Self-Organizing Lists and Independent References - A Statistical Synergy
|Authors:||M. Hofri and H. Shachnai
|Abstract:||Let R1...,Rn be a linear list of n elements. We assume the independent reference model, with a fixed but unknown access probability vector. The problem of dynamically reorganizing the list, on the basis of accrued references, with the objective of minimizing the expected access-cost is surveyed. The Counter Scheme (CS) is known to be asymptotically optimal for this purpose. This paper concentrates on the CS, with the aim of reducing its storage requirements. We start with a detailed exposition of its cost function. We 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. (ll) 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.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1988/CS/CS0524), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1988
To the main CS technical reports page
Computer science department, Technion