Abstract
Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Previous results focus on reducing index computational cost, schedule computational cost, and message packing/unpacking cost. In irregular redistribution, however, messages with varying sizes are transmitted in the same communication step. Therefore, the largest sized messages in the same communication step dominate the data transfer time required for this communication step. This work presents an efficient algorithm to partition large messages into multiple small ones and schedules them by using the minimum number of steps without communication contention and, in doing so, reducing the overall redistribution time. When the number of processors or the maximum degree of the redistribution graph increases or the selected size of messages is medium, the proposed algorithm can significantly reduce the overall redistribution time to 52%.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bandera, G., Zapata, E.L.: Sparse Matrix Block-Cyclic Redistribution. In: Proceeding of IEEE Int’l. Parallel Processing Symposium (IPPS 1999), San Juan, Puerto Rico (April 1999)
Desprez, F., Dongarra, J., Petitet, A.: Scheduling Block-Cyclic Data redistribution. IEEE Trans. on PDS 9(2), 192–205 (1998)
Hsu, C.-H., Bai, S.-W., Chung, Y.-C., Yang, C.-S.: A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution. IEEE TPDS 11(12), 1201–1216 (2000)
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)
Guo, M.: Communication Generation for Irregular Codes. The Journal of Supercomputing 25(3), 199–214 (2003)
Guo, M., Nakata, I.: A Framework for Efficient Array Redistribution on Distributed Memory Multicomputers. The Journal of Supercomputing 20(3), 243–265 (2001)
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: 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)
Kalns, E.T., Ni, L.M.: Processor Mapping Technique Toward Efficient Data Redistribution. IEEE Trans. on PDS 6(12) (December 1995)
Kaushik, S.D., Huang, C.H., Ramanujam, J., Sadayappan, P.: Multiphase data redistribution: Modeling and evaluation. In: Proceeding of IPPS 1995, pp. 441–445 (1995)
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 (2001)
Lim, Y.W., Bhat, P.B., Prasanna, K.V.: Efficient Algorithms for Block-Cyclic Redistribution of Arrays. Algorithmica 24(3-4), 298–330 (1999)
Park, N., Prasanna, V.K., Raghavendra, C.S.: Efficient Algorithms for Block-Cyclic Data redistribution Between Processor Sets. IEEE Transactions on Parallel and Distributed Systems 10(12), 1217–1240 (1999)
Petitet, A.P., Dongarra, J.J.: Algorithmic Redistribution Methods for Block-Cyclic Decompositions. IEEE Trans. on PDS 10(12), 1201–1216 (1999)
Prylli, L., Touranchean, B.: Fast runtime block cyclic data redistribution on multiprocessors. Journal of Parallel and Distributed Computing 45, 63–72 (1997)
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., Wei, D.: Divide-and-conquer Algorithm for Irregular Redistributions in Parallelizing Compilers. The Journal of Supercomputing 29(2) (2004)
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)
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)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London (1976)
Cole, R., Hopcroft, J.: On edge-coloring bipartite graphs. SIAM J. Comput. 11, 540–546 (1982)
Yu, C.W., Chen, G.H.: Efficient parallel algorithms for doubly convex-bipartite graphs. Theoretical Computer Science 147, 249–265 (1995)
Eades, P., McKay, B.D., Wormald, N.C.: On an edge crossing problem. In: Proc. 9th Australian Computer Science Conference, Australian National University, pp. 327–334 (1986)
Tomii, N., Kambayashi, Y., Shuzo, Y.: On planarization algorithms of 2-level graphs. Papers of tech. group on electronic computers, IECEJ, EC77-38, 1–12 (1977)
Yu, C.W.: On the complexity of the maximum biplanar subgraph problem. Information Science 129, 239–250 (2000)
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, C.W., Hsu, CH., Yu, KM., Liang, C.K., Chen, CI. (2005). Irregular Redistribution Scheduling by Partitioning Messages. In: Srikanthan, T., Xue, J., Chang, CH. (eds) Advances in Computer Systems Architecture. ACSAC 2005. Lecture Notes in Computer Science, vol 3740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572961_24
Download citation
DOI: https://doi.org/10.1007/11572961_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29643-0
Online ISBN: 978-3-540-32108-8
eBook Packages: Computer ScienceComputer Science (R0)