Schedule optimization for data processing flows on the cloud

Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimization, that is characteristically different from traditional problems in two aspects: Its space of alternative schedules is very rich, due to various optimization opportunities that cloud computing offers; its optimization criterion is at least two-dimensional, with monetary cost of using the cloud being at least as important as query completion time. In this paper, we study scheduling of dataflows that involve arbitrary data processing operators in the context of three different problems: 1) minimize completion time given a fixed budget, 2) minimize monetary cost given a deadline, and 3) find trade-offs between completion time and monetary cost without any a-priori constraints. We formulate these problems and present an approximate optimization framework to address them that uses resource elasticity in the c...

• Type: Journal
• Year: 2011
• Where: SIGMOD
• Authors: Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris, Yannis E. Ioannidis
• Keywords: Database, Optimization Criterion, Optimization Framework, Prototype System, SIGMOD 2011