A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Tighter Schedulability Analysis of Synchronization Protocols Based on Overrun without Payback for Hierarchical Scheduling Frameworks
2011
2011 16th IEEE International Conference on Engineering of Complex Computer Systems
Preserved Fulltext
In this paper, we show that both global as well as local schedulability analysis of synchronization protocols based on the stack resource policy (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority preemptive scheduling (FPPS) are pessimistic. We present tighter global and local schedulability analysis, illustrate the improvements of the new analysis by means of examples, and show that the improved global analysis is both uniform and sustainable. We
doi:10.1109/iceccs.2011.11
dblp:conf/iceccs/BehnamNB11
fatcat:2d4ua6zdjffmzpsoiospsy56ia