Non preemptive static priority with network calculus: enhancement

Authors:
William Mangoua Sofack;Marc Boyer
Affiliations:
The French Aerospace Lab, ONERA, Toulouse, France;The French Aerospace Lab, ONERA, Toulouse, France
Venue:
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Year:
2012

Citing 5
Cited 1

Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Complex task activation schemes in system level performance analysis

CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus

RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Delay bounds for FIFO aggregates: a case study

Computer Communications
Runtime improved computation of path latencies with the real-time calculus

Proceedings of the 1st International Workshop on Worst-Case Traversal Time

Continuity for network calculus

Proceedings of the 21st International conference on Real-Time Networks and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper addresses worst case performance analysis of non preemptive static scheduling priority scheduling within the network calculus theory. Previous studies have been done, each one generalizing some other [8,1,7,3,10], needing weaker hypotheses or improving accuracy of results. This paper presents a very general results, with an accuracy that appear, on preliminary examples, as good as all other one.