Efficient Routing Schemes for Multiple Broadcasts in Hypercubes

The authors analyze the problem in which each node of the binary hypercube independently generates packets according to a Poisson process with rate lambda ; each of the packets is to be broadcast to all other nodes. Assuming unit packet length and no other communications taking place, it is observed that the system can be stable in steady-state only if the load factor rho identical to lambda (2/sup d/-1)/d satisfies rho >

[1]  Shelby L. Brumelle.  Some Inequalities for Parallel-Server Queues , 1971, Oper. Res..

[2]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[3]  J. D. Haenle,et al.  A Method of Deadlock-free Resource Allocation and Flow Control in Packet Networks , 1976, ICCC.

[4]  Hisashi Kobayashi,et al.  Queueing Models for Computer Communications System Analysis , 1977, IEEE Trans. Commun..

[5]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[6]  Efficient schemes for parallel communication , 1982, PODC '82.

[7]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[8]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[9]  Debasis Mitra,et al.  Randomized Parallel Communications , 1986, ICPP.

[10]  Yukon Chang,et al.  Continuous routing and batch routing on the hypercube , 1986, PODC '86.

[11]  Bruce Hajek,et al.  Delay and Routing in Interconnection Networks , 1987 .

[12]  Debasis Mitra,et al.  Randomized parallel communications on an extension of the omega network , 1987, JACM.

[13]  Yousef Saad,et al.  Data Communication in Hypercubes , 1989, J. Parallel Distributed Comput..

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

[15]  Krishnan Padmanabhan,et al.  Performance of the Direct Binary n-Cube Network for Multiprocessors , 1989, IEEE Trans. Computers.

[16]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[17]  George D. Stamoulis.  Routing and performance evaluation in interconnection networks , 1991 .

[18]  John N. Tsitsiklis,et al.  Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..

[19]  John N. Tsitsiklis,et al.  The efficiency of greedy routing in hypercubes and butterflies , 1991, SPAA '91.

[20]  Albert G. Greenberg,et al.  Deflection routing in hypercube networks , 1992, IEEE Trans. Commun..