Resource Provision for Batch and Interactive Workloads in Data Centers
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 103 === In this paper we describe a scheduling framework that allocates resources to both batch jobs and interactive jobs simultaneously in a private cloud with a static amount of resources. In the system, every job has an individual service level agreement (SLA), and...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/01111730800533964948 |
id |
ndltd-TW-103NTU05392112 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-103NTU053921122016-11-19T04:09:56Z http://ndltd.ncl.edu.tw/handle/01111730800533964948 Resource Provision for Batch and Interactive Workloads in Data Centers 資料中心內批次與交互式工作之資源分配 Ting-Wei Chang 張庭維 碩士 國立臺灣大學 資訊工程學研究所 103 In this paper we describe a scheduling framework that allocates resources to both batch jobs and interactive jobs simultaneously in a private cloud with a static amount of resources. In the system, every job has an individual service level agreement (SLA), and violating the SLA incurs penalty. We propose a model to formally quantify the SLA violation penalty of both batch and interactive jobs. The analysis on the interactive jobs focuses on queuing analysis and response time. The analysis on batch jobs focuses on the non-preemptive job scheduling for multiple processing units. Based on this model we also propose algorithms to estimate the penalty for both batch jobs and interactive jobs, and algorithms that reduce the total SLA violation penalty. Our experiment results suggest that our system effectively reduces the total penalty by allocating the right amount of resources to heterogeneous jobs in a private cloud system. Pangfeng Liu 劉邦鋒 2015 學位論文 ; thesis 35 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 103 === In this paper we describe a scheduling framework that allocates resources to both batch jobs and interactive jobs simultaneously in a private cloud with a static amount of resources. In the system, every job has an individual service level agreement (SLA), and violating the SLA incurs penalty. We propose a model to formally quantify the SLA violation penalty of both batch and interactive jobs. The analysis on the interactive jobs focuses on queuing analysis and response time. The analysis on batch jobs focuses on the non-preemptive job
scheduling for multiple processing units. Based on this model we also propose algorithms to estimate the penalty for both batch jobs and interactive jobs, and algorithms that reduce the total SLA violation penalty. Our experiment results suggest that our system effectively
reduces the total penalty by allocating the right amount of resources to heterogeneous jobs in a private cloud system.
|
author2 |
Pangfeng Liu |
author_facet |
Pangfeng Liu Ting-Wei Chang 張庭維 |
author |
Ting-Wei Chang 張庭維 |
spellingShingle |
Ting-Wei Chang 張庭維 Resource Provision for Batch and Interactive Workloads in Data Centers |
author_sort |
Ting-Wei Chang |
title |
Resource Provision for Batch and Interactive Workloads in Data Centers |
title_short |
Resource Provision for Batch and Interactive Workloads in Data Centers |
title_full |
Resource Provision for Batch and Interactive Workloads in Data Centers |
title_fullStr |
Resource Provision for Batch and Interactive Workloads in Data Centers |
title_full_unstemmed |
Resource Provision for Batch and Interactive Workloads in Data Centers |
title_sort |
resource provision for batch and interactive workloads in data centers |
publishDate |
2015 |
url |
http://ndltd.ncl.edu.tw/handle/01111730800533964948 |
work_keys_str_mv |
AT tingweichang resourceprovisionforbatchandinteractiveworkloadsindatacenters AT zhāngtíngwéi resourceprovisionforbatchandinteractiveworkloadsindatacenters AT tingweichang zīliàozhōngxīnnèipīcìyǔjiāohùshìgōngzuòzhīzīyuánfēnpèi AT zhāngtíngwéi zīliàozhōngxīnnèipīcìyǔjiāohùshìgōngzuòzhīzīyuánfēnpèi |
_version_ |
1718395008245039104 |