Distributed Routing Algorithms for Broadcasting and Personalized Communication in Hypercubes
1986 (English)Conference paper (Refereed)
High communication bandwidth in standard technologies is more expensive to realize than a high rate of arithmetic or logic operations. The effective utilization of communication resources is crucial for good overall performance in highly concurrent systems. In this paper we address two different communication problems in Boolean n-cube configured multiprocessors: 1) broadcasting, i.e., distribution of common data from a single source to all other nodes, and 2) sending personalized data from a single source to all other nodes. The well known spanning tree algorithm obtained by bit-wise complementation of leading zeroes (referredto as the SBT algorithm for Spanning Binomial nee) is compared with an algorithm using multiple spanning binomial trees (MSBT). The MSBT dgorithm offers a potential speed-up over the SBT dgorithm by afactor of log2 N. We also present a balanced #panning tree algorithm (BST) that offers a lower complexity than the SBT algorithm for Case 2. The potential improvement is by a factor of 3 log2 N. The analysis takes into account the size of the data sets, the communication bandwidth, and the overhead in communication. We also provide some experimental data for the Intel iPSC'd7.
Place, publisher, year, edition, pages
1986. 640-648 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-65581OAI: oai:DiVA.org:kth-65581DiVA: diva2:483517
The 1986 International Conference on Parallel Processing
NR 201408052012-01-252012-01-25Bibliographically approved