Efficient Handling of Dependence Analysis for Arrays

TRICERATOPS

TriCollege Digital Repository

Efficient Handling of Dependence Analysis for Arrays

View Dublin Core Metadata

Title: Efficient Handling of Dependence Analysis for Arrays
Author: Seater, Robert
Advisor: Wonnacott, David G.
Department: Haverford College. Dept. of Computer Science
Type: Thesis (B.S.)
Running Time: 22707269 bytes
Issue Date: 2001
Abstract: In this paper, I discuss what array dependence analysis is, and how we can phrase questions about dependencies as questions about integer feasibility. I present the straight forward approaches to dealing with equalities, inequalities, and disequalities. I also give a sampling of the more subtle approaches to each; with a particular focus on improving Fourier's Method and on the LI(2)-unit subdomain. Furthermore, I present the workings of a new approach to reduce the exponential behavior of disequality analysis.
Permanent URL: http://hdl.handle.net/10066/1542

Files in this item

Files Description Size Format
2001SeaterR.pdf Thesis 21.65Mb PDF
2001SeaterR_release.pdf ** Archive Staff Only ** 45.11Kb PDF

Citation

Seater, Robert. "Efficient Handling of Dependence Analysis for Arrays". 2001. Available electronically from http://hdl.handle.net/10066/1542.

This item appears in the following Collection(s)

View Dublin Core Metadata