Power-aware scheduling problem has been a recent issue in cluster systems not only for operational cost due to electricity cost, but also for system reliability. In this paper, we provide SLA-based scheduling algorithms for bag-of-tasks applications with deadline constraints on power-aware cluster systems. The scheduling objective is to minimize power consumption as long as the system provides the service levels of users. A bag-of-tasks application should finish all the sub-tasks before the deadline as the service level. We provide the power-aware scheduling algorithms for both time-shared and space-shared resource sharing policies. The simulation results show that the proposed algorithms reduce much power consumption compared to static voltage schemes.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kyong Hoon KIM, Wan Yeon LEE, Jong KIM, Rajkumar BUYYA, "SLA-Based Scheduling of Bag-of-Tasks Applications on Power-Aware Cluster Systems" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 12, pp. 3194-3201, December 2010, doi: 10.1587/transinf.E93.D.3194.
Abstract: Power-aware scheduling problem has been a recent issue in cluster systems not only for operational cost due to electricity cost, but also for system reliability. In this paper, we provide SLA-based scheduling algorithms for bag-of-tasks applications with deadline constraints on power-aware cluster systems. The scheduling objective is to minimize power consumption as long as the system provides the service levels of users. A bag-of-tasks application should finish all the sub-tasks before the deadline as the service level. We provide the power-aware scheduling algorithms for both time-shared and space-shared resource sharing policies. The simulation results show that the proposed algorithms reduce much power consumption compared to static voltage schemes.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.3194/_p
Copy
@ARTICLE{e93-d_12_3194,
author={Kyong Hoon KIM, Wan Yeon LEE, Jong KIM, Rajkumar BUYYA, },
journal={IEICE TRANSACTIONS on Information},
title={SLA-Based Scheduling of Bag-of-Tasks Applications on Power-Aware Cluster Systems},
year={2010},
volume={E93-D},
number={12},
pages={3194-3201},
abstract={Power-aware scheduling problem has been a recent issue in cluster systems not only for operational cost due to electricity cost, but also for system reliability. In this paper, we provide SLA-based scheduling algorithms for bag-of-tasks applications with deadline constraints on power-aware cluster systems. The scheduling objective is to minimize power consumption as long as the system provides the service levels of users. A bag-of-tasks application should finish all the sub-tasks before the deadline as the service level. We provide the power-aware scheduling algorithms for both time-shared and space-shared resource sharing policies. The simulation results show that the proposed algorithms reduce much power consumption compared to static voltage schemes.},
keywords={},
doi={10.1587/transinf.E93.D.3194},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - SLA-Based Scheduling of Bag-of-Tasks Applications on Power-Aware Cluster Systems
T2 - IEICE TRANSACTIONS on Information
SP - 3194
EP - 3201
AU - Kyong Hoon KIM
AU - Wan Yeon LEE
AU - Jong KIM
AU - Rajkumar BUYYA
PY - 2010
DO - 10.1587/transinf.E93.D.3194
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2010
AB - Power-aware scheduling problem has been a recent issue in cluster systems not only for operational cost due to electricity cost, but also for system reliability. In this paper, we provide SLA-based scheduling algorithms for bag-of-tasks applications with deadline constraints on power-aware cluster systems. The scheduling objective is to minimize power consumption as long as the system provides the service levels of users. A bag-of-tasks application should finish all the sub-tasks before the deadline as the service level. We provide the power-aware scheduling algorithms for both time-shared and space-shared resource sharing policies. The simulation results show that the proposed algorithms reduce much power consumption compared to static voltage schemes.
ER -