A BSP Approach to the Scheduling of Tightly-Nested Loops

This paper addresses the scheduling of uniformdependence loop nests within the framework of the bulksynchronous parallel (BSP) model. Two broad classes of tightly-nested loops are identifiedinthe paper and scheduled according to the BSP discipline, and the resulting schedules are analysed in terms of the BSP cost model.

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Radu Calinescu
• Keywords: BSP Cost Model, BSP Discipline, Distributed And Parallel Computing, IPPS 1997, Uniformdependence Loop Nests