Theory, Techniques, and Experiments in Solving Recurrences in Computer Programs
Pottenger, William Morton
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81887
Description
Title
Theory, Techniques, and Experiments in Solving Recurrences in Computer Programs
Author(s)
Pottenger, William Morton
Issue Date
1997
Doctoral Committee Chair(s)
Padua, David A.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Information Science
Language
eng
Abstract
The study of theoretical and practical issues in automatic parallelization across application and language boundaries is an appropriate and timely task. In this work, we discuss theory and techniques that we have determined useful in solving recurrences in computer programs. In chapter two we present a framework for understanding parallelism in computer applications based on an approach which models loop bodies as coalescing loop operators. In chapter three, we perform a case study of a modern C$\sp{++}$ semantic retrieval application drawn from the digital library field based on the model presented in chapter two. In the fourth chapter we present a summary of several techniques that we believe can be applied in the automatic recognition and solution of recurrences. The techniques have been developed through performing a manual analysis of applications from benchmark suites which include sparse, irregular, and regular Fortran codes. In chapter five we discuss the application of the techniques developed in chapter four on a suite of Fortran codes representative of sparse and irregular computations which we have developed as part of this work. In the sixth chapter, we consider the application of these same techniques focused on obtaining parallelism in outer time-stepping loops. In the final chapter, we draw this work to a conclusion and discuss future directions in parallelizing compiler technology.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
