Definitions of Dependence Distance
| dc.contributor.author | Pugh, William | en_US |
| dc.date.accessioned | 2004-05-31T22:24:31Z | |
| dc.date.available | 2004-05-31T22:24:31Z | |
| dc.date.created | 1993-04 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | Data dependence distance is widely used to characterize data dependences in advanced optimizing compilers. The standard definition of dependence distance assumes that loops are normalized (have constant lower bounds and a step of 1); there is not a commonly accepted definition for unnormalized loops. We have identified several potential definitions, all of which give the same answer for normalized loops. There are a number of subtleties involved in choosing between these definitions, and no one definition is suitable for all applications. (Also cross-referenced as UMIACS-TR-93-133) | en_US |
| dc.format.extent | 84310 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/606 | |
| 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-3192 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-93-133 | en_US |
| dc.title | Definitions of Dependence Distance | en_US |
| dc.type | Technical Report | en_US |