Name
Title | ||
|---|---|---|
Global Fixed-Priority Scheduling for Parallel Real-Time Tasks with Constrained Parallelism |
Abstract | ||
|---|---|---|
With the rapid development of parallel programming techniques and the widespread use of multiprocessors, scheduling and analysis techniques supporting parallel real-time tasks become a critical topic for multiprocessor real-time systems. Global scheduling that allows the vertices of a parallel task to execute on any processor is a promising scheduling approach with guaranteed theoretical bounds and wide use in practice. However, the complex internal structure of parallel tasks leads to extensive inner- and inter-task interference, which leads to significant pessimism in the worst-case timing analysis. In this paper, a global fixed-priority (G-FP) scheduling with constrained parallelism for parallel real-time tasks based on the sporadic directed acyclic graph (DAG) model is proposed. Each DAG task is assigned a parallel threshold, such that the number of processors occupied by the task is limited to the parallel threshold of the task at a time. We propose a heuristic algorithm to set the parallel threshold and present a response-time analysis (RTA) to exploit the feature of the constrained parallel scheduling. Experiments with randomly generated tasks show that the proposed approach improves the schedulability upon G-FP and federated scheduling in terms of acceptance ratio. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1142/S021812662250150X | JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS |
Keywords | DocType | Volume |
Parallel real-time tasks, multiprocessors, response-time analysis | Journal | 31 |
Issue | ISSN | Citations |
08 | 0218-1266 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lei Qiao | 1 | 2 | 5.43 |
| Maolin Yang | 2 | 4 | 1.43 |
| Ze-Wei Chen | 3 | 1 | 2.05 |
| Yong Liao | 4 | 3 | 3.11 |
| Hang Lei | 5 | 0 | 1.69 |
| Nan Sang | 6 | 0 | 0.34 |