T.W. O'Neil and E.H.-M. Sha (USA)
Data dependence analysis, redundant dependence analysis, compiler optimization, unfolding.
Since data dependencies greatly decrease instruction level parallelism, minimizing dependencies becomes a crucial part of the process of parallelizing sequential code. Elim inating all unnecessary hazards leads to the more efficient use of resources, fewer processor stalls and easily main tainable 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 elim ination technique may be combined with unfolding so as to parallelize code even further.
Important Links:
Go Back
