{"title":"用于公共云中数据密集型工作流的调度器","authors":"Walisson F. Pereira, L. Bittencourt, N. Fonseca","doi":"10.1109/LatinCloud.2013.6842221","DOIUrl":null,"url":null,"abstract":"Data-intensive workflows can require the use of intermediary data storage in the order of terabytes. Thus, planning the execution of such workflows in the cloud considering only processing demand, regardless its data storage needs, leads to performance decrease and potential increase in costs. In this paper, we present an integer linear program scheduler that considers disk storage scheduling besides the task scheduling based on processor time. The proposed scheduler aims to achieve the lowest economic cost while serving a deadline set by the user. The results show that the scheduler can find good schedules in situations where the disk size of rented virtual machines is a limiting factor.","PeriodicalId":344490,"journal":{"name":"2nd IEEE Latin American Conference on Cloud Computing and Communications","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Scheduler for data-intensive workflows in public clouds\",\"authors\":\"Walisson F. Pereira, L. Bittencourt, N. Fonseca\",\"doi\":\"10.1109/LatinCloud.2013.6842221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data-intensive workflows can require the use of intermediary data storage in the order of terabytes. Thus, planning the execution of such workflows in the cloud considering only processing demand, regardless its data storage needs, leads to performance decrease and potential increase in costs. In this paper, we present an integer linear program scheduler that considers disk storage scheduling besides the task scheduling based on processor time. The proposed scheduler aims to achieve the lowest economic cost while serving a deadline set by the user. The results show that the scheduler can find good schedules in situations where the disk size of rented virtual machines is a limiting factor.\",\"PeriodicalId\":344490,\"journal\":{\"name\":\"2nd IEEE Latin American Conference on Cloud Computing and Communications\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2nd IEEE Latin American Conference on Cloud Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LatinCloud.2013.6842221\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2nd IEEE Latin American Conference on Cloud Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LatinCloud.2013.6842221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduler for data-intensive workflows in public clouds
Data-intensive workflows can require the use of intermediary data storage in the order of terabytes. Thus, planning the execution of such workflows in the cloud considering only processing demand, regardless its data storage needs, leads to performance decrease and potential increase in costs. In this paper, we present an integer linear program scheduler that considers disk storage scheduling besides the task scheduling based on processor time. The proposed scheduler aims to achieve the lowest economic cost while serving a deadline set by the user. The results show that the scheduler can find good schedules in situations where the disk size of rented virtual machines is a limiting factor.