Distributed computing on regular networks with anonymous nodes

Author

Lakshman, T.V. ; Wei, Victor K.

Author_Institution

Bell Commun. Res., Red Bank, NJ, USA

Volume

43

Issue

2

fYear

1994

fDate

2/1/1994 12:00:00 AM

Firstpage

211

Lastpage

218

Abstract

Presents efficient algorithms for collecting information distributed among indistinguishable (anonymous) processors while performing certain operations on the information being collected. The efficiency objective is to minimize the communication-delay product and to obtain trade-offs between the two. The main contribution of the paper is a new efficient algorithm for performing sumlike operations (such as Abelian group operations and elementary symmetric functions) and the use of metrically regular graphs (which include the widely used hypercube interconnections) for information dissemination in distributed computations. The best algorithm has a communication-delay product of O(Nlog³ N) (for W nodes), and obtaining an optimal Ω(Nlog²N) algorithm remains an open problem

Keywords

distributed algorithms; hypercube networks; message passing; anonymous nodes; communication-delay product; distributed algorithms; distributed computations; distributed computing; efficiency objective; finite projective planes; hypercubes; information dissemination; message complexity; metrically regular graphs; regular networks; sparse graphs; sumlike operations; trade-off; Broadcasting; Computer networks; Costs; Delay; Distributed algorithms; Distributed computing; Hypercubes; Processor scheduling; Protocols; Topology;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.262125

Filename

262125