Abstract
In this paper, we propose a distributed algorithm for one-to-all broadcasting on the arrangement graph. The algorithm exploits the rich topological properties of the (n, k)-arrangement graph to constitute the broadcasting binary tree and works recursively. When faulty links are encountered, the concepts of node-disjoint paths and virtual paths are used to deal with the broadcasting procedure. It is shown that the message can be broadcast to all n!/(n−k)! processors in O(k lg n) steps for fault-free mode, and in O(k(k+lg n)) for less than k(n−k)−1 faulty links.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. B. Akers, D. Harel, and B. Krishnamuthy. “The star graph: An attractive alternative to the n-cube”. Proc. Int. Conf. Parallel Proceeding., pages 393–400, 1987.
Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. “Introduction to Algorithms”. The MIT Press, Cambridge, 1990.
K. Day and A. Tripathi. “Arrangement graph: A class of generalized star graphs”. Information Processing Letters., 42:235–241, 1992.
P. Fraigniaud. “Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputer”. IEEE Trans. Computs., 41(11):1410–1419, 1992.
E. Horowitz and A. Zorat. “The binary tree as interconnection network: Application to multiprocessing systems and VLSI”. IEEE Trans. Computs., 30(4):245–253, 1981.
S. L. Johnsson and C. T. Ho. “Optimal Broadcasting and Presonalized Communcation in Hypercubes”. IEEE Trans. Computs., 38(9):1249–1268, 1989.
J. Misic and Z. Jovanovic. “Communication Aspects of the Star Graph Interconnection Network”. IEEE Trans. Parallel. Distrib Systs., 7(5):678–687, 1994.
V. E. Mendia and D. Sarkar. “Optimal Broadcasting on the Star Graph”. IEEE Trans. Parallel Distrib Systs., 3(4):389–396, 1992.
P. Ramanathan and K. G. Shin. “Reliable Broadcast in Hypercube Multicomputers”. IEEE Trans. Computs., 37(12):1654–1657, 1988.
J. P. Sheu, W. H. Liaw, and T. S. Chen. “A broadcasting algorithm in star graph interconnection network”. Information Processing Letters., 48:237–241, 1993.
J. Y. Tien, C. T. Ho, and W. P. Yang. “Broadcasting on Incomplete Hypercubes”. IEEE Trans. Computs., 42(11):1393–1398, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bai, L., Yamakawa, P.M., Ebara, H., Nakano, H. (1995). A broadcasting algorithm on the arrangement graph. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030867
Download citation
DOI: https://doi.org/10.1007/BFb0030867
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive