Using unfolding to minimize inter-iteration dependencies

Timothy W. O'Neil, Edwin H.M. Sha

Research output: Contribution to journalConference articlepeer-review

Abstract

Since data dependencies greatly decrease instruction level parallelism, minimizing dependencies becomes a crucial part of the process of parallelizing sequential code. Eliminating all unnecessary hazards leads to the more efficient use of resources, fewer processor stalls and easily maintainable code. Previously we proposed a novel approach for eliminating redundant data dependencies from code. In this paper, we review this method and show how this elimination technique may be combined with unfolding so as to parallelize code even further.

Original languageEnglish
Article number439-186
Pages (from-to)342-347
Number of pages6
JournalProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Volume16
StatePublished - 2004
Externally publishedYes
EventProceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems - Cambridge, MA, United States
Duration: 9 Nov 200411 Nov 2004

Keywords

  • Compiler optimization
  • Data dependence analysis
  • Redundant dependence analysis
  • Unfolding

Fingerprint

Dive into the research topics of 'Using unfolding to minimize inter-iteration dependencies'. Together they form a unique fingerprint.

Cite this