Jump to ContentJump to Main Navigation
Parallel Scientific ComputationA Structured Approach using BSP and MPI$
Users without a subscription are not able to see the full content.

Rob H. Bisseling

Print publication date: 2004

Print ISBN-13: 9780198529392

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198529392.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 19 November 2019



Parallel Scientific Computation

Rob H. Bisseling

Oxford University Press

This chapter is a self-contained tutorial which discusses how to get started quickly with parallel programming and how to design and implement algorithms in a structured way using supersteps. It introduces a simple target architecture for designing parallel algorithms, the bulk synchronous parallel (BSP) computer. Using the computation of the inner product of two vectors as an example, the chapter shows how an algorithm is designed hand in hand with its cost analysis. The algorithm is implemented in a short program that demonstrates the most important primitives of the communication library BSPlib. Furthermore, a benchmarking program is given for measuring the BSP parameters of a parallel computer. The BSP computer has distributed memory. The fundamental question of choosing a suitable data distribution for a given problem is discussed using the block and cyclic distributions as an example.

Keywords:   benchmarking, block distribution, bulk synchronous parallel, communication, cyclic distribution, parallel programming, superstep

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .