Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors

Jiang, Xu; Guan, Nan; Long, Xiang; Yi, Wang

doi:10.1109/rtss.2017.00015

Cited by 60 publications

(25 citation statements)

References 38 publications

(60 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each of the z semaphores, a DAG is constructed using Algorithm 1. Afterwards, the z resulting DAGs can be scheduled using any approach for multiprocessor DAG scheduling, e.g., global scheduling [29], Federated Scheduling [31] as well as enhanced versions like Semi-Federated Scheduling [25] and Reservation-Based Federated Scheduling [43].…”

Section: Periodic Tasks With Different Periodsmentioning

confidence: 99%

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Chen

Brüggen

Shi

et al. 2018

2018 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

Over the years, many multiprocessor locking protocols have been designed and analyzed. However, the performance of these protocols highly depends on how the tasks are partitioned and prioritized and how the resources are shared locally and globally. This paper answers a few fundamental questions when realtime tasks share resources in multiprocessor systems. We explore the fundamental difficulty of the multiprocessor synchronization problem and show that a very simplified version of this problem is N P -hard in the strong sense regardless of the number of processors and the underlying scheduling paradigm. Therefore, the allowance of preemption or migration does not reduce the computational complexity. For the positive side, we develop a dependency-graph approach, that is specifically useful for framebased real-time tasks, in which all tasks have the same period and release their jobs always at the same time. We present a series of algorithms with speedup factors between 2 and 3 under semi-partitioned scheduling. We further explore methodologies and tradeoffs of preemptive against non-preemptive scheduling algorithms and partitioned against semi-partitioned scheduling algorithms. The approach is extended to periodic tasks under certain conditions.

show abstract

Section: Periodic Tasks With Different Periodsmentioning

confidence: 99%

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Chen

Brüggen

Shi

et al. 2018

2018 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

show abstract

“…The scheduling and the schedulability of tasks with precedence constraints on multi-core processors have received recent attention from the real-time community [5][6][7][8][9][10][11][12]. These results consider, mainly, global scheduling.…”

Section: Related Workmentioning

confidence: 99%

“…e1 (5,6) Fig. 1: A task set describing partitioning and precedence constraints between sub-tasks of two DAG tasks τ 1 and τ 2 Each precedence constraint (τ i,j , τ i,k ) ∈ E i imposes that the sub-task τ i,k is not released until τ i,j has completed its execution.…”

Section: Task Model and Notationsmentioning

confidence: 99%

Probabilistic Schedulability Analysis for Precedence Constrained Tasks on Partitioned Multi-core

Ben-Amor

Cucu-Grosjean

Mezouak

et al. 2020

2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

View full text Add to dashboard Cite

The design of cyber-physical systems (CPSs) is facing the explosion of new functionalities requiring increased computation capacities and, thus, the introduction of multicore processors. Moreover, some functionalities may impose precedence constraints between the programs implementing these new functionalities. While important effort has been dedicated to the scheduling of precedence constraints tasks on multi-core processors, existing work considers either partitioned scheduling for a single precedence graph defining precedence constraints between tasks, or global scheduling policies.In this paper, we consider partitioned scheduling for multiple precedence graphs defining precedence constraints between tasks. The variability of execution times and of communication times is described by probability distributions. We propose a new response time analysis over-performing existing ILP-based results. Thanks to its scalability, our solution is extendable to a probabilistic version and we validate it on a PX4 drone autopilot. Beside this autopilot for our experiments, we implemented a probabilistic extension of a multi-core processor simulator, SimSo. A priority assignment heuristic allowing parallel executions is also proposed. Thanks to its adaptation to partitioned scheduling, our heuristic has better performances than existing solutions and its performances are, also, compared against a genetic-based heuristic.

show abstract

“…Chen [7] later showed that federated scheduling does not admit any constant speedup factor with respect the optimal scheduling algorithm. Jiang et al [12] extended the federated scheduling approach to semi-federated scheduling, in which one or two processors used by a heavy task can be shared with other tasks.…”

Section: Related Workmentioning

confidence: 99%

Reservation-Based Federated Scheduling for Parallel Real-Time Tasks

Ueter

Brüggen²,

Chen

et al. 2018

2018 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

This paper considers the scheduling of parallel realtime tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federated scheduling approach. We propose a reservation-based algorithm, called reservation-based federated scheduling, that dominates federated scheduling. We provide general constraints for the design of such systems and prove that reservation-based federated scheduling has a constant speedup factor with respect to any optimal DAG task scheduler. Furthermore, the presented algorithm can be used in conjunction with any scheduler and scheduling analysis suitable for ordinary arbitrary-deadline sporadic task sets, i.e., without parallelism.

show abstract

Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors

Cited by 60 publications

References 38 publications

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Probabilistic Schedulability Analysis for Precedence Constrained Tasks on Partitioned Multi-core

Reservation-Based Federated Scheduling for Parallel Real-Time Tasks

Contact Info

Product

Resources

About