Statement Re-ordering for DOACROSS Loops

Chen, Ding-Kai
Yew, Pen-Chung
1997
Thumbnail Image

View/Download File

1997-029.pdf (3.53 MB)

Persistent link to this item

https://hdl.handle.net/11299/215311
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Statement Re-ordering for DOACROSS Loops

Authors

Published Date

1997

Publisher

Type

Report

Abstract

In this paper, we propose a new statement re-ordering algorithm for DOACROSS loops that overcomes some of the problems in the previous schemes. The new algorithm uses a hierarchical approach to locate strongly dependent statement groups and to order these groups considering critical dependences. A new optimization problem, dependence covering maximization, which was not discussed before is also introduced. It is shown that this optimization problem is NP-complete, and a heuristic algorithm is incorporated in our algorithm. Run-time complexity analysis is given for both algorithms. This new statement re-ordering scheme, combined with the dependence covering maximization, can be an important compiler optimization to parallelize loop structures for large scale coarse and fine grain parallelism.

Keywords

Description

Related to

Replaces

License

Collections

Computer Science & Engineering (CS&E) Technical Reports

Series/Report Number

Technical Report; 97-029

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Chen, Ding-Kai; Yew, Pen-Chung. (1997). Statement Re-ordering for DOACROSS Loops. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215311.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.