We address the tradeo between the competitive ratio and the resources used by randomized on-line algorithms for caching. Two algorithms reported in the literature that achieve the optimal ratio H k require a lot of memory and perform extensive computation at each step. On the other hand, a very simp
โฆ LIBER โฆ
On-Line File Caching
โ Scribed by Young
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 104 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
More on randomized on-line algorithms fo
โ
Marek Chrobak; Elias Koutsoupias; John Noga
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 143 KB
Caching and Writeback Policies in Parall
โ
D. Kotz; C.S. Ellis
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 541 KB
Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk \(1 / O\) subsystems have been proposed as one way to close the gap between processor and disk speeds. Such parallel disk systems require parallel file system software to a
Studies on striping and buffer caching i
โ
Jong-Hoon Kim; SeWoong Eom; Sam H. Noh; Yoo-Hun Won; Bok-Gyu Joo
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 496 KB
Experience with using CORBA to implement
โ
A. Sim; H. Nordberg; L. M. Bernardo; A. Shoshani; D. Rotem
๐
Article
๐
2001
๐
John Wiley and Sons
๐
English
โ 360 KB
Cache replacement policies for P2P file
โ
Wierzbicki, Adam ;Leibowitz, Nathaniel ;Ripeanu, Matei ;Wo?niak, Rafa?
๐
Article
๐
2004
๐
John Wiley and Sons
๐
English
โ 343 KB
On Generalized Connection Caching
โ
Albers
๐
Article
๐
2002
๐
Springer
๐
English
โ 139 KB