An efficient communication scheduling method for the processor mapping technique applied data redistribution

Journal of Supercomputing

Volumn 37, Issue 3, 2006, Pages 297-318

  Huang, Jih Woei ^a   Chu, Chih Ping ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Communication scheduling; Data redistribution; Data parallel programming; MPI; Parallel compiler; Processor mapping

Indexed keywords

COSTS; DATA COMMUNICATION SYSTEMS; DATA TRANSFER; INTERFACES (COMPUTER); PROGRAM COMPILERS; RESOURCE ALLOCATION;

COMMUNICATION SCHEDULING; DATA REDISTRIBUTION; DATA-PARALLEL PROGRAMMING; MPI; PARALLEL COMPILER; PROCESSOR MAPPING;

PROGRAM PROCESSORS;

EID: 33748324601     PISSN: 09208542     EISSN: 15730484     Source Type: Journal    
DOI: 10.1007/s11227-006-6615-z     Document Type: Article

References (25)

1. E. T. Kalns and L. M. Ni. Processor mapping techniques toward efficient data redistribution. IEEE Transactions on Parallel and Distributed Systems, 6(12):1234-1247, 1995.
2. D. Bau, I. Kodukula, V. Kotlyar, K. Pingali, and P. Stodghill. Solving alignment using elementary linear algebra. In Conference Record of the 7th Workshop on Languages and Compilers for Parallel Computing, pp. 46-60, 1994.
3. J. Ramanujam and P. Sadayappan. Compile-time techniques for data distribution in distributed memory machines. IEEE Transactions on Parallel and Distributed Systems, 2(4):472-482, 1991.
4. M. Dion and Y. Robert. Mapping affine loop nests: New Results. Parallel Computing, 22(10):1373-1397, 1996.
5. A. W. Lam and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing, 24, (3/4):445-475, 1998.
6. W.-L. Chang, J.-W. Huang, and C.-P. Chu. Using elementary linear algebra to solve data alignment for arrays with linear or quadratic references. IEEE Transactions on Parallel and Distributed Systems, 15(1): 28-39, 2004.
7. S. Hiranandani, K. Kennedy, J. Mellor-Crummey, and A. Sethi. Compilation techniques for block-cyclic distributions. ACM International Conference on Supercomputing, pp. 392-403, 1994.
8. S. Chatterjee, J. R. Gilbert, F. J. E. Long, R. Schreiber, and S.-H. Teng. Generating local address and communication sets for data parallel programs. Journal of Parallel and Distributed Computing, 26:72-84, 1995.
9. S. K. S. Gupta, S. D. Kaushik, C.-H. Huang, and P. Sadayappan. On compiling array expressions for efficient execution on distributed-memory machines. Journal of Parallel and Distributed Computing, 32:155-172, 1996.
10. N. Park, V. K. Prasanna, and C. S. Raghavendra. Efficient algorithms for block-cyclic array redistribution between processor sets. IEEE Transactions on Parallel and Distributed Systems, 10(12):1217-1240, 1999.
11. C.-H. Hsu and Y.-H. Chung. Efficient methods for kr → r and r → kr array redistribution. The Journal of Supercomputing, 12:253-276, 1998.
12. S. Ramaswamy and P. Banerjee. Automatic generation of efficient array redistribution routines for distributed memory multicomputers. In Frontiers '95: The Fifth Symposium on the Frontiers of Massively Parallel Computation, pp. 342-349, 1995.
13. S. Ramaswamy, B. Simons, and P. Banerjee. Optimization for efficient array redistribution on distributed memory multicomputers. Journal of Parallel and Distributed Computing, 38:217-228, 1996
14. R. Thakur, A. Choudhary, and G. Fox. Runtime array redistribution in HPF programs. In: Proceedings of Scalable High Performance Computing Conference, pp. 309-316, 1994.
15. R. Thakur, A. Choudhary, and J. Ramanujam. Efficient algorithm for array redistribution. IEEE Transactions on Parallel and Distributed Systems, 7(6):587-594, 1996
16. L. Prylli and B. Tourancheau. Fast runtime block cyclic data redistribution on multiprocessors. Journal of Parallel and Distributed Computing, 45:63-72, 1997.
17. C.-H. Hsu, S.-W. Bai, Y.-C. Chung, and C.-S. Yang. A generalized basic-cycle calculation method for efficient array redistribution. IEEE Transactions on Parallel and Distributed Systems, 11(12): 1201-1216, 2000.
18. A. Wakatani and M. Wolfe. Optimization of array redistribution for distributed memory multicomputers. Parallel Computing, 21(9): 1485-1490, 1995.
19. S. D. Kaushik, C.-H. Huang, R. W. Johnson, and P. Sadayappan. An approach to communication-efficient data redistribution. In: Proceedings of International Conference on Supercomputing, pp. 364-373, 1994.
20. S. D. Kaushik, C.-H. Huang, J. Ramanujam, and P. Sadayappan. Multi-phase array redistribution: Modeling and evaluation. In: Proceedings of International Parallel Processing Symposium, pp. 441-445, 1995.
21. D. W. Walker and S. W. Otto. Redistribution of block-cyclic data distributions using MPI. Concurrency: Practice and Experience, 8(9):707-728, 1996.
22. F. Desprez, J. Dongarra, C. Randriamaro, and Y. Robert. Scheduling block-cyclic array redistribution. IEEE Transactions on Parallel and Distributed Systems, 9(2):192-205, 1998.
23. M. Guo, I. Nakata, and Y. Yamashita. Contention-free communication scheduling for array redistribution. Parallel Computing, 26(10):1325-1343, 2000.
24. E. T. Kalns and L. M. Ni. DaReL: A portable data redistribution library for distributed-memory machines. In Proceedings of Scalable Parallel Libraries Conference II, October 1994.
25. C.-H. Hsu, Y.-C. Chung, D.-L. Yang, and C.-R. Dow. A generalized processor mapping technique for array redistribution. IEEE Transactions on Parallel and Distributed Systems, 12(7):743-757, 2001.