TL;DR
PCG ∗ is introduced, an optimal TL-plane algorithm based on PCG, which guarantees at most 2( m − 1) preemptions per TL-plane, matching the best-known theoretical bound for uniform platforms.
We study the Busy Machine Time with Preemption and Migration and One Resource Requirement problem, motivated by energy minimization in cloud data centers. Given unlimited identical-capacity machines and jobs with release times, deadlines, processing times, and resource requirements, we allow free preemption and migrati...
We study the online Busy Time scheduling model on a single machine of unbounded capacity, with non-preemptive jobs. In our setting, flexible jobs arrive online with a processing time and deadline, both of which become known to the algorithm at the job's arrival time. The goal is to schedule jobs on the machine to finis...
This paper investigates a parallel machine scheduling problem featuring a single common server responsible for both loading and unloading operations. Each job consists of a unit-time loading operation, non-preemptive processing on one of \(m\) identical machines, and a unit-time unloading operation executed by the same...
We study vector scheduling in which each job is active during a fixed time interval. A job uses several resources and stays on one machine for its entire interval; its resource requirements may depend on the machine. The objective is to minimize the largest resource load over all machines and times. For $r$ machines an...
Modern data center servers process multiple jobs in parallel to improve performance. However, each job demands some subset of a server's resources (e.g., CPUs, memory, storage), and a set of jobs can run in parallel only if there are sufficient computational resources to meet each job's needs. Given a stream of arrivin...
It is well established that SRPT (shortest remaining processing time first) maximizes the number of job completions in a strong sample-path sense for a single-server scheduling model in which job sizes (processing times) are learned upon arrival and preemption is permitted with no cost [1]. Surprisingly, adding i.i.d....
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
