
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
YuChee Tseng, SzeYao Ni, JangPing Sheu, "Toward Optimal Complete Exchange on WormholeRouted Tori," IEEE Transactions on Computers, vol. 48, no. 10, pp. 10651082, October, 1999.  
BibTex  x  
@article{ 10.1109/12.805156, author = {YuChee Tseng and SzeYao Ni and JangPing Sheu}, title = {Toward Optimal Complete Exchange on WormholeRouted Tori}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {10}, issn = {00189340}, year = {1999}, pages = {10651082}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.805156}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Toward Optimal Complete Exchange on WormholeRouted Tori IS  10 SN  00189340 SP1065 EP1082 EPD  10651082 A1  YuChee Tseng, A1  SzeYao Ni, A1  JangPing Sheu, PY  1999 KW  Alltoall personalized communication KW  broadcast KW  complete exchange KW  gossiping KW  multicomputer network KW  torus KW  wormhole routing. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—In this paper, we propose new routing schemes to perform
[1] A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, “Parallel Information Dissemination by Packets,” SIAM J. Computing, vol. 23, pp. 355372, 1994.
[2] P. Berman, L. Gravano, J. Sanz, and G. Pifarre, "Adaptive Deadlock and LivelockFree Routing with All Minimal Paths in Torus Networks," Proc. Fourth ACM Symp. Parallel Algorithms and Architectures, June 1992.
[3] S.H. Bokhari, H. Berryman, "Complete Exchange on a Circuit Switched Mesh," Proc. Scalable High Performance Computing Conf., pp. 300306, 1992.
[4] R. Cypher and L. Gravano, “Adaptive, DeadlockFree Packet Routing in Torus Networks with Minimal Storage,” Proc. Int'l Conf. Parallel Processing, vol. III, pp. 204211, 1992.
[5] W.J. Dally and H. Aoki, "DeadlockFree Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466475, Apr. 1993.
[6] V.V. Dimakopoulos and N.J. Dimopoulos, “A Theory for Total Exchange in Multidimensional Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 7, pp. 639649, July 1998.
[7] S. Fujita and M. Yamashita, “Fast Gossiping on MeshBus Computers,” IEEE Trans. Computers, vol. 45, no. 11, pp. 13261330, Nov. 1996.
[8] A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM 3 Users Guide and Reference Manual. Oak Ridge, Tenn.: Oak Ridge Nat'l Laboratory, May 1994.
[9] S. Gupta, S. Hawkinson, and B. Baxter, “A Binary Interleaved Algorithm for Complete Exchange on a Mesh Architecture,” technical report, Intel Corp., 1994.
[10] S. Hinrichs, C. Kosak, D.R. O'Hallaron, T.M. Stricker, and R. Take, “An Architecture for Optimal AlltoAll Personalized Communication,” Technical Report CMUCS94140, School of Computer Science, Carnegie Mellon Univ., Sept. 1994.
[11] C. Ho and M. Kao, “Optimal Broadcast on Hypercubes with Wormhole and eCube Routings,” Proc. Int'l Conf. Parallel and Distributed Systems, pp. 694697, Taipei, Taiwan, 1993,
[12] B.H.H. Juurlink, "Experimental Validation of Parallel Computation Models on the Intel Paragon," Proc. 12th Int'l Parallel Processing Symp. and Ninth Symp. Parallel and Distributed Processing, pp. 492497, 1998.
[13] S.D. Kaushik, C.H. Huang, J. Ramanujam, and P. Sadayappan, “MultiPhase Array Redistribution: Modeling and Evaluation,” Proc. Int'l Parallel Processing Symp., 1995.
[14] D.W. Krumme, G. Cybenko, and K.N. Venkataraman, “Gossiping in Minimal Time,” SIAM J. Computing, vol. 21, no. 1, pp. 111139, Feb. 1992.
[15] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[16] X. Lin, P.K. McKinley,, and L.M. Ni,"DeadlockFree Multicast Wormhole Routing in 2D Mesh Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, Aug. 1994, pp. 793804.
[17] P.K. McKinley, Y.J. Tsai, and D. Robinson, "Collective Communication in Wormholerouted Massively Parallel Computers," Computer, vol. 28, no. 12, pp. 3950, Dec. 1995.
[18] P.K. McKinley et al., "UnicastBased Multicast Communication in WormholeRouted Networks," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, Dec. 1994, pp. 12521265.
[19] J. Dongarra et al.,“Document for a standard messagepassing interface,” Message Passing Interface Forum, Univ. of Tennessee, Tech. Report CS93214, Nov. 1993.
[20] P. Michallon and D. Trystram, “Minimum Depth ArcsDisjoint Spanning Trees for Broadcasting on WrapAround Meshes,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 8083, 1995.
[21] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 6276, Feb. 1993.
[22] D.F. Robinson, P.K. McKinley,, and B.H.C. Cheng,"Optimal Multicast Communication in WormholeRouted Torus Networks," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 11, Oct. 1995, p. 10291042.
[23] D.S. Scott, "Efficient AlltoAll Communication Patterns in Hypercube and Mesh Topologies," Proc. Sixth Conf. Distributed Memory Concurrent Computers, pp. 398403, 1991.
[24] H. Song, B. Kwon, and H. Yoon, “Throttle and Preempt: A New Flow Control for RealTime Communications in Wormhole Networks,” Proc. Int'l Conf. Parallel Processing, pp. 198–202, Aug. 1997.
[25] Y.J. Suh and S. Yalamanchili, "Algorithms for AlltoAll Personalized Exchange in 2D and 3D Tori," Proc. 10th Int'l Parallel Processing Symp., pp. 808814, Apr. 1996.
[26] Y.J. Suh and S. Yalamanchili, “AlltoAll Communication with Minimum StartUp Costs in 2D/3D Tori and Meshes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 5, pp. 442458, May 1998.
[27] N.S. Sundar, D.N. Jayasimha, D.K. Panda, and P. Sadayappan, "Hybrid Algorithms for Complete Exchange in 2D Meshes," Proc. Int'l Conf. Supercomputing, 1996.
[28] S. Takkella and S. Seidel, “Complete Exchange and Broadcast Algorithm for Meshes,” Proc. Scalable HighPerformance Computing Conf., pp. 422428, 1994.
[29] R. Thakur, A. Choudhary, and G. Fox, “Complete Exchange on a Wormhole Routed Mesh,” Proc. Int'l Workshop Modeling, Analysis, and Simulation of Computer and Telecomm. System, pp. 131135, 1994.
[30] Y. Tsai and P.K. McKinley, "A Broadcast Algorithm for AllPort WormholeRouted Torus Network," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 876885, Aug. 1996.
[31] Y.C. Tseng and S. Gupta, “AlltoAll Personalized Communication in a WormholeRouted Torus,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 498505, May 1996.
[32] Y.C. Tseng, T.H. Lin, S. Gupta, and D.K. Panda, “BandwidthOptimal Complete Exchange on Wormhole Routed 2D/3D Torus Networks: A DiagonalPropagation Approach,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 380396, Apr. 1997.
[33] Y.C. Tseng, S.Y. Ni, and J.P. Sheu, “Toward Optimal Complete Exchange on WormholeRouted Tori,” Proc. Int'l Conf. Parallel and Distributed Systems, pp. 96103, 1997.
[34] Y.C. Tseng, S.Y. Wang, and C.W. Ho, “Efficient Broadcasting in WormholeRouted Multicomputers: A NetworkPartitioning Approach,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 1, pp. 4461, Jan. 1999.
[35] S.Y. Wang, Y.C. Tseng, and C.W. Ho, “Efficient Multicast in WormholeRouted 2D Mesh/Torus Multicomputers: A NetworkPartitioning Approach,” Proc. Symp. Frontiers of Massively Parallel Computation, pp. 4249, 1996.