Skip to main content

Efficient Communication Scheduling Methods for Irregular Data Redistribution in Parallelizing Compilers

  • Conference paper
Parallel Computing Technologies (PaCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3606))

Included in the following conference series:

Abstract

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.

This research is supported partially by National Science Council, 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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Desprez, F., Dongarra, J., Petitet, A.: Scheduling Block-Cyclic Data redistribution. IEEE Trans. on PDS 9(2), 192–205 (1998)

    Google Scholar 

  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. 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. Guo, M., Nakata, I., Yamashita, Y.: Contention-Free Communication Scheduling for Array Redistribution. Parallel Computing 26(8), 1325–1343 (2000)

    Article  MATH  Google Scholar 

  6. Guo, M., Pan, Y., Liu, Z.: Symbolic Communication Set Generation for Irregular Parallel Applications. The Journal of Supercomputing 25, 199–214 (2003)

    Article  MATH  Google Scholar 

  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. 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. 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. Lim, Y.W., Bhat, P.B., Viktor, Prasanna, K.: Efficient Algorithms for Block-Cyclic Redistribution of Arrays. Algorithmica 24(3-4), 298–330 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. Prylli, L., Touranchean, B.: Fast runtime block cyclic data redistribution on multiprocessors. Journal of Parallel and Distributed Computing 45, 63–72 (1997)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  15. Wakatani, A., Wolfe, M.: Optimization of Data redistribution for Distributed Memory Multicomputers. Short communication, Parallel Computing 21(9), 1485–1490 (1995)

    Article  MATH  Google Scholar 

  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. 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. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, SC., Hsu, CH., Lan, CY., Yang, CT., Li, KC. (2005). Efficient Communication Scheduling Methods for Irregular Data Redistribution in Parallelizing Compilers. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_19

Download citation

  • DOI: https://doi.org/10.1007/11535294_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28126-9

  • Online ISBN: 978-3-540-31826-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics