Exact algorithms for a task assignment problem

Abstract : 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.
Complete list of metadatas

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00381907
Contributor : Bora Uçar <>
Submitted on : Wednesday, May 6, 2009 - 4:31:30 PM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM
Long-term archiving on : Monday, October 15, 2012 - 10:01:03 AM

File

bucar.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

409

Files downloads

1383