Loading [MathJax]/extensions/MathMenu.js
Response-Time Analysis of Limited-Preemptive Sporadic DAG Tasks | IEEE Journals & Magazine | IEEE Xplore

Response-Time Analysis of Limited-Preemptive Sporadic DAG Tasks


Abstract:

Guaranteeing timing constraints for parallel real-time applications deployed on multicore platforms is challenging, especially for applications containing non-preemptive ...Show More

Abstract:

Guaranteeing timing constraints for parallel real-time applications deployed on multicore platforms is challenging, especially for applications containing non-preemptive execution blocks, that suffer from priority inversions. In this article, we propose to model such applications using a sporadic directed acyclic graph (DAG) model where preemption may take place only between the nodes of a DAG task. We present a new method for response-time analysis of such tasks scheduled with the global fixed-priority scheduling policy. We show that our method outperforms the state-of-the-art techniques significantly in terms of resource utilization in experimental evaluations using both benchmark and randomly generated task sets. We also present a method to deal with global EDF scheduling, which is a new technique proposed for response time analysis of sporadic DAG tasks with non-preemptive nodes.
Page(s): 3673 - 3684
Date of Publication: 22 August 2022

ISSN Information:

Funding Agency:


I. Introduction

To thoroughly exploits the computational resources on multicore platforms, new modeling and analysis techniques should be developed with the consideration of software parallelization. Many parallel applications, such as OpenMP programs, and robotic software run on ROS [1], can be naturally modeled as directed acyclic graphs (DAGs), where nodes represent sequential execution units, also called subtasks, and edges represent precedence constraints between subtasks.

References

References is not available for this document.