Precise Worst-Case Blocking Time of Tasks Under Priority Inheritance Protocol

DOI10.1109/TC.2020.3029328MaRDI QIDQ3390115zbMATH OpenOpenAlexFDO

Authors Eugenio Faldella, Daniela Loretti

Publication date 24 March 2022

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2020.3029328

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Priority inheritance protocols: an approach to real-time synchronization
• A misconception in blocking time analyses under multiprocessor synchronization protocols
• Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
• scientific article; zbMATH DE number 53313
• scientific article; zbMATH DE number 622471
• Approximation techniques for response-time analysis of static-priority tasks
• Minimizing total tardiness on parallel machines with preemptions

This page was built for publication: Precise Worst-Case Blocking Time of Tasks Under Priority Inheritance Protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390115)