Distributed paging for general networks

Baruch Awerbuch; Yair Bartal; Amos Fiat

doi:10.1006/jagm.1998.0924

Distributed paging for general networks

Baruch Awerbuch^*, Yair Bartal, Amos Fiat

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

36 Scopus citations

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	https://doi.org/10.1006/jagm.1998.0924
State	Published - 1998

Funding

Funders	Funder number
Israeli Academy of Sciences
National Science Foundation	9114440-CCR
Army Research Office	DAAL03-86K-0171
Defense Advanced Research Projects Agency	N00014-J-92-1799
International Business Machines Corporation
Air Force Institute of Technology	TNDGAFOSR-86-0078

Access to Document

10.1006/jagm.1998.0924

Cite this

@article{aaa3b18574344ebc84d98cb6764dfebd,

title = "Distributed paging for general networks",

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.",

author = "Baruch Awerbuch and Yair Bartal and Amos Fiat",

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].",

year = "1998",

doi = "10.1006/jagm.1998.0924",

language = "אנגלית",

volume = "28",

pages = "67--104",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Distributed paging for general networks

AU - Awerbuch, Baruch

AU - Bartal, Yair

AU - Fiat, Amos

N1 - 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].

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0002013494&partnerID=8YFLogxK

U2 - 10.1006/jagm.1998.0924

DO - 10.1006/jagm.1998.0924

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0002013494

SN - 0196-6774

VL - 28

SP - 67

EP - 104

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 1

ER -

Distributed paging for general networks

Abstract

Funding

Access to Document

Other files and links

Fingerprint

Cite this