From Programming Parallel Algorithms.
Communications of the ACM, 39(3), March, 1996.

Examples of Parallel Algorithms  

This section describes and analyzes several parallel algorithms. These algorithms provide examples of how to analyze algorithms in terms of work and depth and of how to use nested data-parallel constructs. They also introduce some important ideas concerning parallel algorithms. We mention again that the main goals are to have the code closely match the high-level intuition of the algorithm, and to make it easy to analyze the asymptotic performance from the code.

• Primes
• Sparse Matrix Multiplication
• Planar Convex-Hull
• Three Other Algorithms