The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1993 vol.4)
pp: 1060-1064
ABSTRACT
<p>Barrier MIMD's are asynchronous multiple instruction stream, multiple data stream architectures capable of parallel execution of variable execution time instructions and arbitrary control flow (e.g., while loops and calls); however, they differ from conventional MIMD's in that the need for run-time synchronization is significantly reduced. The authors consider the problem of scheduling nested loop structures on a barrier MIMD. The basic approach employs loop coalescing, a technique for transforming a multiply-nested loop into a single loop. Loop coalescing is extended to nested triangular loops, in which inner loop bounds are functions of outer loop indices. In addition, a more efficient scheme to generate the original loop indices from the coalesced index is proposed for the case of constant loop bounds. These results are general, and can be applied to extend previous work using loop coalescing techniques. The authors concentrate on using loop coalescing for scheduling barrier MIMDs, and show how previous work in loop transformations and linear scheduling theory can be applied to this problem.</p>
INDEX TERMS
Index Termsscheduling; barrier MIMD; asynchronous; multiple instruction stream; multiple datastream; loop coalescing; nested loop structures; loop transformations; linear scheduling;barrier synchronization; compiler optimization; compiler parallelization; static barrierMIMD; parallel architectures; parallel programming; program compilers; scheduling
CITATION
M.T. O'Keefe, "Loop Coalescing and Scheduling for Barrier MIMD Architectures", IEEE Transactions on Parallel & Distributed Systems, vol.4, no. 9, pp. 1060-1064, September 1993, doi:10.1109/71.243531
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool