Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Event Model Interfaces for Heterogeneous System Analysis
Proceedings of the conference on Design, automation and test in Europe
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
An Algorithmic Toolbox for Network Calculus
Discrete Event Dynamic Systems
Providing accurate event models for the analysis of heterogeneous multiprocessor systems
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Efficient Model-Checking for Real-Time Task Networks
ICESS '09 Proceedings of the 2009 International Conference on Embedded Software and Systems
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Analyzing end-to-end functional delays on an IMA platform
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Causality closure for a new class of curves in real-time calculus
Proceedings of the 1st International Workshop on Worst-Case Traversal Time
The trajectory approach for the end-to-end response times with non-preemptive FP/EDF*
SERA'04 Proceedings of the Second international conference on Software Engineering Research, Management and Applications
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Nowadays embedded real-time systems are often large distributed communicating systems, and the need for bounds on worst-case execution times (WCET) now includes the need of bound on worst-case network traversal time (WCTT). Network calculus is one method used to compute such bounds, and has been successfully applied on Airbus A380 [13]. Nevertheless, the computed bounds could be pessimistic. On the other hand, the scheduling theory can often compute tight bounds, but with algorithms of complexity not able to deal with too large systems. In this paper, the scheduling theory is used to compute tight constraints on flows produced by computers, improving the inputs to the network calculus method and consequently compute better (i.e. lower) bounds. To do so, scheduling methods must be adapted to approach the best and worst date of message production, and some results on network calculus must be written to go from the scheduling method on a finite interval to a general long term constraint.