Programming Research Group BSP SCHEDULING OF REGULAR PATTERNS OF COMPUTATION

نویسنده

  • Radu Calinescu
چکیده

One of the major challenges of the current research in the eld 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 ooers 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 eecient sequential and PRAM solutions for the most various classes of problems. In fact, the recent emergence of reliable techniques for the identiication of the potential parallelism of a sequential program has rendered the automatic parallelisation of existing sequential code more compelling than ever. At rst sight, BSP simulation of PRAMs appears to be the ideal strategy for taking advantage of this wealth of potential parallelism. Unfortunately, PRAM simulation heavily relies on the future manufacturing of parallel architectures providing powerful multithreading support and fast context switching/address translation capabilities. At the same time, simulation has been proven to yield ineecient solutions when computations on dense data structures are involved. This report describes the rst stage of a project proposing BSP scheduling as an alternative to PRAM simulation in the generation of portable parallel code. After introducing the BSP programming and cost model, the report presents a brief overview of the current trends in the identiication and exploitation of potential parallelism. Then, techniques for the BSP scheduling of many regular patterns of computation which occur frequently in imperative programs are devised and analysed in terms of the BSP cost model. Finally, a whole chapter is dedicated to the mapping of generic loop nests on BSP computers. A discussion of the further stages of the project concludes the report.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Programming Research Group A SCHEME FOR THE BSP SCHEDULING OF GENERIC LOOP NESTS

This report presents a scheme for the bulk-synchronous parallel (BSP) scheduling of generic, untightly nested loops. Being targeted at the BSP model of computation, the novel parallelisation scheme yields parallel code which is scalable, portable, and whose cost can be accurately analysed. The scheme comprises three stages: data dependence analysis and potential parallelism identiication, data ...

متن کامل

Learning Curve Consideration in Makespan Computation Using Artificial Neural Network Approach

This paper presents an alternative method using artificial neural network (ANN) to develop a scheduling scheme which is used to determine the makespan or cycle time of a group of jobs going through a series of stages or workstations. The common conventional method uses mathematical programming techniques and presented in Gantt charts forms. The contribution of this paper is in three fold. First...

متن کامل

Programming Research Group ALGORITHMIC AND PRACTICAL CONSIDERATIONS FOR DENSE MATRIX COMPUTATIONS ON THE BSP MODEL

The Bulk-Synchronous Parallel (BSP) model of computation has been proposed by L.G. Valiant as a unifying and bridging model for the design, analysis and implementation of parallel algorithms that are both scalable and portable, among diverse parallel machines. In this work we present direct BSP algorithms for dense matrix computations such as matrix multiplication, LU decomposition, determinant...

متن کامل

Programming Research Group AN EXPERIMENTAL STUDY OF SORTING ALGORITHMS ON THE BSP MODEL: THEORY, PRACTICE AND EXPERIENCE

The Bulk-Synchronous Parallel (BSP) model of computation has been proposed by L.G. Valiant as a unifying and bridging model for the design, analysis and implementation of parallel algorithms that are both scalable and portable among diverse parallel machines. In this work we implement, using the Oxford BSP Toolset, BSPlib, a multiplicity of BSP deterministic and randomized sorting algorithms on...

متن کامل

Programming Research Group EFFICIENT DETERMINISTIC SORTING ON THE BSP MODEL

We present a new algorithm for deterministic sorting on the Bulk-Synchronous Parallel (BSP) model of computation. We sort n keys using a partitioning scheme that achieves the requirements of eeciency (one-optimality) and insensitivity against initial data distribution. Although we employ sampling to realize eeciency, we give a precise worst-case estimation of the maximum imbalance which might o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997