《Bag Constraints》.pdf

Varying Bandwidth Resource Allocation Problem with Bag Constraints Venkatesan T. Chakaravarthy Vinayaka Pandit Yogish Sabharwal Deva P. Seetharam IBM India Research Lab, New Delhi {vechakra, pvinayak, ysabharwal, dseetharam}@ Abstract We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release time, deadline, processing time, profit and the number of machines required. The total number of machines may be dierent at dierent points of time. A feasible solution is a subset of jobs and a schedule for them such that at any timeslot, the total number of machines required by the jobs active at the timeslot does not exceed the number of machines available at that timeslot. We present an O(log(Bmax /Bmin ))- approximation algorithm, where Bmax and Bmin are the maximum and minimum available bandwidth. Our algorithm and the approximation ratio are applicable for more a general prob- lem that we call the Varying bandwidth resource allocation problem with bag con- straints (BagVBRap). The BagVBRap problem is a generalization of some previ- ously studied scheduling and resource allocation problems. 1 Introduction We consider scheduling problems in parallel and distributed settings in which we need to schedule jobs on a system oering a certain amount of some resource. Each job requires a particular amount of the resource for its execution. The total amount of the resource oered by the system is dierent at dierent points of time. Ou