{"title":"异构多云环境下基于平滑的任务调度算法","authors":"S. K. Panda, Subhrajit Nag, P. K. Jana","doi":"10.1109/PDGC.2014.7030716","DOIUrl":null,"url":null,"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.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"A smoothing based task scheduling algorithm for heterogeneous multi-cloud environment\",\"authors\":\"S. K. Panda, Subhrajit Nag, P. K. Jana\",\"doi\":\"10.1109/PDGC.2014.7030716\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":311953,\"journal\":{\"name\":\"2014 International Conference on Parallel, Distributed and Grid Computing\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Parallel, Distributed and Grid Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDGC.2014.7030716\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Parallel, Distributed and Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDGC.2014.7030716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A smoothing based task scheduling algorithm for heterogeneous multi-cloud environment
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.