{"title":"商业云环境下科学工作流调度的期限分配策略","authors":"Vahid Arabnejad, K. Bubendorfer, Bryan K. F. Ng","doi":"10.1145/2996890.2996905","DOIUrl":null,"url":null,"abstract":"Commercial clouds have become a viable platform for performing a significant range of large scale scientific analyses – due to the offerings of elasticity, specialist hardware, software infrastructure and pay-as-you-go cost model. Such clouds represent a low upfront capital cost alternative to the use of dedicated eScience infrastructure. However, there are still significant technical hurdles associated with obtaining the best performance for the cost - it is easy to provision commercial clouds inefficiently resulting in great and potentially unanticipated expense. In this paper we introduce a new heuristic scheduling algorithm Deadline Distribution Ratio (DDR) to address the workflow scheduling problem with the objectives of minimizing the cost of Cloud computing resources while satisfying a given deadline. Within this context, we also investigate a range of different deadline distribution strategies and their effect on the overall scheduling performance. We then compare the DDR algorithm against three other published algorithms, using five different scientific workflows generated using the pegasus workflow generator, on a CloudSim simulation that implements a pricing model based on AWS. In general, the DDR algorithm returns the lowest costs across the majority of deadlines and workflows, while maintaining a high scheduling success rate.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Deadline Distribution Strategies for Scientific Workflow Scheduling in Commercial Clouds\",\"authors\":\"Vahid Arabnejad, K. Bubendorfer, Bryan K. F. Ng\",\"doi\":\"10.1145/2996890.2996905\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Commercial clouds have become a viable platform for performing a significant range of large scale scientific analyses – due to the offerings of elasticity, specialist hardware, software infrastructure and pay-as-you-go cost model. Such clouds represent a low upfront capital cost alternative to the use of dedicated eScience infrastructure. However, there are still significant technical hurdles associated with obtaining the best performance for the cost - it is easy to provision commercial clouds inefficiently resulting in great and potentially unanticipated expense. In this paper we introduce a new heuristic scheduling algorithm Deadline Distribution Ratio (DDR) to address the workflow scheduling problem with the objectives of minimizing the cost of Cloud computing resources while satisfying a given deadline. Within this context, we also investigate a range of different deadline distribution strategies and their effect on the overall scheduling performance. We then compare the DDR algorithm against three other published algorithms, using five different scientific workflows generated using the pegasus workflow generator, on a CloudSim simulation that implements a pricing model based on AWS. In general, the DDR algorithm returns the lowest costs across the majority of deadlines and workflows, while maintaining a high scheduling success rate.\",\"PeriodicalId\":350701,\"journal\":{\"name\":\"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2996890.2996905\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2996890.2996905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Deadline Distribution Strategies for Scientific Workflow Scheduling in Commercial Clouds
Commercial clouds have become a viable platform for performing a significant range of large scale scientific analyses – due to the offerings of elasticity, specialist hardware, software infrastructure and pay-as-you-go cost model. Such clouds represent a low upfront capital cost alternative to the use of dedicated eScience infrastructure. However, there are still significant technical hurdles associated with obtaining the best performance for the cost - it is easy to provision commercial clouds inefficiently resulting in great and potentially unanticipated expense. In this paper we introduce a new heuristic scheduling algorithm Deadline Distribution Ratio (DDR) to address the workflow scheduling problem with the objectives of minimizing the cost of Cloud computing resources while satisfying a given deadline. Within this context, we also investigate a range of different deadline distribution strategies and their effect on the overall scheduling performance. We then compare the DDR algorithm against three other published algorithms, using five different scientific workflows generated using the pegasus workflow generator, on a CloudSim simulation that implements a pricing model based on AWS. In general, the DDR algorithm returns the lowest costs across the majority of deadlines and workflows, while maintaining a high scheduling success rate.