Cookies?
Library Header Image
LSE Research Online LSE Library Services

Online throughput maximization on unrelated machines: commitment is no burden

Eberle, Franziska, Megow, Nicole and Schewior, Kevin (2023) Online throughput maximization on unrelated machines: commitment is no burden. ACM Transactions on Algorithms, 19 (1). ISSN 1549-6325

Full text not available from this repository.

Identification Number: 10.1145/3569582

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 -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 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.

Item Type: Article
Official URL: https://dl.acm.org/journal/talg
Additional Information: © 2023 The Author(s). Publication rights licensed to ACM.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 21 May 2024 13:12
Last Modified: 23 Jun 2024 23:32
URI: http://eprints.lse.ac.uk/id/eprint/123553

Actions (login required)

View Item View Item