Abstract
The SSA framework has been separately extended to parallel programs and to sequential programs with arrays. This paper proposes an Array SSA form for parallel programs with either weak or strong memory consistency, with event-based synchronization or mutual exclusion, with parallel sections or indexed parallel constructs.
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
D. Barthou, J.-F. Collard, and P. Feautrier. Fuzzy array dataflow analysis. Journal of Parallel and Distributed Computing, 40:210–226, 1997.
J.-F. Collard and M. Griebl. Array dataflow analysis for explicitly parallel programs. Parallel Processing Letters, 1997.
R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Prog. Lang. Sys., 13(4):451–490, Oct. 1991.
J. Ferrante, D. Grunwald, and H. Srinivasan. Computing communication sets for control parallel programs. In W. on Lang. and Comp. for Par. Comp. (LCPC), volume 892 of LNCS, pages 316–330, Ithaca, NY, August 1994.
D. Grunwald and H. Srinivasan. Data flow equations for explicitely parallel programs. In ACM Symp. on Prin. of Prog. Lang. (PoPL), pages 159–168, May 1993.
K. Knobe and V. Sarkar. Array SSA form and its use in parallelization. In ACM Symp. on Prin. of Prog. Lang. (PoPL), pages 107–120, San Diego, CA, Jan. 1998.
J. Lee, S. Midki_, and D.A. Padua. Concurrent static single assignment form and constant propagation for explicitly parallel programs. In W. on Lang. and Comp. for Par. Comp. (LCPC), Aug. 1997.
D. Novillo, R. Unrau, and J. Schaeffer. Concurrent SSA form in the presence of mutual exclusion. In Int. Conf. on Par. Proc. (ICPP’98), pages 356–364, Aug. 1998.
H. Srinivasan, J. Hook, and M. Wolfe. Static single assignment form for explicitely parallel programs. In ACM Symp. on Prin. of Prog. Lang. (PoPL), pages 260–272, Charleston, D.C., Jan. 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Collard⋆, JF. (1999). Array SSA for Explicitly Parallel Programs. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_50
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive