Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems

by   Jian-Jia Chen, et al.
TU Eindhoven

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.


page 1

page 2

page 3

page 4


Worst-Case Analysis of LPT Scheduling on Small Number of Non-Identical Processors

The approximation ratio of the longest processing time (LPT) scheduling ...

Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms

Algorithms based on semi-partitioned scheduling have been proposed as a ...

A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors

The Graph Isomorphism (GI) problem is a theoretically interesting proble...

Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems

The sporadic task model is often used to analyze recurrent execution of ...

Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model

A model has been proposed in [Baruah et al., in Proceedings of the IEEE ...

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Over the years, many multiprocessor locking protocols have been designed...

Schedulability Analysis of Distributed Real-Time Applications under Dependence and Several Latency Constraints

This paper focuses on the analysis of real-time non preemptive multiproc...

Please sign up or login with your details

Forgot password? Click here to reset