A model of Virtual Resource Scheduling in Cloud Computing and Its Solution using EDAs

Jianfeng Zhao; Wenhua Zeng; Miu Liu; Guangming Li
March 2012
International Journal of Digital Content Technology & its Applic;Mar2012, Vol. 6 Issue 4, p102
Academic Journal
Resource scheduling becomes more complex as the introduction of virtualization technology in cloud computing. This paper proposed a resource scheduling model using the concept of resource service ratio as an object function and employing Estimation of Distribution Algorithms (EDAs) to solve this model. In scheduling model, the resource was abstracted to nodes with attributes, the scheduling result was evaluated by resource service ratio instead of the tasks completion time. In EDAs, two novel factors were introduced, one was the iteration times of best individual unchanged for reducing the iteration time, and another was share probability for improving the fitness. In experiment, when the tasks number is between 5 and 55 and the load rate is between 0.5 and 1.5, comparing with Max-min algorithm, static algorithm and random algorithm, the resource service ratio of EDA algorithm is improved on average by at least 1.004 and at most 1.793 times.


Related Articles

  • A hybrid EDA with ACS for solving permutation flow shop scheduling. Tzeng, Yeu-Ruey; Chen, Chun-Lung; Chen, Chuen-Lung // International Journal of Advanced Manufacturing Technology;Jun2012, Vol. 60 Issue 9-12, p1139 

    This paper proposes a hybrid estimation of distribution algorithm (EDA) with ant colony system (ACS) for the minimization of makespan in permutation flow shop scheduling problems. The core idea of EDA is that in each iteration, a probability model is estimated based on selected members in the...

  • A Novel Variant of QGA with VNS for Flowshop Scheduling Problem. Latif, Muhammad Shahid; Hong Zhou; Ali, Amir // Journal of Computers;Sep2014, Vol. 9 Issue 9, p2191 

    In this paper, scheduling problem of flowshop with the criterion of minimizing the total flow time has been considered. An effective hybrid Quantum Genetic Algorithm and Variable Neighborhood Search (QGA-VNS or QGAvns) has been proposed as solution of Flow Shop Scheduling Problem (FSSP). First,...

  • Acceleration Operators in the Value Iteration Algorithms for Markov Decision Processes. Shlakhter, Oleksandr; Lee, Chi-Guhn; Khmelev, Dmitry; Jaber, Nasser // Operations Research;Jan2010, Vol. 58 Issue 1, p193 

    We study the general approach to accelerating the convergence of the most widely used solution method of Markov decision processes (MDPs) with the total expected discounted reward. Inspired by the monotone behavior of the contraction mappings in the feasible set of the linear programming problem...

  • A Dynamic Clustering Algorithm for Cloud Computing. Zhongxue Yang; Xiaolin Qin; Wenrui Li; Yingjie Yang // Information Technology Journal;2013, Vol. 12 Issue 18, p4637 

    A novel dynamic clustering algorithm for cloud computing is proposed in this study. Dynamic clustering algorithm originates from K-means algorithm, however, an important characteristic of dynamic clustering algorithm is dynamic in that the centroid of the new cluster is updated in each iteration...

  • The Idle/Waiting Time Operator With Applications To Multistage Flow shop Scheduling To Minimize The Rental Cost Under Specified Rental Policy Where Processing Times Are Associated With Probabilities Including Transportation Time. Gupta, Deepak; Singh, Harminder; Kaur, Husandeep // Industrial Engineering Letters;2012, Vol. 2 Issue 3, p61 

    This paper is an attempt to study nX3 flow shop production scheduling problems in which the processing time is associated with their respective probabilities transportation time and job block criteria. The objective of the study is to get optimal sequence of the jobs in order to minimize the...

  • Cost-Based Unit Commitment and Generation Scheduling Considering Reserve Uncertainty Using Hybrid Heuristic Technique. Alishahi, E.; Siahi, M.; Abdollahi, Amir; Rahmani, M.; Abdollahi, Ali // International Review of Electrical Engineering;Jan/Feb2011 Part B, Vol. 6 Issue 1, p379 

    This paper proposes a new approach for solving generation scheduling and ramp rate constrained unit commitment (GSRCUC) considering spinning reserve uncertainty. In order to handle reserve uncertainty the estimated probability that spinning reserve might be called and delivered is taken into...

  • Control of observations over random processes fluxes. Boldyrikhin, N.; Khutortsev, V. // Automation & Remote Control;Dec2006, Vol. 67 Issue 12, p1900 

    The construction of the iteration procedure for synthesizing the law of control of observation over the processes, appeared one after another according to random flux regularities, is considered. The general approach to solution of the problem and the approximate algorithm for synthesizing the...

  • Research on the Multi-view Point 3-D Clouds Splicing Algorithm based on Local Registration. Daoming FENG // International Journal of Computer Science Issues (IJCSI);Jan2013, Vol. 10 Issue 1, p780 

    The paper proposed a new 3-D measurement point cloud splicing algorithm. The algorithm utilizes registration ideal in model identification technology to realize unbound and accurate splicing of 3-D data. First, sample the overlapping areas in the two 3-D point clouds which need to be spliced....

  • AN ALGORITHM FOR OPTIMAL INVENTORY POLICIES FOR SYSTEMS WITH JOINT SETUP COSTS. Hartfiel, D. J.; Curry, G. L. // Management Science;Apr1974, Vol. 20 Issue 8, p1175 

    This paper presents an algorithm for optimal inventory policies for a class of multi-product dependent setup cost problems. The operational policy under consideration is to replenish jointly, at a reduced cost, all products of the dependent class which are to be ordered in a scheduling period....


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics