Abstract
AbstractSo far, the genetic algorithm has been presented for the energy-aware scheduling of virtual machines to minimize the total busy time of servers. However, this algorithm does not consider the criteria for service-level policies on real-time applications. The convergence speed of the genetic algorithm is quite low in solving many of the large hybrid optimization problems. In other similar studies, heuristic algorithms were used to solve the interval scheduling problem. Such algorithms are not able to find nearly optimal solutions to hard problems. Since the optimization of scheduling is part of the hard problems, it is wise to use meta-heuristic algorithms to find nearly optimal solutions. Accordingly, an energy-aware meta-heuristic scheduling algorithm is presented in this paper for real-time virtual machines. The main goal of this algorithm is to minimize the total busy time of the physical machines in an interval without violating the deadline for virtual machines. The results were collected from the genetic algorithm, the smart water drop algorithm, the optimization of the ant colony, and the first possible downward algorithm for comparison and evaluation. The optimization of the ant colony and the smart algorithm of water drops showed better results than did the other two algorithms.KeywordsCloud computingEdge computingReal-time virtual machinesMeta heuristic algorithmsInterval scheduling
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
