| A BSP Scheduling Tool for Loop Nest Parallelisation (1997) | |||||||||||||||
Abstract | |||||||||||||||
| This report introduces BSPscheduler, a new tool for the automatic parallelisation of nested loops. The novel parallelisation tool generates bulk synchronous parallel (BSP) code, by automatically scheduling the data and the computation of a sequential loop nest for concurrent execution on a BSP computer. Being targeted at the BSP model of computation, the resulting parallel code is scalable, portable, and its cost can be accurately analysed. The current report describes the two-phase scheduling strategy underlying the implementation of the tool, and presents its structure and an example of a parallelisation session with BSPscheduler. 1 Introduction Within the last few years, a number of realistic models of parallel computation have been proposed, with the aim of providing a generic framework for the design of parallel architectures and applications. These models, which encompass many of the characteristics that made the von Neumann model so successful in the realm of sequential computi... | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||