Thumbnail
Access Restriction
Open

Author Skillicorn, D. B. ♦ Hill, Jonathan M. D. ♦ Mccoll, W. F.
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Common Question ♦ Major Step ♦ Parallel Programming ♦ Performance Term ♦ Communication Network ♦ Bulk Synchronous Parallelism ♦ Independent Local Computation ♦ Low-level Program Structure ♦ Large Number ♦ Uniformly-random Traffic ♦ Barrier Synchronisation ♦ Simple Architectural Parameter ♦ Parallel Programming Model ♦ Considerable Benefit ♦ Application-building Perspective ♦ Global Communication Phase ♦ Permutation Routing
Abstract Bulk Synchronous Parallelism (BSP) is a parallel programming model that abstracts from low-level program structures in favour of supersteps. A superstep consists of a set of independent local computations, followed by a global communication phase and a barrier synchronisation. Structuring programs in this way enables their costs to be accurately determined from a few simple architectural parameters, namely the permeability of the communication network to uniformly-random traffic and the time to synchronise. Although permutation routing and barrier synchronisations are widely regarded as inherently expensive, this is not the case. As a result, the structure imposed by BSP comes for free in performance terms, while bringing considerable benefits from an application-building perspective. This paper answers the most common questions we are asked about BSP and justifies its claim to be a major step forward in parallel programming. 1 Why is another model needed? In the 1980s a large number ...
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1996-01-01