An O(log log m)-competitive Algorithm for Online Machine Minimization
RTSS, pp. 343-350, 2017.
This paper considers the online machine minimization problem, a basic real time scheduling problem. The setting for this problem consists of n jobs that arrive over time, where each job has a deadline by which it must be completed. The goal is to design an online scheduler that feasibly schedules the jobs on a nearly minimal number of mac...More
Full Text (Upload PDF)
PPT (Upload PPT)