ABSTRACT
Agenda parallelism, thinking of a problem directly in terms of the tasks that must be carried out, is an extremely important class of parallel algorithms. Tasks can be generated in many different ways. In Chapter 10 we discussed algorithms where the tasks could be generated statically or through an iterative control structure. In this chapter, we consider a second important class of task parallel algorithms, problems for which the tasks are generated recursively.
