Parallel Processing Symposium, International (1992)
Beverly Hills, CA, USA
Mar. 23, 1992 to Mar. 26, 1992
Baxter , Center for Reliable & High-Performance Comput., Illinois Univ., Urbana-Champaign, IL, USA
Patel , Center for Reliable & High-Performance Comput., Illinois Univ., Urbana-Champaign, IL, USA
A new task migration strategy is presented. The input program is supplied as a task graph and an initial static assignment of tasks to processors is given. The dynamic behaviour of the static allocation is then profiled, and a set of migration destinations and migration thresholds are identified. During any subsequent execution, the profiling based algorithm makes migration decisions solely on the basis of the profiled data and the local processor load. No neighboring processor load information is required. Results are presented for the algorithm, and compared against a dynamic mapping scheme with global knowledge of the multiprocessor state.
task assignment, task migration strategy, task graph, static assignment, static allocation, migration destinations, migration thresholds, profiling based algorithm, migration decisions, profiled data, local processor load, dynamic mapping
Patel and Baxter, "Profiling based task migration," Parallel Processing Symposium, International(IPPS), Beverly Hills, CA, USA, 1992, pp. 192-195.