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 language | English |
|---|---|
| Article number | 439-186 |
| Pages (from-to) | 342-347 |
| Number of pages | 6 |
| Journal | Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems |
| Volume | 16 |
| State | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems - Cambridge, MA, United States Duration: 9 Nov 2004 → 11 Nov 2004 |
Keywords
- Compiler optimization
- Data dependence analysis
- Redundant dependence analysis
- Unfolding