Skip to main content
SpringerLink
Log in

Scheduling GEN_BLOCK Array Redistribution

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

Abstract

This article is devoted to the redistribution of arrays that are distributed in a GEN_BLOCK fashion over a processor grid. While GEN_BLOCK redistribution is essential for load balancing, prior research about redistribution has been focused on block-cyclic redistribution. The proposed scheduling algorithm exploits a spatial locality in message passing from a seemingly irregular array redistribution. The algorithm attempts to obtain near optimal scheduling by trying to minimize communication step size and the number of steps. According to experiments on CRAY T3E and IBM SP2, the algorithm shows good performance in typical distributed memory machines.

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. Y.-C. Chung, C.-H. Hsu, and S.-W. Bai. A basic-cyclic calculation technique for efficient dynamic data redistribution. IEEE Transaction on Parallel and Distributed Systems, 9(4), 1998.

  2. E. G. Coffman. Computer and Job-Shop Scheduling Theory. John Wiley & Sons, NY, 1976.

    Google Scholar 

  3. F. Desprez, J. Dongarra, A. Petitet, C. Randriamaro, and Y. Robert. Scheduling block-cyclic array redistribution. IEEE Transactions on Parallel and Distributed Systems, 9(2):192–205, 1998, also presented in CRPC-TR97714–S, February 1997.

    Google Scholar 

  4. J. Duato, S. Yalamanchili, and L. Ni. Interconnection Networks, pp. 155. IEEE Computer Society Press, 1997.

  5. M. Guo, I. Nakata, and Y. Yamashita. Contention-free communication scheduling for array redistribution. In Proceedings of the International Conference on Parallel and Distributed Systems, pp. 658–667, December 1998 and also presented at Parallel Computing, 26(10), 2000.

    Google Scholar 

  6. S. K. S. Gupta, S. D. Kaushik, C.-H. Huang, and P. Sadayappan. Compiling array expressions for ef.cient execution on distributed-memory machines. Technical report OSU-CISRC-4, 1994, revised March 1995.

  7. High Performance Fortran Forum. High Performance Fortran Language Speci.cation version 2.0. Rice University, Houston, TX, October 1996.

    Google Scholar 

  8. High Performance Fortran Forum. HPF-2Scope of Activities and Motivating Applications, November 1994.

  9. C.-H. Hsu, S.-W. Bai, and Y.-C. Chung. A generalized basic-cycle calculation method for efficient array redistribution. IEEE Transaction on Parallel and Distributed Systems, 11(12):1201–1215, 2000.

    Google Scholar 

  10. E. T. Kalns and L. M. Ni. Processor mapping techniques toward efficient data redistribution. In Proceedings of the 8th International Parallel Processing Symposium, Cancun, Mexico April 1994.

    Google Scholar 

  11. S. D. Kaushik, C.-H. Huang, J. Ramanujam, and P. Sadayappan. Multi-phase array redistribution: Modeling and evaluation. In Proceedings of the 9th International Parallel Processing Symposium, pp. 441–445, April 1995.

  12. Y. W. Lim, P. B. Bhat, and V. K. Prasanna. Efficient algorithm for block-cyclic redistribution of arrays. In IEEE Symposium on Parallel and Distributed Process, October 1996, and will be published in Algorithmica.

  13. Message Passing Interface Forum. MPI: A Message-Passing Interface Standard. University of Tennessee, Knoxville, TN, May 1994.

    Google Scholar 

  14. G. F. Pfister and V. A. Norton. Hot spot contention and combining in multistage interconnection networks. IEEE Transactions on Computers, 34:943–948, 1985.

    Google Scholar 

  15. J. M. Stichnoth, D. O'Hallaron, and T. R. Gross. Generating communication for array statements: Design, implementation, and evaluation. Journal of Parallel Distributed Computing, 21(1):150–159, 1994.

    Google Scholar 

  16. R. Thakur, A. Choudhary, and G. Fox. Runtime array redistribution in HPF programs. In Proceedings of SHPCC'94, pp. 309–316, 1994.

  17. R. Thakur, A. Choudhary, and J. Ramanujam. Efficient algorithms for array redistribution. IEEE Transactions on Parallel and Distributed Systems, 7(6):587–594, 1996.

    Google Scholar 

  18. D. W. Walker and S. W. Otto. Redistribution of block-cyclic data distribution using MPI. Concurrency: Practice and Experience, 8(9):707–728, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Samsung Electronics Company, Ltd, Korea

    Hyun-Gyoo Yook

  2. Department of Computer Science and Engineering, Korea University, Korea

    Myong-Soon Park

Authors
  1. Hyun-Gyoo Yook
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Myong-Soon Park
    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

Yook, HG., Park, MS. Scheduling GEN_BLOCK Array Redistribution. The Journal of Supercomputing 22, 251–267 (2002). https://doi.org/10.1023/A:1015313917431

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1015313917431

Search

Navigation