A Survey of Data Dependence Analysis Techniques for Automated Parallelization
| dc.contributor.author | Libby, Joseph, C. | |
| dc.contributor.author | Kent, Kenneth, B. | |
| dc.date.accessioned | 2023-03-01T18:26:52Z | |
| dc.date.available | 2023-03-01T18:26:52Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | Finding parallelism that exists in a software program depends a great deal on determining the dependencies that exist between statements that exist in that program. Instructions that are found to be independent of one another can be executed in parallel with one another with the hope of increasing the execution speed of a software program. Determining dependence relationships between statements in software programs, however, is not an easy task. There exist many different methods for determining dependence relations, filling different requirements from speed to accuracy. This paper will discuss a number of these techniques, detailing several different classes of dependence analysis techniques as well as several different techniques within these classes. | |
| dc.description.copyright | Copyright @ Joseph C. Libby and Kenneth B. Kent, 2007. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14645 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | A Survey of Data Dependence Analysis Techniques for Automated Parallelization | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1