Experiences with Constraint-based Array Dependence Analysis
| dc.contributor.author | Pugh, William | en_US |
| dc.contributor.author | Wonnacott, David | en_US |
| dc.date.accessioned | 2004-05-31T22:28:38Z | |
| dc.date.available | 2004-05-31T22:28:38Z | |
| dc.date.created | 1994-11 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | Array data dependence analysis provides important information for optimization of scientific programs. Array dependence testing can be viewed as constraint analysis, although traditionally general-purpose constraint manipulation algorithms have been thought to be too slow for dependence analysis. We have explored the use of exact constraint analysis, based on Fourier's method, for array data dependence analysis. We have found these techniques can be used without a great impact on total compile time. Furthermore, the use of general-purpose algorithms has allowed us to address problems beyond traditional dependence analysis. In this paper, we summarize some of the constraint manipulation techniques we use for dependence analysis, and discuss some of the reasons for our performance results. (Also cross-referenced as UMIACS-TR-94-122) | en_US |
| dc.format.extent | 188848 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/673 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3371 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-94-122 | en_US |
| dc.title | Experiences with Constraint-based Array Dependence Analysis | en_US |
| dc.type | Technical Report | en_US |