SwePub - search: id:"swepub:oai:DiVA.org:uu-461...

Enumeration	Reference	Cover	Find
1.	Dai, Gaoyang, et al. (author) Timing-Anomaly Free Dynamic Scheduling of Periodic DAG Tasks with Non-Preemptive Nodes 2021 In: 2021 IEEE 27th International Conference On Embedded And Real-Time Computing Systems And Applications (RTCSA 2021). - : Institute of Electrical and Electronics Engineers (IEEE). - 9781665441889 ; , s. 119-128 Conference paper (peer-reviewed)abstract Designing timing-anomaly free multiprocessor scheduling algorithms is a notoriously hard problem, especially for parallel tasks with non-preemptive execution regions. In this paper, we first propose a simple yet expressive model which abstracts a parallel task as a single computation unit, and then, present a sufficient condition for timing-anomaly free scheduling of such units. On top of this, we design an algorithm for scheduling a set of periodic parallel tasks, represented as DAG with non-preemptive subtasks, on multicore processors. The algorithm has several desirable properties, including timing-anomaly freedom, high resource utilization, and low memory requirement. Timing-anomaly freedom enables an exact schedulability test for the algorithm, which, as shown in our evaluations, provides a significantly high schedulability ratio compared to those state-of-the-art methods that suffer from timing anomalies.

Dai, Gaoyang, et al. (author)
Timing-Anomaly Free Dynamic Scheduling of Periodic DAG Tasks with Non-Preemptive Nodes
2021
In: 2021 IEEE 27th International Conference On Embedded And Real-Time Computing Systems And Applications (RTCSA 2021). - : Institute of Electrical and Electronics Engineers (IEEE). - 9781665441889 ; , s. 119-128
Conference paper (peer-reviewed)abstract
- Designing timing-anomaly free multiprocessor scheduling algorithms is a notoriously hard problem, especially for parallel tasks with non-preemptive execution regions. In this paper, we first propose a simple yet expressive model which abstracts a parallel task as a single computation unit, and then, present a sufficient condition for timing-anomaly free scheduling of such units. On top of this, we design an algorithm for scheduling a set of periodic parallel tasks, represented as DAG with non-preemptive subtasks, on multicore processors. The algorithm has several desirable properties, including timing-anomaly freedom, high resource utilization, and low memory requirement. Timing-anomaly freedom enables an exact schedulability test for the algorithm, which, as shown in our evaluations, provides a significantly high schedulability ratio compared to those state-of-the-art methods that suffer from timing anomalies.

Träfflista för sökning "id:"swepub:oai:DiVA.org:uu-461552" "