Abstract
The problem of admission control to schedule for user requirements is NP-complete [1] in cloud computing environment. To solve this problem it is usually to put building heuristic algorithms to form a simple algorithm with complex polynomial. In this paper, we propose an algorithm of admission control and a scheduling algorithm for user requirements based on the use of ACO algorithm (Ant Colony Optimization) and take advantage of validity period between the requirements so that the total cost of the system is minimal but still satisfying QoS (Quality of Service) constraints for the requirements. Two algorithms are set up and run a complete test on CloudSim. The experimental results show the effectiveness and superiority of the proposed algorithm in comparing with sequential and EDF (Earliest Deadline First) algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Các công trình nghiên cứu, phát triển và ứng dụng Công nghệ Thông tin và Truyền thông
Disclaimer: 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.