Back to Search
Start Over
Scheduling hybrid divisible and indivisible loads on clusters.
- Source :
- 2011 17th IEEE International Conference on Networks; 1/ 1/2011, p141-146, 6p
- Publication Year :
- 2011
-
Abstract
- Divisible load applications occur in many fields of science and engineering. Such applications can be easily parallelized in a master-worker fashion, but pose several scheduling challenges. In this paper we investigate the scheduling problem for processing a set of tasks comprising both divisible and indivisible tasks on cluster systems. Indivisible loads are characterized by the property that they need to be processed on their entirety on a single processor while divisible loads can be distributed across several processing nodes by fully exploiting the underlying data parallelism. We propose a novel scheduling algorithm referred to as Hybrid Load Scheduling (HLS) algorithm for handling a set of tasks comprising both divisible and indivisible tasks on clusters. HLS fully exploits the parallelism in divisible loads to achieve high resource utilization. It also utilizes a pipelining technique to hide communication time and thus further optimize the overall performance. Simulations are presented to evaluate and compare the performance of the proposed strategy. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISBNs :
- 9781457718243
- Database :
- Complementary Index
- Journal :
- 2011 17th IEEE International Conference on Networks
- Publication Type :
- Conference
- Accession number :
- 86473697
- Full Text :
- https://doi.org/10.1109/ICON.2011.6168521