Sep 21, 2017 · In this paper we consider a spin-based multi-processor locking protocol, named the Multiprocessor resource sharing Protocol (MrsP).
Our experiments show that, theoretically, the new analysis offers better (at least identical) schedulability than the FIFO non-preemptive protocol, and can ...
New Schedulability Analysis for MrsP - York Research Database
pure.york.ac.uk › portal › publications
Our experiments demonstrate that withmigration cost, MrsP may not be favourable for short criticalsections but provides a better schedulability than other ...
Our experiments demonstrate that with migration cost, MrsP may not be favourable for short critical sections but provides a better schedulability than other ...
New schedulability analysis for MrsP. S. Zhao, J. Garrido, A. Burns and A ... analysis for MrsP}, volume = {}, year = {2017} }. Back to Papers in 2017.
People also ask
What is schedulability analysis?
What is the formula for schedulability test?
In this paper, we extend the MrsP analysis for systems with nested resources. Major run-time costs incurred by MrsP tasks are also taken into account.
Highlights •A compressive review of Multiprocessor resource sharing Protocol (MrsP).•Response time analysis for adoption with nested resource access.
Under MrsP, tasks can incur a limited amount of arrival blocking due to the ceiling facility and can have a shorter spin delay than that of FIFO-P. Thus, MrsP ...
In this paper new MrsP schedulability analysis is developed that takes into account such knowledge to provide a less pessimistic analysis than that of the ...
In this paper, we extend the MrsP analysis for systems with nested resources. Major run-time costs incurred by MrsP tasks are also taken into account.