Browse by author
Lookup NU author(s): Dr Yudong Sun
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper presents a survey on the software tools for the graph-based scheduling on cluster systems with the focus on task scheduling. The tasks of a parallel or distributed application can be properly scheduled onto multi-processors in order to optimize the performance of the program (e.g., execution time or resource utilization). In general, scheduling algorithms are designed based on the notion of task graph that represents the relationship of parallel tasks. The scheduling algorithms map the nodes of a graph to the processors in order to minimize overall execution time. Although many scheduling algorithms have been proposed in the literature, surprisingly not many practical tools can be found in practical use. After discussing the fundamental scheduling techniques, we propose a framework and taxonomy for the scheduling tools on clusters. Using this framework, the features of existing scheduling tools are analyzed and compared. We also discuss the important issues in improving the usability of the scheduling tools. © Springer Science + Business Media, LLC 2006.
Author(s): Cao J, Chan ATS, Sun Y, Das SK, Guo M
Publication type: Article
Publication status: Published
Journal: Cluster Computing
Year: 2006
Volume: 9
Issue: 3
Pages: 355-371
ISSN (print): 1386-7857
ISSN (electronic): 1573-7543
Publisher: Springer
URL: http://dx.doi.org/10.1007/s10586-006-9747-2
DOI: 10.1007/s10586-006-9747-2
Altmetrics provided by Altmetric
