## Distributed Paging for General Networks (1996)

### Cached

### Download Links

- [www.math.tau.ac.il]
- [www.icsi.berkeley.edu]
- [condor.cs.jhu.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 58 - 5 self |

### BibTeX

@MISC{Awerbuch96distributedpaging,

author = {Baruch Awerbuch and Yair Bartal and Amos Fiat},

title = {Distributed Paging for General Networks},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

Distributed paging [BFR92, ABF93b, AK95] deals with the dynamic allocation of copies of files in a distributed network as to minimize the total communication cost over a sequence of read and write requests. Most previous work deals with the file allocation problem [BS89, West91, CLRW93, ABF93a, WY93, Koga93, AK94, LRWY94] where infinite nodal memory capacity is assumed. In contrast the distributed paging problem makes the more realistic assumption that nodal memory capacity is limited. Former work on distributed paging deals with the problem only in the case of a uniform network topology. This paper gives the first distributed paging algorithm for general networks. The algorithm is competitive in storage and communication. The competitive ratios are poly-logarithmic in the total number of network nodes and the diameter of the network. Johns Hopkins University and Lab. for Computer Science, MIT. Supported by Air Force Contract TNDGAFOSR-86-0078, ARO contract DAAL03-86-K-0171, NSF contract 9114440-CCR, DARPA contract N00014J -92-1799, and a special grant from IBM. E-Mail: baruch@theory.lcs.mit.edu. y Department of Computer Science, School of Mathematics, Tel-Aviv University, Tel-Aviv 69978, Israel. Supported by a grant from the Israeli Academy of Sciences. E-mail: yairb@math.tau.ac.il, fiat@math.tau.ac.il 0 1