IDEALS Home University of Illinois at Urbana-Champaign logo The Alma Mater The Main Quad

Intraprocedural and interprocedural data dependence analysis for parallel computing

Show full item record

Bookmark or cite this item: http://hdl.handle.net/2142/20688

Files in this item

File Description Format
PDF 9010932.pdf (5MB) Restricted to U of Illinois (no description provided) PDF
Title: Intraprocedural and interprocedural data dependence analysis for parallel computing
Author(s): Li, Zhiyuan
Doctoral Committee Chair(s): Yew, Pen-Chung
Department / Program: Computer Science
Discipline: Computer Science
Degree Granting Institution: University of Illinois at Urbana-Champaign
Degree: Ph.D.
Genre: Dissertation
Subject(s): Computer Science
Abstract: A parallelizing compiler relies on data dependence analysis to detect independent operations in a user's program. In scientific and engineering programs, it is important for the compiler to analyze data dependences involving array references. This dissertation addresses a few fundamental issues in such an analysis.The first part of the dissertation discusses algorithms for data dependence tests. A real-valued algorithm ($\lambda$-test) is proposed for testing dependences between multi-dimensional array references, since previous algorithms are either too time-consuming or too imprecise. Algorithms for an unconstrained integer test and an exact integer test are also presented for some common classes of array references. In order to evaluate the complexity of array references and data dependences in real programs, an empirical study was conducted, and some of its results are presented.The second part of the dissertation is devoted to interprocedural analysis for parallel computing. The key to successful parallelization of programs which contain procedure calls is an efficient and accurate interprocedural data dependence analysis. A scheme, called the atom image scheme, is proposed for this analysis. Unlike previous approaches, the atom image scheme preserves precise array reference details while allowing recursive calls to be analyzed. Further, its precise form for representing the subscript details allows flexibility in selecting various data dependence test algorithms, depending on their usage. Such flexibility is important to the accuracy and efficiency of data dependence analysis.
Issue Date: 1989
Type: Text
Language: English
URI: http://hdl.handle.net/2142/20688
Rights Information: Copyright 1989 Li, Zhiyuan
Date Available in IDEALS: 2011-05-07
Identifier in Online Catalog: AAI9010932
OCLC Identifier: (UMI)AAI9010932
 

This item appears in the following Collection(s)

Show full item record

Item Statistics

  • Total Downloads: 0
  • Downloads this Month: 0
  • Downloads Today: 0

Browse

My Account

Information

Access Key