Drozdowski, M and Shakhlevich, NV (2021) Scheduling divisible loads with time and cost constraints. Journal of Scheduling, 24 (5). pp. 507-521. ISSN 1094-6136
Abstract
In distributed computing, divisible load theory provides an important system model for allocation of data-intensive computations to processing units working in parallel. The main task is to define how a computation job should be split into parts, to which processors those parts should be allocated and in which sequence. The model is characterized by multiple parameters describing processor availability in time, transfer times of job parts to processors, their computation times and processor usage costs. The main criteria are usually the schedule length and cost minimization. In this paper, we provide the generalized formulation of the problem, combining key features of divisible load models studied in the literature, and prove its NP-hardness even for unrestricted processor availability windows. We formulate a linear program for the version of the problem with a fixed number of processors. For the case with an arbitrary number of processors, we close the gaps in the study of special cases, developing efficient algorithms for single criterion and bicriteria versions of the problem, when transfer times are negligible.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © The Author(s) 2019. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. |
Keywords: | Computational complexity; Divisible load scheduling; Linear programming |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 03 Oct 2019 14:16 |
Last Modified: | 25 Jun 2023 22:00 |
Status: | Published |
Publisher: | Springer Verlag |
Identification Number: | 10.1007/s10951-019-00626-6 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:151666 |
Download
Filename: Drozdowski-Shakhlevich2019_Article_SchedulingDivisibleLoadsWithTi.pdf
Licence: CC-BY 4.0