Multinode broadcast in hypercubes and rings with randomly distributed length of packets

Includes bibliographical references (p. 19-20).Cover title.Research supported by the NSF. NSF-DDM-8903385 Research supported by the ARO. DAAL03-b6-K-0171by Emmanouel A. Varvarigos and Dimitri P. Bertsekas

Fault tolerant all-to-all broadcast in general interconnection networks

With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environments, fault tolerance in acknowledged ATAB and concurrent communications become a challenge to reliable general wormhole routing multicomputers with arbitrary topologies. In this paper, the virtual ring tree (VRT) is proposed to deal with the challenge. A single startup is needed in the two proposed algorithms by a simple virtual node space, which also reduces the complexity of routing at intermediate steps of ATAB algorithms and re-beginning an ATAB, by cacheable virtual channels. The proposed algorithm can automatically handle static faults in networks.published_or_final_versio

Partial multinode broadcast and partial exchange algorithms for d-dimensional meshes

Caption title. "Revision of January 1992."Includes bibliographical references (p. 24-26).Supported by NSF. NSF-ECS-8519058 Supported by ARO. DAAL03-86-K-0171by Emmanouel A. Varvarigos and Dimitri P. Bertsekas

Multinode broadcast in hypercubes and rings with randomly distributed length of packets

b