Journal
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Volume 70, Issue 3, Pages 296-308Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jpdc.2009.11.009
Keywords
Real-time scheduling; Parallel computing; Divisible load; QoS; Cluster computing
Categories
Funding
- NSF [0720810]
- Direct For Computer & Info Scie & Enginr
- Division Of Computer and Network Systems [0720810] Funding Source: National Science Foundation
Ask authors/readers for more resources
Cluster computing has become an important paradigm for solving large-scale problems. To enhance the quality of service (QoS) and provide performance guarantees in a cluster computing environment, various real-time scheduling algorithms and workload models have been investigated. Computational loads that can be arbitrarily divided into independent tasks represent many real-world applications. However, the problem of providing performance guarantees to divisible load applications has only recently been studied systematically. In this work, three important and necessary design decisions, ( 1) workload partitioning, (2) node assignment, and (3) task execution order, are identified for real-time divisible load scheduling. A scheduling framework that can configure different policies for each of the three design decisions is proposed and used to generate various algorithms. This paper systematically studies these algorithms and identifies scenarios where the choices of design parameters have significant effects. (C) 2009 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available