Non preemptive static priority in network calculus: accuracy and integration with P-GPS

Content Provider	Semantic Scholar
Author	Sofack, William Mangoua Sofack, Mangoua Boyer, M. H.
Copyright Year	2012
Abstract	The real-time behaviour of critical real-time systems relies on the real-time behaviour of the network and some method to compute bounds on the traversal time (worst case traversal time – WCTT). Network calculus (NC) is a method designed to compute such bounds, and one challenge is to have tight bounds, i.e. reaching the exact worst case, to avoid over-provisioning. In this paper, we present a new way to handle non-preemptive static priority (NP-SP) with NC, very accurate (it reaches the real worst cases in all thousands tested configurations), and to combine it with packet-based generalised processor sharing (P-GPS), providing bounds on NP-SP/P-GPS in network calculus1.
File Format	PDF HTM / HTML
Alternate Webpage(s)	http://projects.laas.fr/IFSE/FAC/papers/2012/O-8.pdf
Language	English
Access Restriction	Open
Content Type	Text
Resource Type	Article