An asynchronous algorithm for scattering information between the active nodes of a multicomputer system

Zvi Drezner*, Amnon Barak

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

In this paper we present an asynchronous algorithm for scattering information between the active nodes of a multicomputer system, having a large number of independent computers and workstations that are interconnected by a local area communication network. This algorithm is useful when it is desired to reduce the number of messages and the time delay necessary to transmit information from any node to all the active nodes of the system. The algorithm that we develop is based on one-way messages which are sent by each node, every unit of time, to a randomly selected node. The main advantage of this routing is that it overcomes inactive or faulty machines. We show that for an N node multicomputer in which n nodes are active, it is possible to scatter information to all the active nodes in approximately (1.693 + 1.414(1 - n N))log2 n steps.

Original languageEnglish
Pages (from-to)344-351
Number of pages8
JournalJournal of Parallel and Distributed Computing
Volume3
Issue number3
DOIs
StatePublished - Sep 1986
Externally publishedYes

Fingerprint

Dive into the research topics of 'An asynchronous algorithm for scattering information between the active nodes of a multicomputer system'. Together they form a unique fingerprint.

Cite this