Exact algorithms for a task assignment problem - ENS de Lyon - École normale supérieure de Lyon Access content directly
Journal Articles Parallel Processing Letters Year : 2009

Exact algorithms for a task assignment problem


We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and data repositories. The application consists of a large number of file-sharing otherwise independent tasks. The files initially reside on the repositories. The processors and the repositories are connected through a heterogeneous interconnection network. Our aim is to assign the tasks to the processors, to schedule the file transfers from the repositories, and to schedule the executions of tasks on each processor in such a way that the turnaround time is minimized. We propose a heuristic composed of three phases: initial task assignment, task assignment refinement, and execution ordering. We experimentally compare the proposed heuristics with three well-known heuristics on a large number of problem instances. The proposed heuristic runs considerably faster than the existing heuristics and obtains 10-14% better turnaround times than the best of the three existing heuristics.
Fichier principal
Vignette du fichier
bucar.pdf (159.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ensl-00381907 , version 1 (06-05-2009)



Kamer Kaya, Bora Uçar. Exact algorithms for a task assignment problem. Parallel Processing Letters, 2009, 19 (3), pp.451--465. ⟨10.1142/S012962640900033X⟩. ⟨ensl-00381907⟩
137 View
1716 Download



Gmail Facebook Twitter LinkedIn More