The dependence analysis and synchronization of parallel programs

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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Midkiff, Samuel Pratt

Contributors dc:contributor

• Padua, David A.

• Computer Science

Statement dc:rights

• Copyright 1992 Midkiff, Samuel Pratt

Language dc:language

eng

Identifier

AAI9216669
(UMI)AAI9216669

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/19333