𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parameterized Analysis of Paging and List Update Algorithms

✍ Scribed by Dorrigiv, Reza; Ehmsen, Martin R.; López-Ortiz, Alejandro

Book ID
120910105
Publisher
Springer
Year
2013
Tongue
English
Weight
766 KB
Volume
71
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Competitive analysis of randomized pagin
Competitive analysis of randomized paging algorithms
✍ Dimitris Achlioptas; Marek Chrobak; John Noga 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The paging problem is deÿned as follows: we are given a two-level memory system, in which one level is a fast memory, called cache, capable of holding k items, and the second level is an unbounded but slow memory. At each given time step, a request to an item is issued. Given a request to an item p,

Competitive Algorithms for Relaxed List
Competitive Algorithms for Relaxed List Update and Multilevel Caching
✍ Marek Chrobak; John Noga 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 188 KB

We study relaxed list update problem RLUP , in which access requests are made to items stored in a list. The cost to access the jth item x is c , where j j c F c for all i. After the access, x can be repeatedly swapped, at no cost, with i i q1 j any item that precedes it in the list. This problem w