On list update with locality of reference |
| |
Affiliation: | 1. Department of Computer Science, Technische Universität München, Boltzmannstr. 3, 85748 Garching, Germany;2. Department of Computer Science, University of Freiburg, Georges Köhler Allee 79, 79110 Freiburg, Germany |
| |
Abstract: | We present a comprehensive study of the list update problem with locality of reference. More specifically, we present a combined theoretical and experimental study in which the theoretically proven and experimentally observed performance guarantees of algorithms match or nearly match. Firstly, we introduce a new model of locality of reference that closely captures the concept of runs. Using this model we develop refined theoretical analyses of popular list update algorithms. Secondly, we present an extensive experimental study in which we have tested the algorithms on traces from benchmark libraries. The theoretical and experimental bounds differ by just a few percent. Our new theoretical bounds are substantially lower than those provided by standard competitive analysis. It shows that the well-known Move-To-Front strategy exhibits the best performance. Its refined competitive ratio tends to 1 as the degree of locality increases. This confirms that Move-To-Front is the method of choice in practice. |
| |
Keywords: | Data structures Self-organizing lists Online algorithms Competitive analysis Locality of reference |
本文献已被 ScienceDirect 等数据库收录! |
|