MohammadJavad NoroozOliaee, B. Hamdaoui, M. Guizani, Mahdi Ben Ghorbel
{"title":"Online multi-resource scheduling for minimum task completion time in cloud servers","authors":"MohammadJavad NoroozOliaee, B. Hamdaoui, M. Guizani, Mahdi Ben Ghorbel","doi":"10.1109/INFCOMW.2014.6849261","DOIUrl":null,"url":null,"abstract":"We design a simple and efficient online scheme for scheduling cloud tasks requesting multiple resources, such as CPU and memory. The proposed scheme reduces the queuing delay of the cloud tasks by accounting for their execution time lengths. We also derive bounds on the average queuing delays, and evaluate the performance of our proposed scheme and compare it with those achievable under existing schemes by relying on real Google data traces. Using this data, we show that our scheme outperforms the other schemes in terms of resource utilizations as well as average task queuing delays.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"49 1","pages":"375-379"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2014.6849261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
We design a simple and efficient online scheme for scheduling cloud tasks requesting multiple resources, such as CPU and memory. The proposed scheme reduces the queuing delay of the cloud tasks by accounting for their execution time lengths. We also derive bounds on the average queuing delays, and evaluate the performance of our proposed scheme and compare it with those achievable under existing schemes by relying on real Google data traces. Using this data, we show that our scheme outperforms the other schemes in terms of resource utilizations as well as average task queuing delays.