Abstract
High Performance FORTRAN version 2 (HPF-2) provides irregular distributions such as GEN BLOCK and INDIRECT for load balancing and irregular problems. The irregular block redistribution problem is different from regular block-cyclic redistribution. This paper is devoted to develop an efficient algorithm that attempt to obtain near optimal scheduling while satisfying the minimal size of total steps condition and the minimal step condition for irregular array redistribution. Our algorithm is developed independently. It has comparable performance with a relocation algorithm developed previously.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
High Performance Fortran Forum, High Performance Fortran Language Specification version 2.0, Rice University, Houston, Texas, January 1997.
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, December 11–13, 2000, pp. 520–531.
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.
R. Thakur, A. Choudhary, and G. Fox. Runtime array redistribution in HPF programs. In Proceedings Scalable High Performance Computing Conference, May 1994, pp. 309–316.
M. Guo, I. Nakata, A Framework for Efficient Data Redistribution on Distributed Memory Multicomputers, The Journal of Supercomputing, vol.20, no.3, pp.243–265, Nov., 2001.
M. Guo, I. Nakata, and Y. Yamashita, Contention-Free Communication Scheduling for Array Redistribution, Proceedings of the International Conference on Parallel and Distributed Systems, pp.658–667, December 1998.
M. Leair, D. Miles, V. Schuster, and M. Wolfe, Euro-Par’99 Parallel Processing 5th International Euro-Par Conference, Toulouse, France, Aug. 31–Sep. 3, 1999, Proceedings, Springer Verlag LNCS 1999.
PGHPF, a High Performance Fortran compiler, http://www.pgroup.com/products/pghpfindex.htm.
H. Yook and M. Park, Scheduling GEN BLOCK Array Redistribution, Proceedings of the IASTED International Conference Parallel and Distributed Computing and Systems, November 3–6, 1999, MIT, Boston, USA.
S. Lee, H. Yook, M. Koo, M. Park, Processor reordering algorithms toward efficient GEN BLOCK redistribution. Proceedings of the 2001 ACM symposium on Applied computing, 2001, Las Vegas, Nevada, USA, 2001: 539–543.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H., Guo, M., Prasad, S.K., Pan, Y., Chen, W. (2003). An Efficient Algorithm for Irregular Redistributions in Parallelizing Compilers. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_10
Download citation
DOI: https://doi.org/10.1007/3-540-37619-4_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40523-8
Online ISBN: 978-3-540-37619-4
eBook Packages: Springer Book Archive