Algorithms for Scheduling Malleable Cloud Tasks

TL;DR

This paper introduces a fundamental model for scheduling malleable batch tasks in cloud computing, providing necessary and sufficient conditions for deadline adherence and an optimal scheduling algorithm.

Contribution

It presents a new model with a core condition for feasible scheduling and an algorithm that guarantees optimal schedules for malleable cloud tasks.

Findings

Established a necessary and sufficient condition for task completion by deadlines.

Developed an optimal scheduling algorithm based on the core condition.

Enabled improved analysis and design of scheduling algorithms.

Abstract

Due to the ubiquity of batch data processing in cloud computing, the related problem of scheduling malleable batch tasks and its extensions have received significant attention recently. In this paper, we consider a fundamental model where a set of n tasks is to be processed on C identical machines and each task is specified by a value, a workload, a deadline and a parallelism bound. Within the parallelism bound, the number of machines assigned to a task can vary over time without affecting its workload. For this model, we obtain two core results: a sufficient and necessary condition such that a set of tasks can be finished by their deadlines on C machines, and an algorithm to produce such a schedule. These core results provide a conceptual tool and an optimal scheduling algorithm that enable proposing new algorithmic analysis and design and improving existing algorithms under various objectives.