DocumentCode :
2626349
Title :
The priority broadcast scheme for dynamic broadcast in hypercubes and related networks
Author :
Yeh, Chi-Hsiang ; Varvarigos, Emmanouel A. ; Lee, Hua
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
fYear :
1999
fDate :
21-25 Feb 1999
Firstpage :
294
Lastpage :
301
Abstract :
Dynamic broadcast is a communication problem where each node in a parallel computer generates packets to be broadcast to all the other nodes according to a certain random process. The lower bound on the average time required by any oblivious dynamic broadcast algorithm in an n-dimensional hypercube is Ω(n+1/(1-ρ)) when packets are generated according to a Poisson process, where ρ is the load factor. The best previous algorithms, however only achieve Ω(n/(1-ρ)) time, which is suboptimal by a factor of Θ(n). In this paper we propose the priority broadcast scheme for designing dynamic broadcast algorithms that require optimal O(n+1/(1-ρ)) time in an n-dimensional hypercube. We apply the routing scheme to other network topologies, including k-ary n-cubes, meshes, tori, star graphs, generalized hypercubes, as well as any symmetric network, for efficient dynamic broadcast. In particular the algorithms for star graphs, generalized hypercubes, and k-ary n-cubes with k=0(1) are also asymptotically optimal. We also propose a method for assigning priority classes to packets, called optimal priority assignment, which achieves the best possible performance for dynamic multiple broadcast in any network topology
Keywords :
hypercube networks; performance evaluation; communication problem; dynamic broadcast; hypercubes; k-ary n-cubes; lower bound; meshes; n-dimensional hypercube; oblivious dynamic broadcast algorithm; optimal priority assignment; parallel computer; priority broadcast scheme; routing scheme; star graphs; symmetric network; tori; Algorithm design and analysis; Broadcasting; Computer networks; Concurrent computing; Delay; Hypercubes; Intelligent networks; Network topology; Radio access networks; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Frontiers of Massively Parallel Computation, 1999. Frontiers '99. The Seventh Symposium on the
Conference_Location :
Annapolis, MD
Print_ISBN :
0-7695-0087-0
Type :
conf
DOI :
10.1109/FMPC.1999.750612
Filename :
750612
Link To Document :
بازگشت