Log In Sign Up

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

by   Xu Jiang, et al.

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.


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

Real-time scheduling and locking protocols are fundamental facilities to...

Blocking time under basic priority inheritance: Polynomial bound and exact computation

The Priority Inheritance Protocol (PIP) is arguably the best-known proto...

Supporting Multiprocessor Resource Synchronization Protocols in RTEMS

When considering recurrent tasks in real-time systems, concurrent access...

Multiprocessor Real-Time Locking Protocols: A Systematic Review

We systematically survey the literature on analytically sound multiproce...

Optimizing System Quality of Service through Rejuvenation for Long-Running Applications with Real-Time Constraints

Reliability, longevity, availability, and deadline guarantees are the fo...

Virtualization technology for distributed time sensitive domains

This paper reports on the state of the art of virtualization technology ...

Bounding the Response Time of DAG Tasks Using Long Paths

In 1969, Graham developed a well-known response time bound for a DAG tas...