A message combining approach for efficient array redistribution in non-all-to-all communication networks

References

• Bai , S.-W. and Yang , C.-S. 2006 . Essential cycle calculation method for irregular array redistribution . IEICE Trans. Inf. Syst. , E89 : 789 – 797 .
   Web of Science ®Google Scholar
• Desprez , F. , Dongarra , J. , Petitet , A. and Randriaramo , C. 1998 . Scheduling block-cyclic array redistribution . IEEE Trans. Parallel Distrib. Syst. , 9 : 192 – 205 .
   Web of Science ®Google Scholar
• Desprez , F. , Dongarra , J. , Petitet , A. and Randriarame , C. Proceedings of 4th workshop on languages, compilers, and run-time systems for scalable computers (LCR98) . Pittsburgh, USA. More on scheduling block-cyclic array redistribution , Vol. 1511 , pp. 275 – 287 . Springer-Verlag .
   Google Scholar
• Guo , M. and Nakata , I. 2001 . A framework for efficient data redistribution on distributed memory multicomputers . J. Supercomput. , 20 : 243 – 265 .
   Web of Science ®Google Scholar
• Hsu , C.-H. 2005 . Sparse matrix block-cyclic realignment on distributed memory machines . J. Supercomput. , 33 : 175 – 196 .
   Web of Science ®Google Scholar
• Hsu , C.-H. and Yu , K. M. 2004 . Processor mapping technique for communication free data redistribution on symmetrical matrix . Proceedings of the 7th International Symposium on Parallel Architectures . 2004 , Hong Kong, China. Algorithms and Networks (ISPAN’04) .
   Google Scholar
• Hsu , C.-H. and Yu , K.-M. 2004 . A compressed diagonals remapping technique for dynamic data redistribution on banded sparse matrix . J. Supercomput. , 29 : 125 – 143 .
   Web of Science ®Google Scholar
• Kalns , E. T. and Ni , L. M. 1995 . Processor mapping techniques toward efficient data redistribution . IEEE Trans. Parallel Distrib. Syst. , 6 : 1234 – 1247 .
   Web of Science ®Google Scholar
• Lim , Y. W. , Bhat , P. B. and Prasanna , V. K. 1999 . “ Efficient algorithms for block cyclic redistribution of arrays ” . In Algorithmica , 298 – 330 . Springer-Verlag New York Inc .
   Google Scholar
• Lim , Y. W. , Park , N. and Prasanna , V. K. Efficient algorithms for block cyclic redistribution of arrays . Bloomington, IL. Proceedings of the International Conference on Parallel Processing , pp. 234 – 241 .
   Google Scholar
• Park , N. , Prassana , V. K. and Raghavendra , C. S. 1999 . Efficient algorithms for block-cyclic array redistribution between processor sets . IEEE Trans. Parallel Distrib. Syst. , 10 : 1217 – 1240 .
   Web of Science ®Google Scholar
• Ramaswamy , S. , Simons , P. and Banerjee , P. 1996 . Optimization for efficient array redistribution on distributed memory multicomputers . J. Parallel Distrib. Comput. , 38 : 217 – 228 .
   Web of Science ®Google Scholar
• Souravlas , S. I. and Roumeliotis , M. 2004 . A pipeline technique for dynamic data transfer on a multiprocessor grid . Int. J. Parallel Program (Springer Science and Business Media Inc.) , 32 : 361 – 388 .
   Web of Science ®Google Scholar
• Sundar , N. S. , Jayasimha , D. M. , Panda , D. K. and Sadayappan , P. 2001 . Hybrid algorithms for complete exchange in 2D meshes . IEEE Trans. Parallel Distrib. Syst. , 12 : 1201 – 1218 .
   Google Scholar
• Thakur , R. , Choudhary , A. and Ramanujam , J. 1996 . Efficient algorithms for array redistribution . IEEE Trans. Parallel Distrib. Syst. , 7 : 587 – 594 .
   Web of Science ®Google Scholar
• Tseng , Y.-C. and Gupta , S. K.S. 1996 . All-to-all personalized communication in a wormhole-routed torus . IEEE Trans. Parallel Distrib. Syst. , 7 : 498 – 505 .
   Web of Science ®Google Scholar
• Wang , H. , Guo , M. , Prasad , S. K. , Pan , Y. and Chen , W. 2004 . An efficient algorithm for irregular redistributions in parallelizing compilers . Proceedings of The 4th International Conference on Computer and Information Technology (CIT’04) . 2004 , Wuhan, China. pp. 467 – 472 .
   Google Scholar
• Yang , Y. and Wang , J. 2001 . Pipelined all-to-all broadcast in all port meshes and tori . IEEE Trans. Parallel Distrib. Syst. , 50 : 1201 – 1218 .
   Google Scholar