資料中心內批次與交互式工作之資源分配

Resource Provision for Batch and Interactive Workloads in Data Centers

張庭維(Ting-Wei Chang)

指導教授 ： 劉邦鋒

國立臺灣大學/電機資訊學院/資訊工程學研究所/碩士(2015年)

https://doi.org/10.6342/NTU.2015.00483

摘要

在這篇論文中，我們描述了一個可以將資源分配給批次工作和互動式工作，並讓它們同時運行的系統架構。在這個系統中，每個工作有各自的服務協議層級，違反服務協議層級會導致罰款。我們提出了一個可以量化批次工作和互動式工作的罰款的模型。以此模型為基礎，我們提出了一個估計批次工作和互動式工作的罰款，並降低總罰款的演算法。我們的實驗結果指出此系統可以正確的將資源分配給不同類型的工作，藉以有效地降低總罰款。

關鍵字

排程演算法 ； 雲端運算系統 ； 平行處理

並列摘要

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.

並列關鍵字

Scheduling algorithms ； Client-sever systems ； Parallel process- ing ； Multiprocessing systems ； Dynamic scheduling

參考文獻

[2] Tharam Dillon, Chen Wu, and Elizabeth Chang. Cloud computing: issues and chal-

coordinated scheduling for leasing cloud resources on hybrid workloads. Parallel

Computing, 44:1–17, 2015.

[4] Abhishek Verma, Luis Pedrosa, Madhukar Korupolu, David Oppenheimer, Eric

[5] Saurabh Kumar Garg, Srinivasa K Gopalaiyengar, and Rajkumar Buyya. Sla-based