An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Model composition for scheduling analysis in platform design
Proceedings of the 39th annual Design Automation Conference
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Context-Aware Scheduling Analysis of Distributed Systems with Tree-Shaped Task-Dependencies
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Improved offset-analysis using multiple timing-references
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Performance analysis of multimedia applications using correlated streams
Proceedings of the conference on Design, automation and test in Europe
A scalable approach for the description of dependencies in hard real-time systems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Using timing analysis for the design of future switched based ethernet automotive networks
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Hi-index | 0.00 |
In this paper we present a new technique which exploits timing-correlation between tasks for scheduling analysis in multiprocessor and distributed systems with non-preemptive scheduled resources. Previously developed techniques also allow capturing and exploiting timing-correlation in distributed systems. However, they focus on timing correlations resulting from data dependencies between tasks. The new technique presented in this paper is orthogonal to the existing ones and allows capturing timing-correlations between the output event streams of tasks resulting from the use of a non-preemptive scheduling policy on a resource. We also show how these timing-correlations can be exploited to calculate tighter bounds for the worst-case response time analysis for tasks activated by such correlated event streams.