Abstract
Distributed paging 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, 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 rates are poly-logarithmic in the total number of network nodes and the diameter of the network.
| Original language | English |
|---|---|
| Pages (from-to) | 67-104 |
| Number of pages | 38 |
| Journal | Journal of Algorithms |
| Volume | 28 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1998 |
| Externally published | Yes |
Bibliographical note
Funding Information:* Supported by Air Force Contract TNDGAFOSR-86-0078, ARO Contract DAAL03-86K-0171, NSF Contract 9114440-CCR, DARPA Contract N00014-J-92-1799, and a special grant from IBM. E-mail: [email protected]. ²'Supported by a grant from the Israeli Academy of Sciences. E-mail: [email protected]; [email protected].