Modulo scheduling theory can be applied successfully to overlap Fortran DO loops on pipelined computers issuing multiple operations per cycle both with and without special loop architectural support. This paper shows that a broader class of loops--REPEAT-UNTIL, WHILE, and loops with more than one ex
On optimal parallelization of arbitrary loops
✍ Scribed by Uwe Schwiegelshohn; Franco Gasperoni; Kemal Ebcioǧlu
- Book ID
- 108016314
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 468 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Considering a dynamic conditional loop S~, i.e. involving an if-then-else with a dynamic condition, our aim is to restructure ~ in order to extract the inherent parallelism. Assuming the dependence distances (DD) carried by ~ to be non-constant, we first study their corresponding signs. This leads t
Performing run-time parallelization on general networks of workstations (NOWs) without special hardware or system software supports is very dicult, especially for DOACROSS loops. Parallelizing DOACROSS loops at run time implies complex operations for dependence detection, data accesses, and computat