The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
전력 인식 스케줄링 문제는 최근 클러스터 시스템에서 전력 비용으로 인한 운영 비용뿐만 아니라 시스템 신뢰성 측면에서도 문제가 되고 있습니다. 본 논문에서는 전력 인식 클러스터 시스템에서 마감일 제약이 있는 BOT(Bag of Tasks) 애플리케이션을 위한 SLA 기반 스케줄링 알고리즘을 제공합니다. 스케줄링 목표는 시스템이 사용자에게 서비스 수준을 제공하는 한 전력 소비를 최소화하는 것입니다. Bag-of-Tasks 애플리케이션은 서비스 수준에 따라 마감일 이전에 모든 하위 작업을 완료해야 합니다. 우리는 시간 공유 및 공간 공유 리소스 공유 정책 모두에 대한 전력 인식 스케줄링 알고리즘을 제공합니다. 시뮬레이션 결과, 제안한 알고리즘이 정전압 방식에 비해 전력 소모를 크게 줄인다는 것을 알 수 있다.
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.
부
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
부
@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},}
부
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 -