A Combined BIT and TIMESTAMP Algorithm for the List Update Problem

TitleA Combined BIT and TIMESTAMP Algorithm for the List Update Problem
Publication TypeTechnical Report
Year of Publication1995
AuthorsAlbers, S., von Stengel B., & Werchner R.
Other Numbers956
KeywordsAnalysis of Algorithms, Competitive Analysis, Linear Lists, list-update, On-line Algorithms
Abstract

A simple randomized on-line algorithm for the list update problem is presented that achieves a competitive factor of 1.6, the best known so far. The algorithm makes an initial random choice between two known algorithms that have different worst-case request sequences. The first is the BIT algorithm that, for each item in the list, alternates between moving it to the front of the list and leaving it at its place after it has been requested. The second is a TIMESTAMP algorithm that moves an item in front of less often requested items within the list.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1995/tr-95-016.pdf
Bibliographic Notes

ICSI Technical Report TR-95-016

Abbreviated Authors

S. Albers, B. von Stengel, and R. Werchner

ICSI Publication Type

Technical Report