Fast distributed network decompositions and covers

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg

Research output: Contribution to journalArticlepeer-review

49 Scopus citations

Abstract

This paper presents deterministic sublinear-time distributed algorithms for network decomposition and for constructing a sparse neighborhood cover of a network. The latter construction leads to improved distributed preprocessing time for a number of distributed algorithms, including all-pairs shortest paths computation, load balancing, broadcast, and bandwidth management.

Original languageEnglish
Pages (from-to)105-114
Number of pages10
JournalJournal of Parallel and Distributed Computing
Volume39
Issue number2
DOIs
StatePublished - 15 Dec 1996
Externally publishedYes

Bibliographical note

Funding Information:
4This work was done while the author was a graduate student in the Department of Mathematics at the Massachusetts Institute of Technology and supported in part by Air Force Contract OSR-89-02171, Army Contract DAAL-03-86-K-0171, and DARPA Contract N00014-91-J-1698.

Funding Information:
3Supported in part by an NSF postdoctoral research fellowship and an ONR grant provided to the Radcliffe Bunting Institute.

Funding Information:
2Supported by NSF Contract 9114440-CCR, ARPA/Army Contract DABT63-93-C-0038, ARPA/Air Force Contract F19628-95-C-0137, and NIST/USRA Contract 5555-47.

Funding Information:
5Supported in part by an Allon Fellowship, by a Bantrell Fellowship, by a Walter and Elise Haas Career Development Award, and by the Israel Basic Research Foundation.

Funding

4This work was done while the author was a graduate student in the Department of Mathematics at the Massachusetts Institute of Technology and supported in part by Air Force Contract OSR-89-02171, Army Contract DAAL-03-86-K-0171, and DARPA Contract N00014-91-J-1698. 3Supported in part by an NSF postdoctoral research fellowship and an ONR grant provided to the Radcliffe Bunting Institute. 2Supported by NSF Contract 9114440-CCR, ARPA/Army Contract DABT63-93-C-0038, ARPA/Air Force Contract F19628-95-C-0137, and NIST/USRA Contract 5555-47. 5Supported in part by an Allon Fellowship, by a Bantrell Fellowship, by a Walter and Elise Haas Career Development Award, and by the Israel Basic Research Foundation.

FundersFunder number
ARPA/ArmyF19628-95-C-0137, DABT63-93-C-0038
Department of Mathematics
Israel Basic Research Foundation
NIST/USRA5555-47
Radcliffe Bunting Institute
National Science Foundation9114440-CCR
Office of Naval Research
Defense Advanced Research Projects AgencyN00014-91-J-1698
Air Force Institute of TechnologyDAAL-03-86-K-0171, OSR-89-02171

    Fingerprint

    Dive into the research topics of 'Fast distributed network decompositions and covers'. Together they form a unique fingerprint.

    Cite this