|Title:||Online Optimization of Busy Time on Parallel Machines
|Authors:||M. Shalom, A. Voloshin, P.W.H. Wong, F.C.C. Yung, S. Zaks
|Abstract:||We consider the following online scheduling problem in which the input consists of $n$ jobs to be scheduled on identical machines of bounded capacity $g$ (the maximum number of jobs that can be processed simultaneously on a single machine). Each job is associated with a release time and a completion time between which it is supposed to be processed. When a job is released, the online algorithm has to make decision without changing it afterwards. We consider two versions of the problem. In the minimization version, the goal is to minimize the total busy time of machines used to schedule all jobs. In the resource allocation maximization version, the goal is to maximize the number of jobs that are scheduled under a budget constraint given in terms of busy time. This is the first study on online algorithms for these problems. We show a rather large lower bound on the competitive ratio for general instances. This motivates us to consider special families of input instances for which we show constant competitive algorithms. Our study has applications in power aware scheduling, cloud computing and optimizing switching cost of optical networks.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2012/CS/CS-2012-02), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 2012
To the main CS technical reports page
Computer science department, Technion