Task Scheduling Algorithms
- Applicable when functional decomposition yields many small tasks.
- Task pool is maintained into which tasks are placed for allocation
to processors.
- Tasks become data structures representing "subproblems" to be solved
by set of workers (processors).
Which strategy is applied to allocate problems to workers?
Conflicting goals:
- Independent operation (to reduce communication costs),
- Global knowledge of computation state (to improve load balance).
Author: Wolfgang Schreiner
Last Modification: October 13, 1997