Optimal Code Motion for Parallel Programs (Extended Abstract)

Parallel languages are of growing interest, as they are more and more supported by modern hardware environments. However, despite their importance [SHW, SW, WS], there is currently very little work on classical analyses and optimizations for parallel programs. Probably, the reason for this deficiency is that a naive adaptation fails [MP] and the straightforward correct adaptation needs an unacceptable effort which is caused by considering all interleavings that manifest the possible executions of a parallel program. Thus, either heuristics are proposed to avoid the consideration of all the interleavings [McD], or restricted situations are considered, which do not require to consider the interleavings at all [GS]. 1 Completely different is t..