PPT Slide
1. Divide N items into K subsets
2. Sort each subset in parallel by some algorithm.
3. Pairwise recursive merges of sorted subsets.
Components are: partition, sort and merge
partitioned static name spaces
1. Do all sorts first and in parallel.
2. Structure merges as binary tree grown from leaves upward.
Communication: asynchronous
Schedule: data flow (strict)