A method for estimating optimal unrolling times for nested loops

@inproceedings{Koseki1997AMF,
  title={A method for estimating optimal unrolling times for nested loops},
  author={Akira Koseki and Hideaki Komatsu and Yoshiaki Fukazawa},
  booktitle={ISPAN},
  year={1997}
}
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not only the innermost loop but also outer loops greatly expands the scope for reusing data and pnrullelizing instructions. Nested-loop unrolling is therefore a very effective way of obtaining a higher degree of parallelism, However, we need a method for measuring the eflciency of loop unrolling that takes account of both… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

A Loop "ransformation Theory a.nd an Algorithm to Maximize Parallelism

E M., M. S. Lam
IEEE Trans. Parallel and Distributed Systems, • 1991

URPR-An Extension

S. Ding, J. Xia
Proc. 2nd International Conference on Architectural Support for Programing Languages and Operating Systems, • 1987

Similar Papers

Loading similar papers…