Reducing data communication overhead for DOACROSS loop nests
If the loop iterations of a loop nest cannot be partitioned into independent sets, the data communication for data dependences are inevitable in order to execute them on parallel machines. These kind of loop nests are referred to as DOACROSS loop nests. This paper is concerned with compiler algorithms for parallelizing DOACROSS loop nests for distributed-memory multicomputers. We present a method that combines loop tiling, chain-based scheduling and indirect message passing to generate...[Show more]
|Collections||ANU Research Publications|
|TR-CS-93-16.pdf||315.93 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.