The task scheduling in multicloud computing environment is complicated task. The cloud computing has increase tremendous popularity both in academia and business because of its on demand service over internet to the various customer. The task scheduling problem is N-P (Non deterministic polynomial) completeness problem. Task scheduling in cloud computing is a best-known problem that has been paid attention. This is again more challenging, specially for multicloud computing environment. This survey paper presents the Shortest Job First algorithm, Round Robin algorithm and Genetic Algorithm for task scheduling in multicloud computing. The round robin algorithm provides the fair allocation and square allocation of resource to the task. It provides the accurate result in finding solutions to large scale optimization problems, by Genetic algorithms such as task scheduling and it is also helpful. A good task and resource scheduling mechanism must satisfy the QoS requirement of the user and at the same time make an efficient utilization of resources. This survey paper presents an algorithm which tries to achieve application high availability, and minimum makespan, minimum response time and completion time.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.