An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Optimal rate-based scheduling on multiprocessors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Exact Best-Case Response Time Analysis of Fixed Priority Scheduled Tasks
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Model of Hierarchical Real-Time Virtual Resources
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Periodic Resource Model for Compositional Real-Time Guarantees
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Scheduling within temporal partitions: response-time analysis and server design
Proceedings of the 4th ACM international conference on Embedded software
A methodology for designing hierarchical scheduling systems
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
A Hierarchical Framework for Component-based Real-time Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Toward probabilistic real-time calculus
ACM SIGBED Review
| Hi-index | 0.00 |
In this paper, we propose a methodology for developing component-based real-time systems based on the concept of hierarchical scheduling. Recently, much work has been devoted to the schedulability analysis of hierarchical scheduling systems, in which real-time tasks are grouped into components, and it is possible to specify a different scheduling policy for each component. Until now, only independent components have been considered. In this paper, we extend this model to tasks that interact through remote procedure calls. We introduce the concept of abstract computing platform on which each component is executed. Then, we transform the system specification into a set of real-time transactions and present a schedulability analysis algorithm. Our analysis is a generalization of the holistic analysis to the case of abstract computing platforms. We demonstrate the use of our methodology on a simple example.