Jaejin Lee, Samuel P. Midkiff, David A. Padua  Home/Search
Context Related
Links: ACM DBLP | uiuc.edu/~jlee44/Papers/lcpc97.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiuc.edu/~jlee44/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Static Single Assignment (SSA) form has shown its usefulness for powerful code optimization techniques such as constant propagation in sequential programs. We introduce the Concurrent Static Single Assignment (CSSA) form and the transformation algorithm for explicitly parallel programs with interleaving semantics and post-wait synchronization. The parallel construct considered in this paper is cobegin/coend. A new concept, ß-assignment, which summarizes the information of interleaving... (Update)
Context of citations to this paper: More
.... programs because the classical methods do not account for updates to variables in threads other than the one being analyzed [12, 13, 15, 11]. Consider the code in Figure 2(A) taken from Pugh [17] We assume that p and q are aliased in this code. Because p.k is not modi...
.... particular reaching definition analyses, were proposed in [8, 10, 3] SSAs for various kinds of parallel language models were proposed in [17, 18, 14, 23]. Contrasting papers presenting an RDA with papers about SSA is easy. Several other issues, however, make the comparison of...
Cited by: More
Basic Compiler Algorithms for Parallel Programs - Jaejin Lee And (1999) (Correct)
Compilation Techniques for Explicitly Parallel Programs - Lee (1999) (Correct)
Array SSA for Explicitly Parallel Programs - Collard (1998) (Correct)
Similar documents (at the sentence level):
25.2%: Parallel Static Single Assignment Form and Constant Propagation .. - Lee, Padua (Correct)
21.1%: A Constant Propagation Algorithm for Explicitly Parallel Programs - Lee, Midki (1998) (Correct)
Active bibliography (related documents): More All
0.2: Static Single Assignment Form for Explicitly Parallel.. - Eric Stoltz Harini (1994) (Correct)
0.2: Analysis and Optimization of Explicitly Parallel Programs - Novillo, Unrau, Schaeffer (1998) (Correct)
0.1: A Compiler for Multiple Memory Models - Samuel Midkiff Ibm (2001) (Correct)
Similar documents based on text: More All
0.5: A Functional Perspective on SSA Optimisation.. - Chakravarty.. (2003) (Correct)
0.2: Concurrent SSA Form in the Presence of Mutual Exclusion - Novillo, Unrau, Schaeffer (1998) (Correct)
0.2: Static Single Information from a Functional Perspective - Singer (Correct)
Related documents from co-citation: More All
9: Constant propagation with conditional branches (context) - Wegman, Zadeck - 1985
9: Compilers: Principles (context) - Aho, Sethi et al. - 1986
8: Efficiently Computing Static Single Assignment Form and the Control Dependence G.. - Cytron, Ferrante et al. - 1991
BibTeX entry: (Update)
J. Lee, S. Midkiff, and D. A. Padua. Concurrent static single assignment form and constant propagation for explicitly parallel programs. In Workshop on Languages and Compilers for Parallel Computing, August 1997. http://citeseer.ist.psu.edu/lee97concurrent.html More
@inproceedings{ lee97concurrent,
author = "Jaejin Lee and Samuel P. Midkiff and David A. Padua",
title = "Concurrent Static Single Assignment Form and Constant Propagation for Explicitly Parallel Programs",
booktitle = "Languages and Compilers for Parallel Computing",
pages = "114-130",
year = "1997",
url = "citeseer.ist.psu.edu/lee97concurrent.html" }
Citations (may not include all citations):1399 Compilers: Principles (context) - Aho, Sethi et al. - 1986
415 Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1991 ACM DBLP
232 Constant propagation with conditional branches (context) - Wegman, Zadeck - 1991 ACM DBLP
48 Static analysis of low-level synchronization (context) - Callahan, Subhlok - 1988 ACM DBLP
45 Effective partial redundancy elimination - Briggs, Cooper - 1994 ACM DBLP
44 the complexity of event ordering for shared memory parallel .. - Netzer, Miller - 1990
37 Issues in the optimization of parallel programs (context) - Midkiff, Padua - 1990 DBLP
34 Event synchronization analysis for debugging parallel progra.. - Emrath, Ghosh et al. - 1989 ACM
28 Detecting nondeterminacy in parallel programs (context) - Emrath, Ghosh et al. - 1992 ACM DBLP
24 Single-pass generation of static single assignment form for .. - Brandis, Mossenbock - 1994 ACM
18 Static single assignment for explicitly parallel programs (context) - Srinivasan, Hook et al. - 1993 ACM
18 Parallel program graphs and their classification (context) - Sarkar, Simons - 1993 ACM DBLP
14 Concurrent static single assignment form and concurrent spar.. - Lee, Midkiff et al. - 1997
9 An efficient construction of parallel static single assignme.. - Srinivasan, Grunwald - 1991
3 Gloabal value numbers and redundant computations (context) - Rosen, Wegman et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://polaris.cs.uiuc.edu/~j-lee44/publications.html): More
Advanced Program Restructuring for.. - Blume, Doallo.. (1996) (Correct)
STeP: The Stanford Temporal Prover - Manna, Bjørner, Browne, Chang.. (1994) (Correct)
Parallel Static Single Assignment Form and Constant Propagation .. - Lee, Padua (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC