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, CLRVV93, 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 nod es and the diameter of the network.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 |
| Publisher | Association for Computing Machinery |
| Pages | 574-583 |
| Number of pages | 10 |
| ISBN (Electronic) | 0898713668 |
| State | Published - 28 Jan 1996 |
| Externally published | Yes |
| Event | 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 - Atlanta, United States Duration: 28 Jan 1996 → 30 Jan 1996 |
Publication series
| Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| Volume | Part F129447 |
Conference
| Conference | 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 |
|---|---|
| Country/Territory | United States |
| City | Atlanta |
| Period | 28/01/96 → 30/01/96 |
Bibliographical note
Funding Information:*Johns Hopkins University and Lab. for Computer Science , MIT. Supported by NSF contract 9114&O-CCR, ARPA/Army contract DABT63-93-C-0038, ARPA/Air Force Contract F19628-95-C-0137, and NIST/USRA Contract 5555-47. E-Mail: baruchOcs.jhu.edu. ‘Department of Computer Science, School of ics, Tel-Aviv University, Tel-Aviv 69978, Israel. by a grant from the Israeli Academy of Sciences. [email protected],[email protected]