Exploiting Time-Malleability in Cloud-based Batch Processing Systems

Mai, L., Kalyvianaki, E. & Costa, P. (2013). Exploiting Time-Malleability in Cloud-based Batch Processing Systems. Paper presented at the LADIS '13: 7th Workshop on Large-Scale Distributed Systems and Middleware, 02-11-2013 - 03-11-2013, Pennsylvania, USA.

[img]
Preview
Text - Accepted Version
Download (743kB) | Preview

Abstract

Existing cloud provisioning schemes allocate resources to batch processing systems at deployment time and only change this allocation at run-time due to unexpected events such as server failures.

We observe that MapReduce-like jobs are timemalleable, i.e., at runtime it is possible to dynamically vary the number of resources allocated to a job and, hence, its completion time.

In this paper, we propose a novel approach based on time-malleability to opportunistically update job resources in order to increase overall utilization and revenue. To set the right incentives for both providers and tenants, we introduce a novel pricing model that charges tenants according to job completion times. Using this model, we formulate an optimization problem for revenue maximization.

Preliminary results show that compared to today’s practices our solution can increase revenue by up to 69.7% and can accept up to 57% more jobs.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: School of Informatics > Department of Computing
URI: http://openaccess.city.ac.uk/id/eprint/8179

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics