| Automatic Loop Parallelization in the BSP Model (1998) | |||||||||||||||
Abstract | |||||||||||||||
| This paper introduces a new scheme for the scheduling of generic, untightly nested loops on distributed-memory systems. Being targeted at the bulk-synchronous parallel (BSP) model of computation, the novel parallelization scheme yields parallel code which is scalable, portable, and whose performance can be analytically evaluated. Keywords: automatic parallelization, BSP model 1. INTRODUCTION The prohibitive costs of parallel software design have led to an ever increasing interest in the automatic parallelization of existing sequential code. As a result, remarkable advances have been made in areas such as data dependence analysis [4], code transformation [3], and potential parallelism identification [2, 14]. Based on these theoretical advances, many parallelizing compilers and tools have been devised within the last decade or so [12]. While the parallel code generated by these automatic parallelizers has shown to be effective in many cases, it nevertheless lacks portability ... | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||