Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource

  title={Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource},
  author={Peter Kling and Alexander M{\"a}cker and S{\"o}ren Riechers and Alexander Skopalik},
We consider a scheduling problem on m identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20%, 15%, and 65%) and adjust this distribution over time. Each job j comes with a size pj ∈ R and a resource requirement rj > 0. Jobs do not benefit when receiving a share larger than rj of the resource. But providing them with a fraction of the… CONTINUE READING


Publications referenced by this paper.

Similar Papers

Loading similar papers…