Issues in the compile-time optimization of parallel programs:

Abstract: "The data-flow and dependence analysis techniques used in today's optimizing compilers have been designed for sequential source programs. When parallel source programs are to be optimized, the standard techniques are insufficient to ensure the correctness of the transformations....

Full description

Saved in:
Bibliographic Details
Main Authors: Midkiff, Sam (Author), Padua, David (Author)
Format: Book
Language:English
Published: Urbana, Ill. 1990
Series:Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 993
Subjects:
Summary:Abstract: "The data-flow and dependence analysis techniques used in today's optimizing compilers have been designed for sequential source programs. When parallel source programs are to be optimized, the standard techniques are insufficient to ensure the correctness of the transformations. This paper presents eleven examples demonstrating how the standard techniques fail when applied to determinate and non-determinate parallel programs. A more general analysis technique is described that extends the work of Shasha and Snir and guarantees the correctness of optimizing transformations applied to programs with cobegin parallelism. Deadlock avoidance when transforming programs with synchronization is also discussed."
Physical Description:26 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!