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.
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.
If you think you should have access to this title, please contact your librarian.