Files in this item
|(no description provided)|
|Title:||The dependence analysis and synchronization of parallel programs|
|Author(s):||Midkiff, Samuel Pratt|
|Doctoral Committee Chair(s):||Padua, David A.|
|Department / Program:||Computer Science|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Abstract:||The optimization of programs with explicit--i.e. user specified--parallelism requires the computation of the data dependence relation if optimizations performed by the compiler are to preserve sequential consistency. Shasha and Snir investigated the problem for straight-line code with data accesses performed on scalars. We extend their results to programs with sequential loops and cobegin or doall loop parallelism and data accesses performed on arrays. The array subscript information is used to increase the accuracy of the test in a way analogous to the data dependence tests for sequential programs.
Once data dependences have been identified synchronization can be used to enforce the orderings specified by the data dependence. The automatic generation of synchronization, and the optimization of synchronization, by a compiler is investigated. Experimental results comparing the effectiveness of different optimization techniques are presented.
|Rights Information:||Copyright 1992 Midkiff, Samuel Pratt|
|Date Available in IDEALS:||2011-05-07|
|Identifier in Online Catalog:||AAI9216669|