Incremental schedulability analysis of hierarchical real-time components
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Synthesis of task and message activation models in real-time distributed automotive systems
Proceedings of the conference on Design, automation and test in Europe
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
ACM Transactions on Embedded Computing Systems (TECS)
Compositional real-time scheduling framework with periodic model
ACM Transactions on Embedded Computing Systems (TECS)
Compositional schedulability analysis for cyber-physical systems
ACM SIGBED Review - Special issue on the RTSS forum on deeply embedded real-time computing
Refining SIRAP with a dedicated resource ceiling for self-blocking
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Towards a time-triggered schedule calculation tool to support model-based embedded software design
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Learning early-stage platform dimensioning from late-stage timing verification
Proceedings of the Conference on Design, Automation and Test in Europe
Time-triggered buffers for event-based middleware systems
Innovations in Systems and Software Engineering
Implementation of compositional scheduling framework on virtualization
ACM SIGBED Review
Sharing resources among independently-developed systems on multi-cores
ACM SIGBED Review
A comparison of compositional schedulability analysis techniques for hierarchical real-time systems
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
The periodic resource model for hierarchical, compositional scheduling abstracts task groups by resource requirements. We study this model in the presence of dataflow constraints between the tasks within a group (intragroup dependencies), and between tasks in different groups (intergroup dependencies). We consider two natural semantics for dataflow constraints, namely, RTW (Real-Time Workshop) semantics and LET (logical execution time) semantics. We show that while RTW semantics offers better end-to-endlatency on the task group level, LET semantics allows tighter resource bounds in the abstraction hierarchy and therefore provides better composability properties. This result holds both for intragroup and intergroup dependencies, as well as for shared and for distributed resources.