Abstract
In most cases of distributed memory computations, node programs are executed on processors according to the owner computes rule. However, owner computes rule is not best suited for irregular application codes. In irregular application codes, use of indirection in accessing left hand side array makes it difficult to partition the loop iterations, and because of use of indirection in accessing right hand side elements, we may reduce total communication by using heuristics other than owner computes rule. In this paper, we propose a communication cost reduction computes rule for irregular loop partitioning, called least communication computes rule. We partition a loop iteration to a processor on which the minimal communication cost is ensured when executing that iteration. The experimental results show that, in most cases, our approaches achieved better performance than other loop partitioning rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Allen and K. Kennedy. Optimizing compilers for Modern Architectures. Morgan Kaufmann Publishers, 2001.
G. Agrawal and J. Saltz. Interprocedural compilation of Irregular Applilcations for Distributed memory machines. Language and Compilers for Parallel Computing, pp. 1–16, August 1994.
R. Das, M. Uysal, J. Saltz, and Y-S. Hwang. Communication optimizations for irregular scientific computations on distributed memory architectures. Journal of Parallel and Distributed Computing, 22(3):462–479, September 1994.
C. Ding and K. Kennedy. Improcing cache performance of dynamic applications with computation and data layout transformations. In Proceedings of the SIGPLAN’99 Conference on Programming Language Design and Implementation, Atlanta, GA, May, 1999.
M. Guo, I, Nakata, and Y. Yamashita. Contention-free communication scheduling for array redistribution. Parallel Computing, 26(2000), pp. 1325–1343, 2000.
M. Guo and I. Nakata. A framework for efficient array redistribution on distributed memory machines. The Journal of Supercomputing, Vol. 20, No. 3, pp. 253–265, 2001.
M. Guo, Y. Pan, and C. Liu. Symbolic Communication Set generation for irregular parallel applications. To appear in The Journal of Supercomputing, 2002.
E. Gutierrez, O. Plata, E. L. Zapata. On automatic parallelization of irregular reductions on scalable shared memory systems. In Proceedings of the Fifth Interantional Euro-Par Conference, pp. 422–429, Toulouse, France, August-September 1999.
H. Han and C.-W. Tseng. Improving compiler and run-time support for adaptive irregular codes. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 1998.
Y. Hu, A. Cox, and W. Zwaenepoel. Improving fine-grained irregular shared-memory benchmarks by data reordering. In Proceedings of SC’00, Dallas, TX, November 2000.
Y. Hu, S. L. Johnsson, and S.-H. Teng. High Performance Fortran for highly irregular problems. In Proceedings of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Las Vegas, NV, June 1997.
Y.-S Hwang, B. Moon, S. D. Sharma, R. Ponnusamy, R. Das, and J. Saltz. Runtime and language support for compiling adaptive irregular programs on distributed memory machines. Software-Practivce and Experience, Vol. 25(6), pp. 597–621, 1995.
J. Mellor-Crummey, D. Whalley, and K. Kennedy. Improving memory hierarchy performance for irregular applications. In Proceedings of the 1999 ACM International Conference on Supercomputing, Rhodes, Greece, June 1999.
N. Mitchell, L. Carter, and J. Ferrante. Localizing non-affine array references. In Proceedings of th International Conference on Parallel Architectures and Compilation Techniques, Newport Beach, LA, October 1999.
J.M. Stone and M. Norman. ZEUS-2D: A radiation magnetohydrodynamics code for astrophysical flows in two space dimensions: The hydrodynamic algorithms and tests. Astrophysical Journal Supplement Series, Vol. 80, pp. 753–790, 1992.
R. Ponnusamy, Y-S. Hwang, R. Das, J. Saltz, A. Choudhary, G. Fox. Supporting irregular distributions in Fortran D/HPF compilers. Technical report CS-TR-3268, University of Maryland, Department of Computer Science, 1994
R. Ponnusamy, J. Saltz, A. Choudhary, S. Hwang, and G. Fox. Runtime support and compilation methods for user-specified data distributions. IEEE Transactions on Parallel and Distributed Systems, 6(8), pp. 815–831, 1995.
M. Ujaldon, E.L. Zapata, B.M. Chapman, and H.P. Zima. Vienna-Fortran/HPF extensions for sparse and irregular problems and their compilation. IEEE Transactions on Parallel and Distributed Systems. 8(10), Oct. 1997. pp. 1068–1083.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, M., Liu, Z., Liu, C., Li, L. (2002). Reducing Communication Cost for Parallelizing Irregular Scientific Codes. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_21
Download citation
DOI: https://doi.org/10.1007/3-540-48051-X_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43786-4
Online ISBN: 978-3-540-48051-8
eBook Packages: Springer Book Archive