Browse > Article

All-port Broadcasting Algorithms on Wormhole Routed Star Graph Networks  

Kim, Cha-Young (숙명여자대학교 컴퓨터과학과)
Lee, Sang-Kyu (숙명여자대학교 컴퓨터과학과)
Lee, Ju-Young (덕성여자대학교 전산학과)
Abstract
Recently star networks are considered as attractive alternatives to the widely used hypercube for interconnection networks in parallel processing systems by many researchers. One of the fundamental communication problems on star graph networks is broadcasing In this paper we consider the broadcasting problems in star graph networks using wormhole routing. In wormhole routed system minimizing link contention is more critical for the system performance than the distance between two communicating nodes. We use Hamiltonian paths in star graph to set up link-disjoint communication paths We present a broadcast algorithm in n-dimensional star graph of N(=n!) nodes such that the total completion time is no larger than $([long_n n!]+1)$ steps where $([long_n n!]+1)$ is the lower bound This result is significant improvement over the previous n-1 step broadcasting algorithm.
Keywords
(Broadcasting; Star graph; Wormhole Routing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Nigam, S. Sahni, and B. Krishnamurty, 'Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs', Proc. of 1990 Int'l Conf. Parallel Processing, pp. 340-343, 1990
2 J-Y. Lee(Park) and H.-A. Choi, 'Circuit-Switched Broadcasting in Torus and Mesh Networks', IEEE Trans. on Parallel & Distributed Systems, vol. 7, No.2, pp. 184-190, Feb. 1996   DOI   ScienceOn
3 S.-K. Lee and J.-Y. Lee, 'Optimal Broadcast in ${\alpha}-port$ Wormhole-Routed Mesh Networks', 1997 International Conference on Parallel and Distributed Systems, pp. 109-114, 1997   DOI
4 V. Mendia and D. Sarkar, 'Optimal Broadcasting on the Star Graph', IEEE Trans. on Parallel and Distributed Systems, vol. 3, no. 4, pp. 389-396, July 1992   DOI   ScienceOn
5 L.M. Ni and P.K. Makinley, 'A Survey of Routing Techniques in Wormhole Networks,' Technical Report MSU-CPS-ACS-46, October 17, 1991
6 S. Latifi and P.K. Srimani. 'Wormhole Broadcast in Star Graph Networks,' Parallel Computing, vol. 24, no. 8, pp. 1263-1276. August 1998   DOI   ScienceOn
7 S. B. Akers, D. Harel, and B. Krishnamurty, 'The Star graph: An Attractive Alternate to the n-cube', Proc, Int'l Conf. on Parallel Processing, pp. 393-400, 1987
8 S. Latifi and N. Bagherzadeh, 'The Clustered_Star Graph: A New Topoloty for Large Interconnection Networks', Proceedings of the 7th International Parallel Processing Symposium, pp. 514-518, IEEE Computer Society Press, April 1993   DOI