Round-Robin and Recursive Task Distributions

Outline of a simple round-robin static task distribution. The number of tasks is ntask/ P is the number of processes, and this proc is the process ID. 

A recursive work distribution scheme involves recursive subdivisions of the computational problem to create smaller tasks that can be solved concurrently by individual processes. Recursive work distribution schemes are typically used for computational problems that lend themselves to a divide-and-conquer parallelization approach. For instance, finding the maximum value in an imsorted array and sorting the elements in an array are problems that can be solved using recursive algorithms. 

Return concatenate(Quicksort(Left.nleft).Quicksort(Right,nright))  

Recursive subdivision of tasks in parallel quicksort using eight processes, Po -P . The array to be sorted is subdivided by recursive calls to quicksort, indicated by arrows representing assignment of work to a new process. The pivot is shown in the gray box. 

---