IBM RESEARCH The Preemptive Resource Allocation Problem Kanthi

IBM RESEARCH The Preemptive Resource Allocation Problem Kanthi Sarpatwar IBM Research Baruch Schieber NJIT Hadas Shachnai Technion

Preemptive Resource Allocation: The General Setting

Preemptive Resource Allocation: The General Setting ü Each job must be scheduled within its time window

Preemptive Resource Allocation: The General Setting ü Each job must be scheduled within its time window ü Multiple jobs can be scheduled at a given time instant given that the total resource requirement is at most the available capacity.

Preemptive Resource Allocation: The General Setting ü Each job must be scheduled within its time window ü Multiple jobs can be scheduled at a given time instant given that the total resource requirement is at most the available capacity. ü Job preemption and migration are allowed

Two Variants of the Problem ü Maximum Throughput Variant (MAXT) ü Machine Minimization Variant (MINM)

The Maximum Throughput Variant (MAXT)

The Machine Minimization Variant (MINM)

Related Work

Related Work (Contd. )

Contributions: Maximum Throughput (MAXT)

Contributions: Machine Minimization (MINM)

High-Level Approach for MAXT

Algorithm for Laminar MAXT

Algorithm for Laminar MAXT

Algorithm for Laminar MAXT

Algorithm for Laminar MAXT

Algorithm for Laminar MAXT

Algorithm for Laminar MAXT What could go wrong ? ü The total fractional area of jobs packed into a gray interval is conserved. ✗ Fractional area bound could be violated in a black interval by how much?

Algorithm for Laminar MAXT

Open Problems

Thanks for your attention!!