Skip to main content
SpringerLink
Log in

A Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers

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

Abstract

In order to achieve higher load balancing, it is necessary to solve irregular block redistribution problems, which are different from regular block-cyclic redistribution. High Performance Fortran version 2 (HPF-2) provides irregular distribution functionalities, such as GEN_BLOCK and INDIRECT. This paper is devoted to develop an efficient algorithm that attempts to obtain near optimal scheduling while satisfying the conditions of minimal message size of total steps and the minimal number of steps for irregular array redistribution. The algorithm intends to decrease the computation costs by dividing the whole block into sub-blocks and solving the sub-problems accordingly, and then merging them together to get final results. Simulation results show that our algorithm has comparable performance with a relocation algorithm developed previously (H. Yook and M. Park. Proceedings of the IASTED International Conference Parallel and Distributed Computingand Systems, Nov. 3–6, MIT, Boston, USA, 1999).

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. M. Guo and I. Nakata. A framework for efficient data redistribution on distributed memory multicomputers. The Journal of Supercomputing, 20(3):243-265, 2001.

    Google Scholar 

  2. M. Guo, I. Nakata, and Y. Yamashita. Contention-free communication scheduling for array redistribution, Proceedings of the International Conference on Parallel and Distributed Systems, Dec. 1998, pp. 658-667.

  3. High performance fortran forum. High Performance Fortran Language Specification version 2.0, Rice University, Houston, TX, Jan. 1997.

  4. E. T. Kalns and L. M. Ni. Processor mapping techniques toward efficient data redistribution. IEEE Transactions on Parallel and Distributed Systems, 6(12):1234-1247, 1995.

    Google Scholar 

  5. S. D. Kaushik, C.-H. Huang, and P. Sadayappan. Efficient index set generation for compiling HPF array statements on distributed-memory machines. Journal of Parallel and Distributed Computing, 38(2):237-247, 1996.

    Google Scholar 

  6. M. Leair, D. Miles, V. Schuster, and M. Wolfe, Euro-Par99 Parallel Processing 5th International Euro-Par Conference, Toulouse, France, Aug. 31-Sept. 3, 1999, Proceedings, Springer-Verlag LNCS 1999.

  7. S. Lee, H. Yook, M. Koo, and M. Park, Processor reordering algorithms toward efficient GEN BLOCK redistribution. Proceedings of the 2001 ACM Symposium on Applied Computing, Las Vegas, Nevada, USA, 2001, pp. 539-543.

  8. Y. W. Lim, P. B. Bhat, and V. Prasanna. Efficient algorithms for block-cyclic redistribution of arrays. IEEE Symposium on Parallel and Distributed Processing, Oct. 1996.

  9. Y. Pan and J. Shang. Efficient and scalable parallelization of time-dependent Maxwell equations solver using high performance Fortran, The 4th IEEE International Conference on Algorithms & Architectures for Parallel Processing, Hong Kong, Dec. 11-13, 2000, pp. 520-531.

  10. N. Park, V. K. Prasanna, and C. S. Raghavendra. Efficient algorithms for block-cyclic array redistribution between processor sets. IEEE Transactions on Parallel and Distributed Systems, 10(12):1217-1239, 1999.

    Google Scholar 

  11. PGHPF, a High Performance Fortran compiler, http://www.pgroup.com/products/pghpfindex.htm.

  12. S. Ramaswamy, B. Simons, and P. Banerjee. Optimizations for efficient array redistribution on distributed memory multicomputers. Journal of Parallel and Distributed Computing, 38:217-228, 1996.

    Google Scholar 

  13. R. Thakur, A. Choudhary, and G. Fox. Runtime array redistribution in HPF programs. Proceedings Scalable High Performance Computing Conference, May 1994, pp. 309-316.

  14. H. Yook and M. Park. Scheduling GEN_BLOCKarray redistribution, Proceedings of the IASTED International Conference Parallel and Distributed Computing and Systems, Nov. 3-6, 1999, MIT, Boston, USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of Aizu, Aizu-Wakamatsu, Fukushima, 965-8580, Japan

    Hui Wang, Minyi Guo & Daming Wei

Authors
  1. Hui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minyi Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daming Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, H., Guo, M. & Wei, D. A Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers. The Journal of Supercomputing 29, 157–170 (2004). https://doi.org/10.1023/B:SUPE.0000026848.34971.27

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:SUPE.0000026848.34971.27

Keywords

Search

Navigation