Jump to ContentJump to Main Navigation
Applied Computational Physics$
Users without a subscription are not able to see the full content.

Joseph F. Boudreau and Eric. S. Swanson

Print publication date: 2017

Print ISBN-13: 9780198708636

Published to Oxford Scholarship Online: February 2018

DOI: 10.1093/oso/9780198708636.001.0001

Show Summary Details
Page of

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

Parallel computing

Parallel computing

(p.274) 9 Parallel computing
Applied Computational Physics

Joseph F. Boudreau

Eric S. Swanson

Oxford University Press

This chapter describes various approaches to concurrency, or “parallel programming”. An overview of high performance computing is followed with a review of Flynn’s taxonomy of parallel computing. Three methods for implementing parallel code using the frameworks provided by MPI, openMP, and C++ threads are presented. The use of the C++ constructs mutex and future to resolve issues of synchronization are discussed. All methods are illustrated with an embarrassingly parallel application to a Monte Carlo integral and common pitfalls are presented. The chapter closes with a discussion and example of the utility of forking processes and the use of C++ sockets and their application in a client/server environment.

Keywords:   Concurrency, parallel computing, MPI, openMP, C++ threads, process forks, C++ sockets, synchronization

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 .