The Community for Technology Leaders
Parallel Processing Symposium, International (1997)
Geneva, SWITZERLAND
Apr. 1, 1997 to Apr. 5, 1997
ISSN: 1063-7133
ISBN: 0-8186-7792-9
pp: 549
Radu Calinescu , Oxford University Computing Laboratory
ABSTRACT
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.
INDEX TERMS
CITATION

R. Calinescu, "A BSP Approach to the Scheduling of Tightly-Nested Loops," Parallel Processing Symposium, International(IPPS), Geneva, SWITZERLAND, 1997, pp. 549.
doi:10.1109/IPPS.1997.580954
91 ms
(Ver 3.3 (11022016))