Stack-based scheduling for realtime processes
Real-Time Systems
A practitioner's handbook for real-time analysis
A practitioner's handbook for real-time analysis
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
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
An Open Environment for Real-Time Applications
Real-Time Systems
Experience with processes and monitors in Mesa
Communications of the ACM
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
POSIX-Compatible Application-Defined Scheduling in MaRTE OS
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Integrated scheduling of multimedia and hard real-time tasks
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
The Case for Hierarchical Schedulers with Performance Guarantees
The Case for Hierarchical Schedulers with Performance Guarantees
The implementation of hierarchical schedulers in the RED-Linux scheduling framework
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Scheduling within temporal partitions: response-time analysis and server design
Proceedings of the 4th ACM international conference on Embedded software
Analysis and optimization of distributed real-time embedded systems
Proceedings of the 41st annual Design Automation Conference
Combined approach to system level performance analysis of embedded systems
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
AADL modeling and analysis of hierarchical schedulers
Proceedings of the 2007 ACM international conference on SIGAda annual international conference
Analysis and optimisation of hierarchically scheduled multiprocessor embedded systems
International Journal of Parallel Programming - Special Issue on Multiprocessor-based embedded systems
Efficient implementation of tight response-times for tasks with offsets
Real-Time Systems
Improving fixed priority schedulability with dynamic priority as secondary criterion
Journal of Embedded Computing - Best Papers of RTS' 2005
Response time analysis of software transactional memory-based distributed real-time systems
Proceedings of the 2009 ACM symposium on Applied Computing
Implementation of the Ada 2005 Task Dispatching Model in MaRTE OS and GNAT
Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
Combining EDF and FP Scheduling: Analysis and Implementation in Ada 2005
Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
Temporal isolation with the ravenscar profile and Ada 2005
ACM SIGAda Ada Letters
Recovering from distributable thread failures in distributed real-time Java
ACM Transactions on Embedded Computing Systems (TECS)
Hierarchical scheduling with ada 2005
Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
Feasibility analysis of real-time transactions
Real-Time Systems
| Hi-index | 0.00 |
Hierarchical schedulers are getting increased attention inmany research projects because they bring in flexibility,they can take advantage of the best features of differentscheduling policies, and allow the composability of applicationsdeveloped under different scheduling strategies. Mostcommercial real-time operating systems have an underlyingfixed priority scheduler, and for this reason it is necessaryto be able to analyze hierarchically-scheduled applicationsin which the underlying scheduler is of that kind. In this paperwe extend the classic response time analysis techniquesto analyze applications which can have a mixture of tasksscheduled either with fixed priorities, or with an earliestdeadline first (EDF) scheduler running on top of an underlyingfixed priority scheduler. We show that the complexityof this analysis is similar to that of existing response timeanalysis for EDF tasks.