Fork-join parallelism with a data-structures focus
Dan Grossman* * University of Washington
Abstract
This chapter is an introduction to parallel programming designed for use in a course on data structures and algorithms, although some of the less advanced material can be used in a second programming course. It assumes no background beyond sequential programming and a familiarity with common data structures (e.g., binary trees), algorithms (e.g., efficient sorting algorithms), and basic asymptotic analysis. The focus is on shared memory and fork-join parallelism, using Java and its ForkJoin framework for programming examples.
After introducing the idea of multithreaded execution and a distinction between parallelism and concurrency ...
Get Topics in Parallel and Distributed Computing now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
