A distributed multicast algorithm for hypercube multicomputers /
Abstract: "This paper proposes a novel distributed multicast algorithm for hypercubes. Based on our algorithm, any node in a multicast- set can directly initiate a multicast to other nodes in the same set. The DImension-PArtition Technique (DIPAT), which is essentially a generalized spanning...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1992]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
92-027. |
| Subjects: |
| Summary: | Abstract: "This paper proposes a novel distributed multicast algorithm for hypercubes. Based on our algorithm, any node in a multicast- set can directly initiate a multicast to other nodes in the same set. The DImension-PArtition Technique (DIPAT), which is essentially a generalized spanning tree algorithm, is the underlying message routing technique. A set of destination nodes must be properly interconnected with each other, so that they can be reached from each other based on DIPAT. The necessary and sufficient conditions for proper interconnection of destination nodes are derived. Finally, DIPAT is combined with a simple spanning tree algorithm to form a hierarchical multicasting graph, which retains a higher level of distributed multicasting capability with a similar level of extra traffic as that of the existing single spanning tree based solutions. Interactions between processors, such as concurrency control, and processor allocation can be directly embedded into multicasting activities in a symmetric and fair manner. This is not possible for existing single spanning tree based algorithms." |
|---|---|
| Item Description: | "October 1992." |
| Physical Description: | 21 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |