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
Competitive robot mapping with homogeneous markers
Xiaotie Deng,Andranik Mirzaian +1 more
TL;DR: This paper applies the competitive analysis method for robot explorations to the problem of graph maps with homogeneous markers, and finds that a strategy is optimal if it minimizes the worst-case ratio of the total number of edges traversed when constructing a map of the graph to the optimum number of edge traversed in verifying the correctness of a givenMap of the same graph.
Journal ArticleDOI
A lower bound for randomized list update algorithms
TL;DR: A randomized request sequence σs is constructed that no deterministic on-line algorithm can service with an expected cost less than 3 2 − 5 (n+5) times the off-line cost ( n denoting the length of the list).
Proceedings ArticleDOI
Experimental studies of access graph based heuristics: beating the LRU standard?
Amos Fiat,Ziv Rosen +1 more
TL;DR: New paging heuristics motivated by the access graph model of paging are devised, which are truly on-line in that they do not assume any prior knowledge of the program just about to be executed.
Integrated and Dynamic Vehicle and Crew Scheduling
TL;DR: In this article, a dynamic approach has been developed to prevent the snowball effect in public transport services for the passengers in order to improve the reliability of the public transport service for passengers.
Proceedings ArticleDOI
Randomized and multipointer paging with locality of reference
Amos Fiat,Anna R. Karlin +1 more
TL;DR: This work presents a randomized algorithm which is strongly competitive against oblivious adversaries for undirected access graphs, and presents strongly competitive algorithms against adversaries that can use multiple pointers into the access graph in order to construct the reference sequence.
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.