This class represents heuristics for which the number of tasks is fixed at
compilation time, but the location of work (tasks, data) is determined and/or
changed at run-time
A brief bibliography:
|
S.C.S.
Porto, C.C. Ribeiro. Parallel Tabu Search Message-Passing Synchronous
Strategies for Task Scheduling under Precedence Constraints, 1995 |