RePro-Active: a reactive-proactive scheduling method based on simulation in cloud computing

被引:28
作者
Alaei, Noroddin [1 ,2 ]
Safi-Esfahani, Faramarz [1 ,2 ]
机构
[1] Islamic Azad Univ, Najafabad Branch, Fac Comp Engn, Najafabad, Iran
[2] Islamic Azad Univ, Najafabad Branch, Big Data Res Ctr, Najafabad, Iran
关键词
Cloud computing; Autonomous computing; Reactive; Proactive; Simulation-based scheduling; ALGORITHM; WORKLOADS;
D O I
10.1007/s11227-017-2161-0
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud computing is a scalable computing infrastructure in which the number of resources and requests change dynamically. There are usually a huge number of tasks and resources in cloud computing. A scheduler does allocating resources to tasks, which is an operation with a large number of parameters that is of NP-hard problems. Approaches such as metaheuristic, simulation-based optimization (SBO), predictive algorithms, etc. are applied to mitigate the complexity of scheduling. Reactive scheduling methods are able to adapt their behavior based on a feedback loop from runtime environment, while proactive scheduling methods try to predict future events to adapt their behavior as well. These algorithms suffer from two problems: (1) they require additional information, like the execution time of tasks that are not usually available in practice and (2) they use the history of past activities that is not easy to maintain and process in order to make future decisions. To address the problems, this paper presents a reactive/proactive scheduling framework, dubbed RePro-Active that presents an iterative reactive/proactive scheduling algorithm called RePro-Active.SB runs periodically. It includes the algorithm called ReactiveScheduling to support reactive behavior, and the algorithms called ProactiveSSLB/ProactiveSSELB to reinforce proactive actions in which the algorithm called Simulate predicts future by simulating possible prospective events. First, the presented scheduling algorithms have the least dependence on prior knowledge about tasks. They are extracted from the category of round-robin methods that are more realistic and do not need extra information about the tasks that is not available in practice. Second, they also begin from current conditions (rather than relying on the history of data) and use SBO techniques that try to simulate possible prospective events to make better decisions. In order to realize the idea, RePro-Active is used to improve both task scheduling and load balancing in the cloud-computing environment. In comparison to the base methods, the results indicate that the completion time of tasks decreased by 30%, and average resource utilization ratio increased by 20%; while, throughput increased by 19%.
引用
收藏
页码:801 / 829
页数:29
相关论文
共 62 条
[1]  
Al Salami N.M., 2009, UbiCC J., V4, P823
[2]  
Amalarethinam D. I. George, 2011, International Journal of Research and Reviews in Computer Science, V2, P280
[3]  
[Anonymous], 2011, P 2 ACM S CLOUD COMP
[4]  
[Anonymous], 2010, Int J Comput Sci and Eng
[5]  
[Anonymous], 2009, ARXIV09032525
[6]  
[Anonymous], 2010, INT J COMPUTER APPL
[7]  
[Anonymous], 2011, INT J COMPUT APPL
[8]   The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions [J].
Armstrong, R ;
Hensgen, D ;
Kidd, T .
SEVENTH HETEROGENEOUS COMPUTING WORKSHOP (HCW '98), 1998, :79-87
[9]   A de-centralized scheduling and load balancing algorithm for heterogeneous grid environments [J].
Arora, M ;
Das, SK ;
Biswas, R .
2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDINGS OF THE WORKSHOPS, 2002, :499-505
[10]   Adaptive Workflow Scheduling Under Resource Allocation Constraints and Network Dynamics [J].
Avanes, Artin ;
Freytag, Johann-Christoph .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2008, 1 (02) :1631-1637