Journal ArticleDOI
Amortized efficiency of list update and paging rules
Reads0
Chats0
TLDR
This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.Abstract:
In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes t(i) time, we show that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, do not share this property. We generalize our results to show that move-to-front is within a constant factor of optimum as long as the access cost is a convex function. We also study paging, a setting in which the access cost is not convex. The paging rule corresponding to move-to-front is the “least recently used” (LRU) replacement rule. We analyze the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule (Belady's MIN algorithm) by a factor that depends on the size of fast memory. No on-line paging algorithm has better amortized performance.read more
Citations
More filters
Book ChapterDOI
An optimal competitive strategy for walking in streets
TL;DR: In this paper, the authors present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before.
Journal ArticleDOI
Toward efficient monitoring
TL;DR: This paper provides a formal description of the problem of monitoring rapidly changing data, and proposes different algorithms for each classes in terms of the integrity constraints that govern the evolution of the environment, and presents heuristics for low-cost low-complexity measuring algorithms.
Proceedings ArticleDOI
Improved algorithms and analysis for secretary problems and generalizations
TL;DR: The methods are very intuitive and apply to some generalizations of the classical secretary problem, and derive a lower bound on the trade-off between the probability of selecting the best object and its expected rank.
Journal ArticleDOI
Admission control with immediate notification
TL;DR: The effect of the notification model on the non-preemptive scheduling of a single resource in order to maximize utilization is studied and alternate algorithms which provide immediate notification are presented, while matching most of the performance guarantees which are possible by schedulers which provide no such notification.
Proceedings ArticleDOI
Switching between two on-line list update algorithms for higher compression of Burrows-Wheeler transformed data
TL;DR: Encoding data by switching between two universal data compression algorithms achieves higher rates of compression than either algorithm alone, and when paired with variants of the move-to-front algorithm in a switching scheme, the Best x of 2x-1 algorithms achieve higher compression of PIIDs.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
A study of replacement algorithms for a virtual-storage computer
TL;DR: One of the basic limitations of a digital computer is the size of its available memory; an approach that permits the programmer to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions.
Book
Operating Systems Theory
TL;DR: As one of the part of book categories, operating systems theory always becomes the most wanted book.