Abstract
We consider the problem of distribution of loops with control dependences, involving if and do control structures. More precisely, we study how to control the number of temporary arrays that have to be introduced to store conditionals. We show that the traditional superposition of the data dependence graph and of the control dependence graph is not adequate, and we introduce a new representation, the mixed dependence graph. This allows us to develop a distribution algorithm that is parameterized by the maximal allowed dimensions of temporary arrays.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Abu-Sufah. Improving the Performance of Virtual Memory Computes. PhD thesis, Dept. of Comp. Science, University of Illinois at Urbana-Champaign, 1979.
J. Allen, D. Callahan, and K. Kennedy. Automatic decomposition of scientific programs for parallel execution. In Proc. of the 14th Annual ACM Symposium on Principles of Programming Languages, pages 63–76, Munich, Germany, Jan. 1987.
J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren. Conversion of control dependence to data dependence. In Proceedings of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, Jan. 1983.
J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319–349, July 1987.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
K. Kennedy and K. S. McKinley. Loop distribution with arbitrary control flow. In Supercomputing’90, Aug. 1990.
Y. Muraoka. Parallelism Exposure and Exploitation in Programs. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, Feb. 1971.
D. A. Padua and M. J. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29(12):1184–1201, Dec. 1986.
V. Sarkar. Automatic selection of high-order transformations in the IBM XL Fortran compilers. IBM Journ. of Research & Development, 41(3):233–264, May 1997.
G.-A. Silber. Parallélisation automatique par insertion de directives. PhD thesis, Ecole normale supérieure de Lyon, France, Dec. 1999.
G.-A. Silber and A. Darte. The Nestor library: A tool for implementing Fortran source to source transformations. In High Performance Computing and Networking (HPCN’99), vol. 1593 of LNCS, pages 653–662. Springer-Verlag, Apr. 1999.
M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Darte, A., Silber, GA. (2000). Temporary Arrays for Distribution of Loops with Control Dependences. In: Bode, A., Ludwig, T., Karl, W., WismĂ¼ller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_47
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive