Stack-based scheduling for realtime processes
Real-Time Systems
Scheduling real-time applications in an open environment
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
A Fixed-Priority-Driven Open Environment for Real-Time Applications
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
A Model of Hierarchical Real-Time Virtual Resources
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Resource Partition for Real-Time Systems
RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
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
Hierarchical Fixed Priority Pre-Emptive Scheduling
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
A methodology for designing hierarchical scheduling systems
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
SIRAP: a synchronization protocol for hierarchical resource sharingin real-time open systems
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
The Design of an EDF-Scheduled Resource-Sharing Open Environment
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Analysis of Hierarchical EDF Pre-emptive Scheduling
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Compositional real-time scheduling framework with periodic model
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
We present our ongoing work on synchronization in hierarchical scheduled real-time systems, where tasks are scheduled using fixed-priority pre-emptive scheduling. In this paper, we show that the original local schedulability analysis of the synchronization protocol SIRAP [4] is very pessimistic when tasks of a subsystem access many global shared resources. The analysis therefore suggests that a subsystem requires more CPU resources than necessary. A new way to perform the schedulability analysis is presented which can make the SIRAP protocol more efficient in terms of calculated CPU resource needs.