Improved response time analysis of sporadic DAG tasks for global FP scheduling

Fonseca, José; Nelissen, Geoffrey; Nélis, Vincent

doi:10.1145/3139258.3139288

Cited by 55 publications

(40 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These results consider, mainly, global scheduling. For instance, Fonseca et al [13] estimate the response time of sporadic DAG tasks under global and fixed priority scheduling. They use nested fork-join structured DAGs to propose both accurate and efficient solution.…”

Section: Related Workmentioning

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

Section: Related Workmentioning

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

show abstract

“…There is plentiful of literature on scheduling algorithms and analysis techniques for the parallel real time tasks [6], [7], [8], [23], [24], which all assume tasks to be independent from each other and do not consider the locking issue.…”

Section: Related Workmentioning

confidence: 99%

On the Analysis of Parallel Real-Time Tasks with Spin Locks

Jiang

Guan

et al. 2020

Preprint

View full text Add to dashboard Cite

Locking protocol is an essential component in resource management of real-time systems, which coordinates mutually exclusive accesses to shared resources from different tasks. Although the design and analysis of locking protocols have been intensively studied for sequential real-time tasks, there has been little work on this topic for parallel real-time tasks. In this paper, we study the analysis of parallel real-time tasks using spin locks to protect accesses to shared resources in three commonly used request serving orders (unordered, FIFO-order and priority-order). A remarkable feature making our analysis method more accurate is to systematically analyze the blocking time which may delay a task's finishing time, where the impact to the total workload and the longest path length is jointly considered, rather than analyzing them separately and counting all blocking time as the workload that delays a task's finishing time, as commonly assumed in the state-of-the-art.

show abstract

“…Multiprocessor platforms with m ∈ {8, 16, 32} unispeed processors and nr, ranging over [2,4], [4,8] or [8,16], shared resources were considered. For each m, we generated the total utilizations of the tasksets from 1 to m in steps of 0.05m.…”

Section: A Experimental Setupmentioning

confidence: 99%

“…Real-time scheduling algorithms and analysis techniques for independent parallel tasks have been widely studied in the literature [1], [4], [8], [12]- [14], where shared resources are not modeled explicitly.…”

Section: Related Workmentioning

confidence: 99%

DPCP-p: A Distributed Locking Protocol for Parallel Real-Time Tasks

Yang

Chen

Jiang

et al. 2020

Preprint

View full text Add to dashboard Cite

Real-time scheduling and locking protocols are fundamental facilities to construct time-critical systems. For parallel real-time tasks, predictable locking protocols are required when concurrent sub-jobs mutually exclusive access to shared resources. This paper for the first time studies the distributed synchronization framework of parallel realtime tasks, where both tasks and global resources are partitioned to designated processors, and requests to each global resource are conducted on the processor on which the resource is partitioned. We extend the Distributed Priority Ceiling Protocol (DPCP) for parallel tasks under federated scheduling, with which we proved that a request can be blocked by at most one lower-priority request. We develop task and resource partitioning heuristics and propose analysis techniques to safely bound the task response times. Numerical evaluation (with heavy tasks on 8-, 16-, and 32-core processors) indicates that the proposed methods improve the schedulability significantly compared to the state-of-the-art locking protocols under federated scheduling.

show abstract

Improved response time analysis of sporadic DAG tasks for global FP scheduling

Cited by 55 publications

References 13 publications

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

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

On the Analysis of Parallel Real-Time Tasks with Spin Locks

DPCP-p: A Distributed Locking Protocol for Parallel Real-Time Tasks

Contact Info

Product

Resources

About