Profiling based task migration

Author

Baxter, Jeff ; Patel, Janak H.

Author_Institution

Center for Reliable & High-Performance Comput., Illinois Univ., Urbana-Champaign, IL, USA

fYear

1992

fDate

23-26 Mar 1992

Firstpage

192

Lastpage

195

Abstract

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

Keywords

parallel algorithms; program compilers; scheduling; dynamic mapping; local processor load; migration decisions; migration destinations; migration thresholds; profiled data; profiling based algorithm; static allocation; static assignment; task assignment; task graph; task migration strategy; Computational efficiency; Concurrent computing; Costs; Distributed computing; Multiprocessing systems; Multiprocessor interconnection networks; Parallel architectures; Runtime; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Conference_Location

Beverly Hills, CA

Print_ISBN

0-8186-2672-0

Type

conf

DOI

10.1109/IPPS.1992.223048

Filename

223048