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

by   Paolo Torroni, et al.

The Priority Inheritance Protocol (PIP) is arguably the best-known protocol for resource sharing under real-time constraints. Its importance in modern applications is undisputed. Nevertheless, because jobs may be blocked under PIP for a variety of reasons, determining a job's maximum blocking time could be difficult, and thus far no exact method has been proposed that does it. Existing analysis methods are inefficient, inaccurate, and of limited applicability. This article proposes a new characterization of the problem, thus allowing a polynomial method for bounding the blocking time, and an exact, optimally efficient method for blocking time computation under priority inheritance that have a general applicability.


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

Locking protocol is an essential component in resource management of rea...

A Bestiary of Blocking: The Motivations and Modes behind Website Unavailability

This paper examines different reasons the websites may vary in their ava...

Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous

We consider networks of processes that all execute the same finite-state...

Computation Resource Leasing for Priority Aggregation Local Computing Network

In large scale smart edge networks, computation resource is generally un...

Computing Redundancy in Blocking Systems: Fast Service or No Service

Redundancy in distributed computing systems reduces job completion time....

Multiprocessor Real-Time Locking Protocols: A Systematic Review

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

A Case Study: Using Genetic Algorithm for Job Scheduling Problem

Nowadays, DevOps pipelines of huge projects are getting more and more co...

Please sign up or login with your details

Forgot password? Click here to reset