License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2018.71
URN: urn:nbn:de:0030-drops-100198
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/10019/
Chen, Jian-Jia ;
Bansal, Nikhil ;
Chakraborty, Samarjit ;
von der Brüggen, Georg
Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems
Abstract
In real-time systems, in addition to the functional correctness recurrent tasks must fulfill timing constraints to ensure the correct behavior of the system. Partitioned scheduling is widely used in real-time systems, i.e., the tasks are statically assigned onto processors while ensuring that all timing constraints are met. The decision version of the problem, which is to check whether the deadline constraints of tasks can be satisfied on a given number of identical processors, has been known NP-complete in the strong sense. Several studies on this problem are based on approximations involving resource augmentation, i.e., speeding up individual processors. This paper studies another type of resource augmentation by allocating additional processors, a topic that has not been explored until recently. We provide polynomial-time algorithms and analysis, in which the approximation factors are dependent upon the input instances. Specifically, the factors are related to the maximum ratio of the period to the relative deadline of a task in the given task set. We also show that these algorithms unfortunately cannot achieve a constant approximation factor for general cases. Furthermore, we prove that the problem does not admit any asymptotic polynomial-time approximation scheme (APTAS) unless P=NP when the task set has constrained deadlines, i.e., the relative deadline of a task is no more than the period of the task.
BibTeX - Entry
@InProceedings{chen_et_al:LIPIcs:2018:10019,
author = {Jian-Jia Chen and Nikhil Bansal and Samarjit Chakraborty and Georg von der Br{\"u}ggen},
title = {{Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {71:1--71:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/10019},
URN = {urn:nbn:de:0030-drops-100198},
doi = {10.4230/LIPIcs.ISAAC.2018.71},
annote = {Keywords: multiprocessor partitioned scheduling, approximation factors}
}
|
Keywords: |
|
multiprocessor partitioned scheduling, approximation factors |
|
Collection: |
|
29th International Symposium on Algorithms and Computation (ISAAC 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
06.12.2018 |
