Issue No. 10 - October (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.246072
<p>Efficient routing of messages is a key to the performance of multicomputers. Multicastcommunication refers to the delivery of the same message from a source node to anarbitrary number of destination nodes. While multicast communication is highly demanded in many applications, most of the existing multicomputers do not directly support this service; rather it is indirectly supported by multiple one-to-one or broadcastcommunications, which result in more network traffic and a waste of system resources.The authors study routing evaluation criteria for multicast communication under differentswitching technologies. Multicast communication in multicomputers is formulated as agraph theoretical problem. Depending on the evaluation criteria and switchingtechnologies, they study three optimal multicast communication problems, which areequivalent to the finding of the following three subgraphs: optimal multicast path, optimal multicast cycle, and minimal Steiner tree, where the interconnection of a multicomputer defines a host graph. They show that all these optimization problems are NP-complete for the popular 2D-mesh and hypercube host graphs. Heuristic multicast algorithms for these routing problems are proposed.</p>
Index Termsmulticast communication; multicomputer networks; routing of messages; multicomputers; routing evaluation; switching technologies; graph theoretical; optimal multicast path; optimal multicast cycle; minimal Steiner tree; NP-complete; 2D-mesh; hypercube; heuristic algorithms; graph theory; message passing; multiprocessor interconnection networks
L. Ni and X. Lin, "Multicast Communication in Multicomputer Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 1105-1117, 1993.