Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
Date
2007Source Title
Journal of Parallel and Distributed Computing
Print ISSN
0743-7315
Publisher
Academic Press
Volume
67
Issue
3
Pages
271 - 285
Language
English
Type
ArticleItem Usage Stats
233
views
views
217
downloads
downloads
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. © 2006 Elsevier Inc. All rights reserved.
Keywords
Grid computingHeterogeneous computing systems
Scheduling
Computation theory
Data storage equipment
Distributed computer systems
Problem solving
Program processors
Scheduling
Execution ordering
Heuristic methods