Navendu Jain: Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters

Key words: deadline(due date)

 

Specification(assumption): Each batch job is characterized by the work volume of total computing units (e.g., CPU hours) along with a bound on maximum degree of parallelism. Users specify, along with these job characteristics, their desired due date and a value for finishing the job by its deadline.

Solution:

1) a new ( C/(C-k) ⋅ s/(s-1))-approximation algorithm for this objective, where C denotes cloud capacity, k is the maximal bound on parallelized execution (in practical settings, k l C) and s is the slackness on the job completion time i.e., the minimal ratio between a specified deadline and the earliest finish time of a job. Our algorithm is based on utilizing dual fitting arguments over a strengthened linear program to the problem.

2) we construct truthful allocation and pricing mechanisms, 

3) We empirically evaluate the benefits of our approach through simulations on data-center job traces,