An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
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
Event Model Interfaces for Heterogeneous System Analysis
Proceedings of the conference on Design, automation and test in Europe
Context-Aware Performance Analysis for Efficient Embedded System Design
Proceedings of the conference on Design, automation and test in Europe - Volume 2
Analysis of Tree-Shaped Transactions in Distributed Real-Time Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
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
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
| Hi-index | 0.00 |
In this paper, we present an extension to existing approaches that capture and exploit timing-correlation between tasks for scheduling analysis in distributed systems. Previous approaches consider a unique timing-reference for each set of time-correlated tasks and thus, do not capture the complete timing-correlation between task activations. Our approach is to consider multiple timing-references which allows us to capture more information about the timing-correlation between tasks. We also present an algorithm that exploits the captured information to calculate tighter bounds for the worst-case response time analysis under a static priority preemptive scheduler.