Parallelism for free: efficient and optimal bitvector analyses for parallel programs

@article{Knoop1996ParallelismFF,
  title={Parallelism for free: efficient and optimal bitvector analyses for parallel programs},
  author={J. Knoop and B. Steffen and J. Vollmer},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1996},
  volume={18},
  pages={268-299}
}
We consider parallel programs with shared memory and interleaving semantics, for which we show how to construct for unidirectional bitvector problems optimal analysis algorithms that are as efficient as their purely sequential counterparts and that can easily be implemented. Whereas the complexity result is rather obvious, our optimality result is a consequence of a new Kam/Ullman-style Coincidence Theorem. Thus using our method, the standard algorithms for sequential programs computing… Expand
119 Citations
Partial Dead Code Elimination for Parallel Programs
  • J. Knoop
  • Computer Science
  • Euro-Par, Vol. I
  • 1996
  • 3
Parallel Constant Propagation
  • 10
Code motion for explicitly parallel programs
  • 25
Eliminating Partially Dead Code in Explicitly Parallel Programs
  • J. Knoop
  • Computer Science
  • Theor. Comput. Sci.
  • 1998
  • 12
Constraint-Based Inter-Procedural Analysis of Parallel Programs
  • 40
  • PDF
The Complexity of Copy Constant Detection in Parallel Programs
  • 5
  • PDF
Compositional Bitvector Analysis for Concurrent Programs with Nested Locks
  • 11
  • Highly Influenced
  • PDF
Concurrent SSA form in the presence of mutual exclusion
  • 34
  • PDF
Dataflow Analysis for Datarace-Free Programs
  • 10
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
A tool kit for constructing optimal interprocedural data flow analyses
  • A tool kit for constructing optimal interprocedural data flow analyses
  • 1994
A tool kit for constructing optimal interprocedural data ow analyses
  • A tool kit for constructing optimal interprocedural data ow analyses
  • 1994
Program Flow Analysis: Theory and Application
  • 343
  • Highly Influential
Monotone data ow analysis frameworks
  • Acta Informatica
  • 1977