๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Strongly competitive algorithms for caching with pipelined prefetching

โœ Scribed by Alexander Gaysinsky; Alon Itai; Hadas Shachnai

Book ID
108153360
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
215 KB
Volume
91
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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