Stochastic Tail-Phase Optimization for Bag-of-Tasks Execution in Clouds
Autor: | Haralambie Leahu, Ana-Maria Oprescu, Thilo Kielmann |
---|---|
Přispěvatelé: | Computer Systems, Network Institute, High Performance Distributed Computing |
Rok vydání: | 2012 |
Předmět: |
020203 distributed computing
business.industry Computer science Distributed computing Real-time computing Cloud computing 02 engineering and technology Replicate Stochastic programming Scheduling (computing) Idle Outlier 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Stochastic optimization business Budget constraint |
Zdroj: | UCC Vrije Universiteit Amsterdam The 5th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2012) Oprescu, A M, Kielmann, T & Leahu, H 2012, Stochastic Tail-Phase Optimization for Bag-of-Tasks Execution in Clouds . in The 5th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2012) . IEEE Computer Society, Chicago, IL, USA . |
Popis: | Elastic applications like bags of tasks benefit greatly from Infrastructure as a Service (IaaS) clouds that let users allocate compute resources on demand, charging based on reserved time intervals. Users, however, still need guidance for mapping their applications onto multiple IaaS offerings, both minimizing execution time and respecting budget limitations. For budget-controlled execution of bags of tasks, we built Bats, a scheduler that estimates possible budget and make spancombinations using a tiny task sample, and then executes a bag within the user's budget constraints. Previous work has shown the efficacy of this approach. There remains, however, the risk of outlier tasks causing the execution to exceed the predicted make span. In this work, we present a stochastic optimization of the tail phase for Bats' execution. The main idea is to use the otherwise idling machines up until the end of their (already paid-for) allocation time. Using the task completion time information acquired during the execution, BaTS decides which tasks to replicate onto idle machines in the tail phase, reducing the make span and improving the tolerance to outlier tasks. Our evaluation results show that this effect is robust w.r.t. the quality of runtime predictions and is the strongest with more expensive schedules in which many fast machines are available. |
Databáze: | OpenAIRE |
Externí odkaz: |