This Article 
 Bibliographic References 
 Add to: 
Generating an Efficient Broadcast Sequence Using Reflected Gray Codes
November 1997 (vol. 8 no. 11)
pp. 1117-1122

Abstract—One-to-all broadcast is frequently implemented on multicomputers using a binomial tree communication pattern. The source processor, at the root of the broadcast tree, completes the broadcast before the processors at the leaves of the tree. This imbalance can degrade performance when a data-parallel algorithm requires a series of broadcasts from different source processors. In this paper, we show that using a reflected Gray code to order broadcasts minimizes the communication time.

[1] A. Bar-Noy and S. Kipnis, "Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 11-22, June 1992.
[2] J.Y. Blanc and D. Trystram, "Implementation of Parallel Numerical Routines Using Broadcast Communication Schemes," Proc. CONPAR 90—VAPP IV, pp. 467-478, Sept. 1990.
[3] D.E. Culler, A. Dusseau, S.C. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, and K. Yelick, "Parallel Programming in Split-C," Supercomputing, 1993.
[4] D. Culler,R. Karp,D. Patterson,A. Sahay,K.E. Schauser,E. Santos,R. Subramonian,, and T. von Eicken,“LogP: Towards a realistic model of parallel computation,” Fourth Symp. Principles and Practices Parallel Programming, SIGPLAN’93, ACM, May 1993.
[5] G. Fox, "What Have We Learnt from Using Real Parallel Machines to Solve Real Problems?" Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 897-955, 1988.
[6] G. Fox, S. W. Otto, and A. Hey, "Matrix Algorithms on a Hypercube I: Matrix Multiplication," Parallel Computing, vol. 4, pp. 17-31, Apr. 1987.
[7] P. Fraigniaud, "Performance Analysis of Broadcasting in Hypercubes," Proc. First European Workshop Hypercube and Distributed Computers, pp. 311-327, Oct. 1989.
[8] K.A. Gallivan, R.J. Plemmons, and A.H. Sameh, "Parallel Algorithms for Dense Linear Algebra Computations," SIAM Rev., vol. 32, no. 1, pp. 54-135, Mar. 1990.
[9] P.J. Hatcher and M.J. Quinn, Data-Parallel Programming on MIMD Computers.Cambridge, Mass.: MIT Press, 1991.
[10] R. Jain, The Art of Computer Systems Performance Analysis.New York: John Wiley and Sons, 1991.
[11] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
[12] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[13] M.J. Quinn, Parallel Computing: Theory and Practice.New York: McGraw-Hill, 1994.
[14] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.

Index Terms:
Broadcasting, binomial trees, communication algorithms, multicomputers, reflected Gray code, parallel processing.
Jason A. Moore, Michael J. Quinn, "Generating an Efficient Broadcast Sequence Using Reflected Gray Codes," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 11, pp. 1117-1122, Nov. 1997, doi:10.1109/71.642946
Usage of this product signifies your acceptance of the Terms of Use.