About this event

Abstract: 

We consider job scheduling on multiple processors under the condition that the jobs also share a continuously divisible resource (e.g. bandwidth). Each job j comes with a resource requirement r_j and can only be processed at full speed if granted its full resource requirement. The goal is to find a resource assignment that minimizes the makespan. The focus of the talk is on the assignment of the shared continuous resource to the processors assuming that the job assignment to processors has already been fixed. We present algorithms and complexity results.