Lars_SchedulingSharedContinuousResourcesOnMany-cores.pdf (472.58 kB)
0/0

Scheduling shared continuous resources on many-cores

Download (472.58 kB)
journal contribution
posted on 06.02.2018 by Ernst Althaus, Andre Brinkmann, Peter Kling, Friedhelm Meyer Auf der Heide, Lars Nagel, Soren Riechers, Jiri Sgall, Tim Suss
© 2017 Springer Science+Business Media New York We consider the problem of scheduling a number of jobs on m identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement [InlineEquation not available: see fulltext.]. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of (Formula presented.), it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their processing speeds, have been studied under the term discrete–continuous scheduling. Known results are either very pessimistic or heuristic in nature. In this article, we suggest and analyze a slightly simplified model. It focuses on the assignment of shared continuous resources to the processors. The job assignment to processors and the ordering of the jobs have already been fixed. It is shown that, even for unit size jobs, finding an optimal solution is NP-hard if the number of processors is part of the input. Positive results for unit size jobs include a polynomial-time algorithm for any constant number of processors. Since the running time is infeasible for practical purposes, we also provide more efficient algorithm variants: an optimal algorithm for two processors and a [InlineEquation not available: see fulltext.] -approximation algorithm for m processors.

Funding

Supported by the Federal Ministry of Education and Research (BMBF) under Grant 01IH13004 (Project “FAST”), by the German Research Foundation (DFG) within the Collaborative Research Center “On-The-Fly Computing” (SFB 901), by the Center of Excel- lence – ITI (project P202/12/G061 of GA CR), and by the Pacific Institute of Mathematical Sciences (PIMS).

History

School

  • Science

Department

  • Computer Science

Published in

Journal of Scheduling

Pages

1 - 16

Citation

ALTHAUS, E. ...et al., 2017. Scheduling shared continuous resources on many-cores. Journal of Scheduling, 21 (1), pp.77–92.

Publisher

© Springer

Version

AM (Accepted Manuscript)

Publisher statement

This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/

Publication date

2017

Notes

This is a post-peer-review, pre-copyedit version of an article published in Journal of Scheduling. The final authenticated version is available online at: https://doi.org/10.1007/s10951-017-0518-0

ISSN

1094-6136

Language

en

Exports

Logo branding

Exports