Skip to main content
SpringerLink
Log in

Scheduling contention-free irregular redistributions in parallelizing compilers

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Irregular array redistribution has been paid attention recently since it can distribute different size of data segment to heterogeneous processors according to their computational ability. It’s also the reason why it has been kept an eye on load balance. High Performance Fortran Version 2 (HPF2) provides GEN_BLOCK distribution format which facilitates generalized block distributions. In this paper, we present a two-phase degree-reduction (TPDR) method for scheduling HPF2 irregular array redistribution. Using a bipartite communication graph, the first phase of TPDR schedules communication links adjacent to processors that with degree greater than two. A communication step will be scheduled follow each degree-reduction iteration. The second phase of TPDR schedules remaining messages of all processors that with degree-2 and degree-1 using an adjustable coloring mechanism. An extended algorithm based on TPDR is also presented in this paper. Effectiveness of the proposed methods not only avoids node contention but also shortens the overall communication cost. The proposed methods are also practicable due to low algorithmic complexity. To evaluate the performance of our methods, we have implemented both algorithms along with the divide-and-conquer algorithm and two scheduling mechanism. The simulation results show improvement of total communication costs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bandera G, Zapata EL (1999) Sparse matrix block-cyclic redistribution. In: Proceeding of IEEE int’l parallel processing symposium (IPPS’99), San Juan, Puerto Rico, April 1999

  2. Desprez F, Dongarra J, Petitet A (1998) Scheduling block-cyclic data redistribution. IEEE Trans Parallel Distrib Syst 9(2):192–205

    Article  Google Scholar 

  3. Hsu C-H, Bai S-W, Chung Y-C, Yang C-S (2000) A generalized basic-cycle calculation method for efficient array redistribution. IEEE Trans Parallel Distrib Syst 11(12):1201–1216

    Article  Google Scholar 

  4. Hsu C-H, Yang D-L, Chung Y-C, Dow C-R (2001) A generalized processor mapping technique for array redistribution. IEEE Trans Parallel Distrib Syst 12(7):743–757

    Article  Google Scholar 

  5. Guo M (2003) Communication generation for irregular codes. J Supercomput 25(3):199–214

    Article  MATH  Google Scholar 

  6. Guo M, Nakata I (2001) A framework for efficient array redistribution on distributed memory multicomputers. J Supercomput 20(3):243–265

    Article  MATH  Google Scholar 

  7. Guo M, Nakata I, Yamashita Y (2000) Contention-free communication scheduling for array redistribution. Parallel Comput 26(8):1325–1343

    Article  MATH  Google Scholar 

  8. Guo M, Nakata I, Yamashita Y (1997) An efficient data distribution technique for distributed memory parallel computers. In: JSPP’97, 1997, pp 189–196

  9. Guo M, Pan Y, Liu Z (2003) Symbolic communication set generation for irregular parallel applications. J Supercomput 25:199–214

    Article  MATH  Google Scholar 

  10. Kalns ET, Ni LM (1995) Processor mapping technique toward efficient data redistribution. IEEE Trans Parallel Distrib Syst 6(12):469–476

    Article  Google Scholar 

  11. Kaushik SD, Huang CH, Ramanujam J, Sadayappan P (1995) Multiphase data redistribution: modeling and evaluation. In: Proceeding of IPPS’95, 1995, pp 441–445

  12. Lee S, Yook H, Koo M, Park M (2001) Processor reordering algorithms toward efficient GEN_BLOCK redistribution. In: Proceedings of the ACM symposium on applied computing, 2001

  13. Lim YW, Bhat PB, Prasanna VK (1999) Efficient algorithms for block-cyclic redistribution of arrays. Algorithm 24(3-4):298–330

    Article  MATH  MathSciNet  Google Scholar 

  14. Park N, Prasanna VK, Raghavendra CS (1999) Efficient algorithms for block-cyclic data redistribution between processor sets. IEEE Trans Parallel Distrib Syst 10(12):1217–1240

    Article  Google Scholar 

  15. Petitet AP, Dongarra JJ (1999) Algorithmic redistribution methods for block-cyclic decompositions. IEEE Trans Parallel Distrib Syst 10(12):1201–1216

    Article  Google Scholar 

  16. Prylli L, Touranchean B (1997) Fast runtime block cyclic data redistribution on multiprocessors. J Parallel Distrib Comput 45:63–72

    Article  MATH  Google Scholar 

  17. Ramaswamy S, Simons B, Banerjee P (1996) Optimization for efficient data redistribution on distributed memory multicomputers. J Parallel Distrib Comput 38:217–228

    Article  MATH  Google Scholar 

  18. Wakatani A, Wolfe M (1995) Optimization of data redistribution for distributed memory multicomputers. short communication. Parallel Comput 21(9):1485–1490

    Article  MATH  Google Scholar 

  19. Wang H, Guo M, Wei D (2004) Divide-and-conquer algorithm for irregular redistributions in parallelizing compilers. J Supercomput 29(2):157–170

    Article  MATH  Google Scholar 

  20. Wang H, Guo M, Wei D (2006) Message scheduling for irregular data redistribution in parallelizing compilers. IEICE Trans Inf Syst E89-D(2):418–424

    Article  MathSciNet  Google Scholar 

  21. Yook H-G, Park M-S (1999) Scheduling GEN_BLOCK array redistribution. In: Proceedings of the IASTED international conference parallel and distributed computing and systems, November, 1999

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan, 300, R.O.C.

    Ching-Hsien Hsu, Shih-Chang Chen & Chao-Yang Lan

Authors
  1. Ching-Hsien Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shih-Chang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chao-Yang Lan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ching-Hsien Hsu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hsu, CH., Chen, SC. & Lan, CY. Scheduling contention-free irregular redistributions in parallelizing compilers. J Supercomput 40, 229–247 (2007). https://doi.org/10.1007/s11227-006-0024-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-006-0024-1

Keywords

Search

Navigation