Abstract
The data redistribution problems on multi-computers had been extensively studied. Irregular data redistribution has been paid attention recently since it can distribute different size of data segment of each processor to processors according to their own computation capability. High Performance Fortran Version 2 (HPF-2) provides GEN_BLOCK data distribution method for generating irregular data distribution. In this paper, we develop an efficient scheduling algorithm, Smallest Conflict Points Algorithm (SCPA), to schedule HPF2 irregular array redistribution. SCPA is a near optimal scheduling algorithm, which satisfies the minimal number of steps and minimal total messages size of steps for irregular data redistribution.
The work is partially supported by National Science Council of Taiwan, under grant number NSC-93-2213-E-216-029.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Guo, M.: Communication Generation for Irregular Codes. The Journal of Supercomputing 25(3), 199–214 (2003)
Guo, M., Nakata, I., Yamashita, Y.: Contention-Free Communication Scheduling for Array Redistribution. Parallel Computing 26(8), 1325–1343 (2000)
Guo, M., Nakata, I., Yamashita, Y.: An Efficient Data Distribution Technique for Distributed Memory Parallel Computers. In: Minyi Guo, I. (ed.) JSPP 1997, pp. 189–196 (1997)
Guo, M., Pan, Y., Liu, Z.: Symbolic Communication Set Generation for Irregular Parallel Applications. The Journal of Supercomputing 25, 199–214 (2003)
Lee, S., Yook, H., Koo, M., Park, M.: Processor reordering algorithms toward efficient GEN_BLOCK redistribution. In: Proceedings of the ACM symposium on Applied computing, pp. 539–543 (2001)
Hsu, C.-H., Yu, K.-M., Chen, C.-H., Yu, C.W., Liang, C.K.: Optimal Processor Replacement for Efficient Communication of Runtime Data Redistribution. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds.) ISPA 2004. LNCS, vol. 3358, pp. 268–273. Springer, Heidelberg (2004)
Hsu, C.-H., Yang, D.-L., Chung, Y.-C., Dow, C.-R.: A Generalized Processor Mapping Technique for Array Redistribution. IEEE Transactions on Parallel and Distributed Systems 12(7), 743–757 (2001)
Ramaswamy, S., Simons, B., Banerjee, P.: Optimization for Efficient Data redistribution on Distributed Memory Multicomputers. Journal of Parallel and Distributed Computing 38, 217–228 (1996)
Wakatani, A., Wolfe, M.: Optimization of Data redistribution for Distributed Memory Multicomputers. short communication, Parallel Computing 21(9), 1485–1490 (1995)
Wang, H., Guo, M., Chen, W.: An Efficient Algorithm for Irregular Redistribution in Parallelizing Compilers. In: Guo, M. (ed.) ISPA 2003. LNCS, vol. 2745. Springer, Heidelberg (2003)
Wang, H., Guo, M., Wei, D.: Divide-and-conquer Algorithm for Irregular Redistributions in Parallelizing Compilers. The Journal of Supercomputing 29(2), 157–170 (2004)
Yook, H.-G., Park, M.-S.: Scheduling GEN_BLOCK Array Redistribution. In: Proceedings of the IASTED International Conference Parallel and Distributed Computing and Systems (November 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, KM., Chen, CH., Hsu, CH., Yu, C.W., Liang, C.K. (2005). Contention-Free Communication Scheduling for Irregular Data Redistribution in Parallelizing Compilers. In: Cao, J., Nejdl, W., Xu, M. (eds) Advanced Parallel Processing Technologies. APPT 2005. Lecture Notes in Computer Science, vol 3756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573937_13
Download citation
DOI: https://doi.org/10.1007/11573937_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29639-3
Online ISBN: 978-3-540-32107-1
eBook Packages: Computer ScienceComputer Science (R0)