Maotong Xu, Sultan Alamro, Tian Lan, S. Subramaniam
{"title":"云中对截止日期敏感作业的推测执行优化","authors":"Maotong Xu, Sultan Alamro, Tian Lan, S. Subramaniam","doi":"10.1145/3078505.3078541","DOIUrl":null,"url":null,"abstract":"In this paper, we bring various speculative scheduling strategies together under a unifying optimization framework, which defines a new metric, Probability of Completion before Deadlines (PoCD), to measure the probability that MapReduce jobs meet their desired deadlines. We propose an optimization problem to jointly optimize PoCD and execution cost in different strategies. Three strategies are prototyped on Hadoop MapReduce and evaluated against two baseline strategies using experiments. A 78% net utility increase with up to 94% PoCD and 12% cost improvement is achieved.","PeriodicalId":133673,"journal":{"name":"Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Optimizing Speculative Execution of Deadline-Sensitive Jobs in Cloud\",\"authors\":\"Maotong Xu, Sultan Alamro, Tian Lan, S. Subramaniam\",\"doi\":\"10.1145/3078505.3078541\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we bring various speculative scheduling strategies together under a unifying optimization framework, which defines a new metric, Probability of Completion before Deadlines (PoCD), to measure the probability that MapReduce jobs meet their desired deadlines. We propose an optimization problem to jointly optimize PoCD and execution cost in different strategies. Three strategies are prototyped on Hadoop MapReduce and evaluated against two baseline strategies using experiments. A 78% net utility increase with up to 94% PoCD and 12% cost improvement is achieved.\",\"PeriodicalId\":133673,\"journal\":{\"name\":\"Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3078505.3078541\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3078505.3078541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimizing Speculative Execution of Deadline-Sensitive Jobs in Cloud
In this paper, we bring various speculative scheduling strategies together under a unifying optimization framework, which defines a new metric, Probability of Completion before Deadlines (PoCD), to measure the probability that MapReduce jobs meet their desired deadlines. We propose an optimization problem to jointly optimize PoCD and execution cost in different strategies. Three strategies are prototyped on Hadoop MapReduce and evaluated against two baseline strategies using experiments. A 78% net utility increase with up to 94% PoCD and 12% cost improvement is achieved.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
