Abstract
This extended abstract motivates and briefly describes a strategy for computing symbolic constraints on values of integer variables and using them to simplify the control flow of compiler-generated parallel programs. This strategy has been implemented and evaluated in context of the Rice dHPF compiler for High Performance Fortran.
A full version of this paper will appear in an International Journal of Parallel Programming special issue on Languages and Compilers for Parallel Computing. This work was supported in part by DARPA contracts DABT63-92-C-0038, F30602-96-1-0159, and the Texas Advanced Technology Program grant 003604-017.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Vikram Adve and John Mellor-Crummey. Advanced code generation for High Performance Fortran. In Languages, Compilation Techniques and Run Time Systems for Scalable Parallel Systems, LNCS Series. Springer-Verlag, 1997.
W. Blume and R. Eigenmann. Demand-driven symbolic range propagation. In Proceedings of the Eighth Workshop on Languages and Compilers for Parallel Computing, pages 141–160, Columbus, OH, August 1995.
François Bourdoncle. Abstract debugging of higher-order imperative languages. In Proceedings of SIGPLAN PLDI '93, pages 46–55, June 1993.
R. Cytron et al. Efficiently computing static single assignment form and the control dependence graph. ACM TOPLAS, 13(4):451–490, October 1991.
M. Gerndt. Updating distributed variables in local computations. Concurrency: Practice and Experience, 2(3):171–193, September 1990.
W. H. Harrison. Compiler analysis of the value ranges for variables. IEEE Transactions on Software Engineering, SE-3(3):243–250, May 1977.
Paul Havlak. Interprocedural Symbolic Analysis. PhD thesis, Dept. of Computer Science, Rice University, May 1994.
Harold Johnson. Data flow analysis of ‘intractable’ imbedded system software. In Proceedings of SIGPLAN Compiler Construction '86, pages 109–117, 1986.
W.Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8):102–114, August 1992.
C.-W. Tseng. An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. PhD thesis, Dept. of Computer Science, Rice University, January 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mellor-Crummey, J., Adve, V. (1998). Simplifying control flow in compiler-generated parallel code. In: Li, Z., Yew, PC., Chatterjee, S., Huang, CH., Sadayappan, P., Sehr, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1997. Lecture Notes in Computer Science, vol 1366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032695
Download citation
DOI: https://doi.org/10.1007/BFb0032695
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64472-9
Online ISBN: 978-3-540-69788-6
eBook Packages: Springer Book Archive