Adaptive scheduling for parallel tasks with QoS satisfaction for hybrid cloud environments

NCUIR > College of Electrical Engineering & Computer Science > Department of Computer Science and information Engineering > journal & Dissertation > Item 987654321/106191

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/106191

Title:	Adaptive scheduling for parallel tasks with QoS satisfaction for hybrid cloud environments
Authors:	王尉任;Wang, Wei-Jen;Chang, Yue-Shan;Lo, Win-Tsung;Lee, Yi-Kang
Contributors:	資訊電機學院資訊工程學系
Keywords:	Algorithms;Compilers;Computer Science;Interpreters;Processor Architectures;Programming Languages
Date:	2013-02-11
Issue Date:	2026-04-23 13:12:46 (UTC+8)
Publisher:	Springer Netherlands;Boston: Springer US
Abstract:	摘要： A hybrid cloud integrates private clouds and public clouds into one unified environment. For the economy and the efficiency reasons, the hybrid cloud environment should be able to automatically maximize the utilization rate of the private cloud and minimize the cost of the public cloud when users submit their computing jobs to the environment. In this paper, we propose the Adaptive-Scheduling-with-QoS-Satisfaction algorithm, namely AsQ , for the hybrid cloud environment to raise the resource utilization rate of the private cloud and to diminish task response time as much as possible. We exploit runtime estimation and several fast scheduling strategies for near-optimal resource allocation, which results in high resource utilization rate and low execution time in the private cloud. Moreover, the near-optimal allocation in the private cloud can reduce the amount of tasks that need to be executed on the public cloud to satisfy their deadline. For the tasks that have to be dispatched to the public cloud, we choose the minimal cost strategy to reduce the cost of using public clouds based on the characteristics of tasks such as workload size and data size. Therefore, the AsQ can achieve a total optimization regarding cost and deadline constraints. Many experiments have been conducted to evaluate the performance of the proposed AsQ. The results show that the performance of the proposed AsQ is superior to recent similar algorithms in terms of task waiting time, task execution time and task finish time. The results also show that the proposed algorithm achieves a better QoS satisfaction rate than other similar studies. 其他題名： J Supercomput 出版者： Boston: Springer US 出版日期： 2013-11 出處： The Journal of supercomputing, 2013-11, Vol.66 (2), p.783-811 資源來源： Springer Journals Access Only (NTUSG) 版權： Springer Science+Business Media New York 2013 識別號： ISSN: 0920-8542 識別號： EISSN: 1573-0484 識別號： DOI: 10.1007/s11227-013-0890-2
Appears in Collections:	[Department of Computer Science and information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	11	View/Open

社群 sharing

Loading...