Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
Open Access
- 31 January 2023
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Algorithms
- Vol. 19 (1) , 1-25
Abstract
We consider a fundamental online scheduling problem in which jobs with processing times and deadlines arrive online over time at their release dates. The task is to determine a feasible preemptive schedule on a single or multiple possibly unrelated machines that maximizes the number of jobs that complete before their deadline. Due to strong impossibility results for competitive analysis on a single machine, we require that jobs contain some slack ɛ > 0, which means that the feasible time window for scheduling a job is at least 1+ɛ times its processing time on each eligible machine. Our contribution is two-fold: (i) We give the first non-trivial online algorithms for throughput maximization on unrelated machines, and (ii), this is the main focus of our paper, we answer the question on how to handle commitment requirements which enforce that a scheduler has to guarantee at a certain point in time the completion of admitted jobs. This is very relevant, e.g., in providing cloud-computing services, and disallows last-minute rejections of critical tasks. We present an algorithm for unrelated machines that is \(\Theta (\frac{1}{\varepsilon })\) -competitive when the scheduler must commit upon starting a job. Somewhat surprisingly, this is the same optimal performance bound (up to constants) as for scheduling without commitment on a single machine. If commitment decisions must be made before a job’s slack becomes less than a δ-fraction of its size, we prove a competitive ratio of \(\mathcal {O}(\frac{1}{\varepsilon - \delta })\) for 0 < δ < ɛ. This result nicely interpolates between commitment upon starting a job and commitment upon arrival. For the latter commitment model, it is known that no (randomized) online algorithm admits any bounded competitive ratio. While we mainly focus on scheduling without migration, our results also hold when comparing against a migratory optimal solution in case of identical machines.
Keywords
All Related Versions
Funding Information
- Netherlands Organisation for Scientific Research (NWO) through a VIDI (016.Vidi.189.087)
- German Science Foundation (ME 3825/1)
- Independent Research Fund Denmark, Natural Sciences (DFF-0135-00018B)
This publication has 33 references indexed in Scilit:
- Approximation schemes for a class of subset selection problemsTheoretical Computer Science, 2007
- Complexity of preemptive minsum scheduling on unrelated parallel machinesJournal of Algorithms, 2005
- Maximizing job completions onlineJournal of Algorithms, 2003
- Eliminating Migration in Multi-processor SchedulingJournal of Algorithms, 2001
- Speed is as powerful as clairvoyanceJournal of the ACM, 2000
- Scheduling for overload in real-time systemsIEEE Transactions on Computers, 1997
- MOCA: a multiprocessor on-line competitive algorithm for real-time system schedulingTheoretical Computer Science, 1994
- Minimizing the number of late jobs on unrelated machinesOperations Research Letters, 1991
- Multiprocessor online scheduling of hard-real-time tasksIEEE Transactions on Software Engineering, 1989
- Recent Results in the Theory of Machine Scheduling1983