Abstract
Real-time systems require locking protocols to coordinate access to shared resources. With the booming revolution of parallel processing technology in real-time systems, there has been some work addressing the problem of extending classic locking protocols for sequential real-time tasks to parallel tasks. However, it may not be most effective to trivially follow the progress mechanisms and queue orders designed for sequential tasks since the intra-structure information within a parallel task is not taken into consideration. This paper investigates the design of locking protocols for parallel tasks using a novel mechanism - Longest Normal Section First (LNSF) - to consider the impact of normal sections on blocking behavior in parallel tasks and further improve real-time performance. LNSF is then implemented in a locking protocol for parallel tasks named POMIP, and associated blocking analysis techniques are presented. Empirical evaluations show that our proposed analysis dominated other state-of-the-art analysis— in best cases, the acceptance ratio of the task set can be improved by around 17%. © 2023 IEEE.
| Original language | English |
|---|---|
| Pages (from-to) | 3720-3732 |
| Journal | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
| Volume | 42 |
| Issue number | 11 |
| Online published | 5 Apr 2023 |
| DOIs | |
| Publication status | Published - Nov 2023 |
Bibliographical note
Full text of this publication does not contain sufficient affiliation information. With consent from the author(s) concerned, the Research Unit(s) information for this record is based on the existing academic department affiliation of the author(s).Research Keywords
- Behavioral sciences
- Blocking Analysis
- DAG Tasks
- Directed acyclic graph
- Locking Protocols
- Program processors
- Protocols
- Real-Time Scheduling
- Real-time systems
- Task analysis
- Timing
- directed acyclic graph (DAG) tasks