2018/06/05 by Paolo Torroni, Torroni, Paolo, Zeynep Kiziltan +4
Computer Science · #Embedded Systems Design Techniques #FOS: Computer and information sciences #Interconnection Networks and Systems #Operating Systems (cs.OS) #Real-Time Systems Scheduling #cs.OS
paper · pdf · doi:10.48550/arxiv.1806.01589
openalex publication_date 2018/06/05 · arxiv created 2018/06/11 · arxiv updated 2018/06/12 · openalex created_date 2018/06/13 · openalex updated_date 2026/07/28
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.