Multi-node broadcasting in all-ported 3-D wormhole-routed torus using an aggregation-then-distribution strategy

Journal of Systems Architecture

Volumn 50, Issue 9, 2004, Pages 575-589

  Chen, Yuh Shyan ^a   Chiang, Chao Yu ^a   Chen, Che Yi ^b  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Broadcasting; Collective communication; Dimension order routing; Interconnection network; Many to all broadcasting; Parallel processing; Torus; Wormhole routed

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; ROUTERS; THREE DIMENSIONAL COMPUTER GRAPHICS; TREES (MATHEMATICS);

COLLECTIVE COMMUNICATION; DIMENSION-ORDER ROUTING; TORUS; WORMHOLE-ROUTED;

COMPUTER NETWORKS;

EID: 3242712105     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysarc.2004.01.001     Document Type: Article

References (16)

1. Bruck J., Cypher R., Ho C.T. Fault-tolerant de bruijn and shuffle-exchange networks. IEEE Transactions on Parallel and Distributed Systems. 5(5):1994;548-553.
2. Chen Y.S., Juang T.Y., Tseng E.H. Efficient broadcasting in an arrangement graph using multiple spanning trees. IEICE Transactions on Fundamentals of Electronic, Communications, and Computer Science E. 83-A(1):2000;139-149.
3. Cosnard M., Trystram D. Parallel Algorithms and Architectures. 1995;Thomaon Computer Press, Boston MA.
4. Day K., Tripathi A. Arrangement graphs: a class of generalized star graphs. Information Processing Letter. 42(5):1992;235-241.
5. Hambrusch S.E., Khokhar A.A., Lin Y. Scalable s-to-p broadcasting on message-passing mpps. IEEE Transactions on Parallel and Distributed Systems. 9(8):1998;758-768.
6. Kesavan R., Panda D.K. Multiple multicast with minimized node contention on wormhole. k -ary n -cube networks IEEE Transactions on Parallel and Distributed Systems. 10(4):1999;371-393.
7. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. 1992;Morgan Kaufmann Publishers, San Mateo, CA.
8. Lo V., Rajopadhy S., Telle J.A., Zhong X. Parallel divide and comquer on meshes. IEEE Transactions on Parallel and Distributed Systems. 7(10):1996;1049-1058.
9. Saad Y., Schultz M. Data communication in hypercubes. Journal of Parallel and Distributed Computing. 6(1):1989;115-135.
10. Saad Y., Schultz M. Data communication in parallel architectures. Parallel Computing. 11:1989;131-150.
11. Stamoulis G.D., Tsitsiklis J.N. An efficient algorithm for multiple simultaneous broadcasts in the hypercube. Information Processing Letter. 46(July):1989;219-224.
12. Tseng Y.C. Multi-node broadcasting in hypercubes and star graph. Journal of Information Science and Engineering. 14(4):1998;809-820.
13. Tseng Y.C., Wang S.Y., Ho C.W. Efficient broadcasting in wormhole-routed multicomputers: a network-partitioning approach. IEEE Transactions on Parallel and Distributed Systems. 10(1):1999;44-61.
14. Varvarigos E.A., Bertsekas D.P. Pratial multinode broadcast and partial exchange algorithms for d-dimension meshes. Journal of Parallel and Distributed Computing. 23:1994;177-189.
15. Wang S.Y., Tseng Y.C. Algebraic foundations and broadcasting algorithms for wormhole-routed all-port tori. IEEE Transactions on Computers. 49(3):2000;246-258.
16. Wolfe M. High Performance Compilers for Parallel Computing. 1996;Addison-Wesley, USA.