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
Journal ArticleDOI
Providing performance guarantees in multipass network processors
TL;DR: This paper provides a model that captures many of the characteristics of the Multipass NP architecture, and considers several scheduling and buffer management algorithms that are specially designed to optimize the performance of multipass network processors.
Proceedings ArticleDOI
Jitter control in QoS networks
Yishay Mansour,Boaz Patt-Shamir +1 more
TL;DR: It is proved that 2B space is the minimum space required by any on-line algorithm to provide delay- jitter related to the best possible delay-jitter using B buffer space and that the guarantees made by the online algorithm hold even for distributed implementations.
Journal ArticleDOI
Improved bounds for on-line load balancing
TL;DR: An on-line algorithm with a competitive ratio of 3.5981 against currentload and a reassignment factor of 79.4 is presented to minimize the maximum load on any machine.
Journal ArticleDOI
Lower bounds in on-line geometric searching
TL;DR: A new technique to prove lower bounds for geometric on-line searching problems based on the competitive ratio, that is, the ratio of the distance traveled by the searcher to the distance of the target.
Journal ArticleDOI
On the Competitive Theory and Practice of Online List Accessing Algorithms
TL;DR: Two new families of optimal, 2-competitive, deterministic online algorithms of list accessing algorithms are presented and the degree of locality has a considerable influence on the algorithms' absolute and relative costs, as well as on their rankings.
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.