Summary: J. Parallel Distrib. Comput. 67 (2007) 271285
Heuristics for scheduling file-sharing tasks on heterogeneous systems with
Kamer Kaya, Bora Uçar, Cevdet Aykanat
Department of Computer Engineering, Bilkent University, 06800 Ankara, Turkey
Received 3 August 2005; received in revised form 15 October 2006; accepted 21 November 2006
Available online 19 January 2007
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 1014% better turnaround times than the best of the three
© 2006 Elsevier Inc. All rights reserved.
Keywords: Scheduling; Heterogeneous computing systems; Grid computing