Parallel Processing Symposium, International (1997)
Apr. 1, 1997 to Apr. 5, 1997
Radu Calinescu , Oxford University Computing Laboratory
This paper addresses the scheduling of uniform-dependence loop nests within the framework of the bulk-synchronous parallel (BSP) model. Two broad classes of tightly-nested loops are identified in the paper and scheduled according to the BSP discipline, and the resulting schedules are analysed in terms of the BSP cost model.
R. Calinescu, "A BSP Approach to the Scheduling of Tightly-Nested Loops," Parallel Processing Symposium, International(IPPS), Geneva, SWITZERLAND, 1997, pp. 549.