Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model

Let U be a given set of nodes of a parallel computer system and assume that each node u in U has a piece of information $t(u)$ called a token. This paper discusses the problem of each $u \in U$ broadcasting its token $t(u)$ to all nodes in U. We refer to this problem as the group-gossiping problem, which includes the (conventional) gossiping problem as a special case. In this paper, we consider the group-gossiping problem in n-cubes under a circuit-switching model and propose an optimal group-gossiping algorithm for n-cubes under the model.

[1]  S. Louis Hakimi,et al.  Parallel Algorithms for Gossiping by Mail , 1990, Inf. Process. Lett..

[2]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[3]  Pierre Fraigniaud,et al.  Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers , 1992, IEEE Trans. Computers.

[4]  Shmuel Zaks,et al.  Optimal Linear Broadcast , 1990, SIGAL International Symposium on Algorithms.

[5]  Thomas F. Knight.  Technologies for Low Latency Interconnection Switches , 1989, SPAA.

[6]  Lionel M. Ni,et al.  Adaptive routing in mesh-connected networks , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[7]  S. Louis Hakimi,et al.  Gossigping in a Distributed Network , 1993, IEEE Trans. Computers.

[8]  Richard Koch.  Increasing the Size of a Network by a Constant Factor can Increase Performance by more than a Constant Factor , 1992, SIAM J. Comput..

[9]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[10]  Arthur M. Farley.  Minimum-time line broadcast networks , 1980, Networks.

[11]  Juraj Hromkovic,et al.  Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs , 1993, Inf. Comput..

[12]  Ten-Hwang Lai,et al.  Constructing Parallel Paths Betweesn Two Subcubes , 1992, IEEE Trans. Computers.

[13]  Eli Upfal,et al.  A Theory of Wormhole Routing in Parallel Computers , 1996, IEEE Trans. Computers.

[14]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[15]  David W. Krumme,et al.  Gossiping in Minimal Time , 1992, SIAM J. Comput..

[16]  David W. Krumme.  Fast Gossiping for the Hypercube , 1992, SIAM J. Comput..

[17]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.