Generating an efficient broadcast sequence using reflected Gray codes

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 11, 1997, Pages 1117-1122

  Moore, Jason A ^a,b   Quinn, Michael J ^a,c  

^a IEEE   (United States)

^b UNITED STATES AIR FORCE ACADEMY   (United States)

^c Oregon State University   (United States)

Author keywords

Binomial trees; Broadcasting; Communication algorithms; Multicomputers; Parallel processing; Reflected Gray code

Indexed keywords

BROADCASTING; CODES (SYMBOLS); PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; TREES (MATHEMATICS);

ONE TO ALL BROADCASTING; REFLECTED GRAY CODES;

DATA COMMUNICATION SYSTEMS;

EID: 0031269566     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.642946     Document Type: Article

References (14)

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. 13-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. Culler, A. Dusseau, S. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, and K. Velick, "Parallel Programming in Split-C," Proc. Supercomputing '93, pp. 262-273, Nov. 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 Computers," Proc. Fourth ACM SIGPLAN Symp. Principles and Practices of Parallel Programming, vol. 28, pp. 1-12, July 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. Gallian, R. Plemmons, and A.H. Sameh, "Parallel Algorithms for Dense Linear Algebra Computations," SIAM Rev., vol. 32, 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, "Optimum Broadcasting and Personalized Communication in Hypercubes," IEEE Trans. Computers, vol. 38, no. 6, pp. 1,249-1,268, Sept. 1989.
12. V. Kumar et al., Introduction to Parallel Computing. Redwood City, Calif.: Benjamin/Cummings, 1994.
13. M.J. Quinn, Parallel Computing: Theory and Practice. New York: McGraw-Hill, 1994.
14. Y. Saad and M.H. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.