𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Competitive Analysis of Scheduling Algorithms for

✍ Scribed by Wojciech Jawor; Marek Chrobak; Christoph Dürr


Publisher
Springer
Year
2007
Tongue
English
Weight
470 KB
Volume
51
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Competitive analysis of randomized pagin
✍ 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,