Efficient Communication Scheduling Methods for Irregular Data Redistribution in Parallelizing Compilers

  • Shih-Chang Chen
  • Ching-Hsien Hsu
  • Chao-Yang Lan
  • Chao-Tung Yang
  • Kuan-Ching Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3606)


Irregular array redistribution has been paid attention recently since it can distribute different size of data segment to processors according to their own computation ability. It’s also the reason why it has been kept an eye on load balance. In this work, we present a two-phase degree-reduction (TPDR) method for scheduling HPF2 irregular data redistribution. An extended algorithm based on TPDR is also presented. Effectiveness of the proposed methods not only avoids node contention but also shortens the overall communication length. To evaluate the performance of our methods, we have implemented both algorithms along with the divide-and-conquer algorithm. The simulation results show improvement of communication costs.


Bipartite Graph Communication Cost Consecutive Section Degree Reduction Communication Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    Desprez, F., Dongarra, J., Petitet, A.: Scheduling Block-Cyclic Data redistribution. IEEE Trans. on PDS 9(2), 192–205 (1998)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Hsu, C.-H., Yang, D.-L., Chung, Y.-C., Dow, C.-R.: A Generalized Processor Mapping Technique for Array Redistribution. IEEE TPDS 12, 743–757 (2001)Google Scholar
  5. 5.
    Guo, M., Nakata, I., Yamashita, Y.: Contention-Free Communication Scheduling for Array Redistribution. Parallel Computing 26(8), 1325–1343 (2000)zbMATHCrossRefGoogle Scholar
  6. 6.
    Guo, M., Pan, Y., Liu, Z.: Symbolic Communication Set Generation for Irregular Parallel Applications. The Journal of Supercomputing 25, 199–214 (2003)zbMATHCrossRefGoogle Scholar
  7. 7.
    Kalns, E.T., Ni, L.M.: Processor Mapping Technique Toward Efficient Data Redistribution. IEEE Trans. on PDS 6(12) (December 1995)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Lim, Y.W., Bhat, P.B., Viktor, Prasanna, K.: Efficient Algorithms for Block-Cyclic Redistribution of Arrays. Algorithmica 24(3-4), 298–330 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Park, N., Prasanna, V.K., Raghavendra, C.S.: Efficient Algorithms for Block-Cyclic Data redistribution Between Processor Sets. IEEE TPDS 10(12), 1217–1240 (1999)Google Scholar
  12. 12.
    Petitet, A.P., Dongarra, J.J.: Algorithmic Redistribution Methods for Block-Cyclic Decompositions. IEEE Trans. on PDS 10(12), 1201–1216 (1999)Google Scholar
  13. 13.
    Prylli, L., Touranchean, B.: Fast runtime block cyclic data redistribution on multiprocessors. Journal of Parallel and Distributed Computing 45, 63–72 (1997)zbMATHCrossRefGoogle Scholar
  14. 14.
    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)zbMATHCrossRefGoogle Scholar
  15. 15.
    Wakatani, A., Wolfe, M.: Optimization of Data redistribution for Distributed Memory Multicomputers. Short communication, Parallel Computing 21(9), 1485–1490 (1995)zbMATHCrossRefGoogle Scholar
  16. 16.
    Wang, H., Guo, M., Wei, D.: Divide-and-conquer Algorithm for Irregular Redistributions in Parallelizing Compilers. The Journal of Supercomputing 29(2) (2004)Google Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Shih-Chang Chen
    • 1
  • Ching-Hsien Hsu
    • 1
  • Chao-Yang Lan
    • 1
  • Chao-Tung Yang
    • 2
  • Kuan-Ching Li
    • 3
  1. 1.Department of Computer Science and Information EngineeringChung Hua UniversityHsinchuTaiwan
  2. 2.Department of Computer Science and Information EngineeringTunghai UniversityTaichungTaiwan
  3. 3.Department of Computer Science and Information ManagementProvidence UniversityTaichungTaiwan

Personalised recommendations