Amortized Efficiency of List Update and Paging Rules

DMCA

Amortized Efficiency of List Update and Paging Rules (1985)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Daniel D. Sleator , Robert E. Tarjan

Citations:

823 - 8 self

BibTeX

@MISC{Sleator85amortizedefficiency,
    author = {Daniel D. Sleator and Robert E. Tarjan},
    title = {Amortized Efficiency of List Update and Paging Rules},
    year = {1985}
}

OpenURL

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 0(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, da 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 offline 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.

Keyphrases

amortized efficiency paging rule list update access cost convex function similar rule min algorithm wide class on-line paging algorithm frequency count rule fast memory natural heuristic amortized complexity offline paging rule constant factor consfant factor ith element efficiency differs linear list list maintenance rule replacement rule

DMCA