Amortized efficiency of list update and paging rules

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 θ(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.

UAV Routing and Coordination in Stochastic, Dynamic Environments

“…Thus, these algorithms are designed to operate in scenarios where the entire input is not known at the outset, and new pieces of the input should be incorporated as they become available. The distinctive feature of the online algorithm approach is the method used to evaluate an algorithm's performance, which is called competitive analysis (Sleator and Tarjan, 1985). In competitive analysis, the performance of an online algorithm is compared to the performance of a corresponding offline algorithm (i.e., an algorithm that has a priori knowledge of the entire input) in the worst-case scenario.…”

Carrying Umbrellas: an Online Relocation Game on a Graph

“…As a measure of efficiency, we adopt the competitive ratio [9], which has been widely used in analyzing the performance of online algorithms. Let σ = σ 1 · · · σ L be a request sequence of the adversary, where σ i = (v i , w i ) is the request in the i-th phase.…”

Advice Complexity of Fine-Grained Job Shop Scheduling

“…The competitive ratio is the ratio of the solution computed by the online algorithm and the cost of the optimal offline solution. This approach is called competitive analysis; it was introduced by Sleator and Tarjan in 1985 [11]. We now formally define the above concepts, i.e., online problems (in this paper, we only consider the objective to minimize some cost), online algorithms, and their competitive ratio.…”