| BSP Scheduling of Regular Patterns of Computation (1997) | |||||||||||||||
Abstract | |||||||||||||||
| One of the major challenges of the current research in the field of parallel computing is the development of a realistic underlying framework for the design and programming of general purpose parallel computers. The bulk-synchronous parallel (BSP) model is largely viewed as the most suitable candidate for this role, as it offers support for both the design of scalable parallel architectures and the generation of portable parallel code. However, when considering the development of portable parallel software within the framework of the BSP model, one cannot disregard the existence of a broad basis of efficient sequential and PRAM solutions for the most various classes of problems. In fact, the recent emergence of reliable techniques for the identification of the potential parallelism of a sequential program has rendered the automatic parallelisation of existing sequential code more compelling than ever. At first sight, BSP simulation of PRAMs appears to be the ideal strategy for taking a... | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||