One-to-all broadcast algorithm for constant degree 4 Cayley graphs
✍ Scribed by Mohamed Benmaiza; Abderezak Touzene
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 253 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
✦ Synopsis
Broadcasting in interconnection networks is crucial because of its multiple utilization in linear algebra problems, neural networks, optimization problems and other ®elds alike. Many global communication algorithms have been studied for dierent topologies of interconnection networks such as hypercubes, meshes, De Bruijn graphs, and Star graphs. In a recent paper, Vadapalli and Srimani proposed a new class of constant degree 4 Cayley graphs along with an optimal routing algorithm. We extended this work by proposing an ecient one-to-all broadcasting algorithm for constant degree 4 Cayley graphs of dimension n presented in this paper. The proposed algorithm is based on the construction of edge-disjoint spanning trees of height 2n and uses pipelining techniques. Communication is assumed to be full-duplex and based on store-and-forward techniques. We also assume a communication model with linear communication times. Based on these assumptions, we show that the performances of the proposed algorithm depend only on the dimension of the graph and are near optimal in terms of propagation delay.
📜 SIMILAR VOLUMES