|
Abstract : |
We have extended the standard monotone dataflow system for the reaching definitions problem to accommodate explicitly parallel programs; this information is used in many standard optimization problems. This paper considers the parallel sections construct, both with and without explicit synchronization; a future paper considers the parallel do construct. Although work has been done on analyzing parallel programs to detect data races, little work has been done on optimizing such programs; the equations in this paper should form the basis for extensive work on optimization. 1, |
