Affiliation:
1. AT&T Bell Laboratories, Murray Hill, NJ
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.
Publisher
Association for Computing Machinery (ACM)
Reference9 articles.
1. Andqrson E.J. Nash I'. and Weber R.R. A counterexample to a conjecture on optimal list ordering. {. Appl. Prob. to appear. Andqrson E.J. Nash I'. and Weber R.R. A counterexample to a conjecture on optimal list ordering. {. Appl. Prob. to appear.
Cited by
1364 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Multivehicle Perimeter Defense in Conical Environments;IEEE Transactions on Robotics;2024
2. Delaying Decisions and Reservation Costs;Lecture Notes in Computer Science;2023-12-09
3. Online Demand Peak Shaving with Machine-Learned Advice in Cyber-Physical Energy Systems;2023 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech);2023-11-14
4. Optimizing Reconfigurable Optical Datacenters: The Power of Randomization;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11
5. Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions;Computers & Operations Research;2023-11