Reservation-Based Federated Scheduling for Parallel Real-Time Tasks

Ueter, Niklas; Brüggen, Georg von der; Chen, Jian-Jia; Li, Jing; Agrawal, Kunal

doi:10.1109/rtss.2018.00061

Cited by 37 publications

(16 citation statements)

References 38 publications

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)

Self Cite

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)

Self Cite

View full text Add to dashboard Cite

show abstract

“…In Li et al (2014), Melani et al (2015), Pathan et al (2018) global scheduling is assumed and analyzed for homogeneous multiprocessors. Furthermore, federated scheduling, which can be seen as a generalization of partitioned scheduling, recently has gained attention, and many recent works focus on this topic (Li et al 2014;Jiang et al 2017;Bhuiyan et al 2018;Ueter et al 2018). This paper proposes a single DAG analysis on unrelated multiprocessors, which is the first step towards the analysis of sporadic DAGs.…”

Section: Related Workmentioning

confidence: 99%

Bounding the execution time of parallel applications on unrelated multiprocessors

2021

View full text Add to dashboard Cite

Heterogeneous multiprocessors can offer high performance at low energy expenditures. However, to be able to use them in hard real-time systems, timing guarantees need to be provided, and the main challenge is to determine the worst-case schedule length (also known as makespan) of an application. Previous works that estimate the makespan focus mainly on the independent-task application model or the related multiprocessor model that limits the applicability of the makespan. On the other hand, the directed acyclic graph (DAG) application model and the unrelated multiprocessor model are general and can cover most of today’s platforms and applications. In this work, we propose a simple work-conserving scheduling method of the tasks in a DAG and two new approaches to finding the makespan. A set of representative OpenMP task-based parallel applications from the BOTS benchmark suite and synthetic DAGs are used to evaluate the proposed method. Based on the empirical results, the proposed approach calculates the makespan close to the exhaustive method and with low pessimism compared to a lower bound of the actual makespan calculation.

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%

“…The structure of the DAG tasks is illustrated in Figure 4. The execution time traces have been obtained from hardware-in-the-loop measurements while the sensors and the output drivers are simulated on predefined flying missions on a Pixhawk 4 hardware 4 on top of a NuttX OS 5 . Moreover, when measured, each sub-task is executed with highest priority in order to avoid any preemptions from other sub-tasks.…”

Section: Use Case: Px4 Autopilotmentioning

confidence: 99%

See 1 more Smart Citation

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

Reservation-Based Federated Scheduling for Parallel Real-Time Tasks

Cited by 37 publications

References 38 publications

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Dependency Graph Approach for Multiprocessor Real-Time Synchronization

Bounding the execution time of parallel applications on unrelated multiprocessors

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

Contact Info

Product

Resources

About