eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2024-09-16
22:1
22:20
10.4230/LIPIcs.APPROX/RANDOM.2024.22
article
Scheduling Splittable Jobs on Configurable Machines
Casey, Matthew
1
https://orcid.org/0000-0003-2083-5470
Rajaraman, Rajmohan
1
https://orcid.org/0009-0005-3610-9918
Stalfa, David
1
Tan, Cheng
1
https://orcid.org/0000-0002-1420-5125
Northeastern University, Boston MA 02115, USA
Motivated by modern architectures allowing for the partitioning of a GPU into hardware separated instances, we initiate the study of scheduling splittable jobs on configurable machines. We consider machines that can be configured into smaller instances, which we call blocks, in multiple ways, each of which is referred to as a configuration. We introduce the Configurable Machine Scheduling (cms) problem, where we are given n jobs and a set C of configurations. A schedule consists of a set of machines, each assigned some configuration in C with each block in the configuration assigned to process one job. The amount of a job’s demand that is satisfied by a block is given by an arbitrary function of the job and block. The objective is to construct a schedule using as few machines as possible. We provide a tight logarithmic factor approximation algorithm for this problem in the general setting, a factor (3 + ε) approximation algorithm for arbitrary ε > 0 when there are O(1) input configurations, and a polynomial time approximation scheme when both the number and size of configurations are O(1). Finally, we utilize a technique for finding conic integer combinations in fixed dimension to develop an optimal polynomial time algorithm in the case with O(1) jobs, O(1) blocks, and every configuration up to a given size.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol317-approx-random2024/LIPIcs.APPROX-RANDOM.2024.22/LIPIcs.APPROX-RANDOM.2024.22.pdf
Scheduling algorithms
Approximation algorithms
Configurable machines
Splittable jobs
Linear programming