Abstract
Task scheduling for heterogeneous multi-cloud environment is a well-known NP-complete problem. Due to exponential increase of client applications (i.e., workloads), cloud providers need to adopt an efficient task scheduling algorithm to handle workloads. Furthermore, the cloud provider may require to collaborate with other cloud providers to avoid fluctuation of demands. This workload sharing problem is referred as heterogeneous multi-cloud task scheduling problem. In this paper, we propose a task scheduling algorithm for heterogeneous multi-cloud environment. The algorithm is based on smoothing concept to organize the tasks. We perform rigorous experiments on synthetic and benchmark datasets and compare their results with two well-known multi-cloud algorithms namely, CMMS and CMAXMS. The comparison results show the superiority of the proposed algorithm in terms of two evaluation metrics, makespan and average cloud utilization.
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.
