DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hoeflinger, Jay | ko |
dc.contributor.author | Paek, Yunheung | ko |
dc.date.accessioned | 2013-03-02T16:54:47Z | - |
dc.date.available | 2013-03-02T16:54:47Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2000 | - |
dc.identifier.citation | LECTURE NOTES IN COMPUTER SCIENCE, v.1863, pp.271 - 285 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/74555 | - |
dc.description.abstract | Traditional loop-based dependence analysis techniques have limitations when non-ane expressions are used, when interprocedural analysis is required, or when analysis of non-loops is needed. In this work, we return to rst principles to devise a more general parallelism detection strategy, which includes a dependence analysis technique which removes some of these limitations. We show how to do interprocedural dependence testing between arbitrary sections of code as well as loops, using a technique which includes privatization and recognition of induc-tions and reductions. We also present the results of recent experiments that we conducted to test the eectiveness of our algorithm on a variety of actual programs. The results are still preliminary, but are quite encouraging. | - |
dc.language | English | - |
dc.publisher | Springer | - |
dc.title | The Access Region Test | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 1863 | - |
dc.citation.beginningpage | 271 | - |
dc.citation.endingpage | 285 | - |
dc.citation.publicationname | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.contributor.localauthor | Paek, Yunheung | - |
dc.contributor.nonIdAuthor | Hoeflinger, Jay | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.