This category represents parallel heuristics in which both the number of tasks
of the application and the location of work (tasks or data) are generated at
compilation time (static scheduling). The allocation of processors to tasks (or
data) remains unchanged during the execution of the application regardless of
the current state of the parallel machine. Most of the purposed parallel
heuristics belong to this class.
A brief bibliography:
|
S.C.S.
Porto, C.C. Ribeiro. Parallel Tabu Search Message-Passing Synchronous
Strategies for Task Scheduling under Precedence Constraints, 1995 |
|
J.Chakrapani,
J. Skorin-Kapov. Massive Parallel Tabu Search for the Quadratic
Assignmen Problem. Annals of Operation Research 41:327-341, 1993
|