Theoretical Computer Science
Aperiodic servers in a deadline scheduling environment
Real-Time Systems
Efficient Scheduling of Real-Time Multi-Task Applications in Dynamic Systems
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the 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
Design Space Exploration and System Optimization with SymTA/S " Symbolic Timing Analysis for Systems
RTSS '04 Proceedings of the 25th 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
CoMPSoC: A template for composable and predictable multi-processor system on chips
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Demand bound server: generalized resource reservation for hard real-time systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
| Hi-index | 0.00 |
Composability and compositionality are well recognised as key enablers in rigorous design and analysis of complex systems. We argue that existing work on these enablers, specific to real-time systems, has exclusively focussed on design and analysis of structural composition, by which we refer to composition of either separate software tasks or compositions thereof on a shared platform such as a processor. Though structural composition is common and likely the most useful such composition, we make the case of an altogether different kind of composition which we refer to as behavioural composition. As a specific example of behavioural composition, we discuss how to constructively build complex server algorithms, called Demand Bound Servers (DBS), by composing constituent simpler server algorithms, even hierarchically. As a result of such composition, we can build server algorithms to more tightly match the requirements of tasks they need to serve, which indeed is not possible with the simpler components themselves. This is an example of how new behaviour is emergent out of the composition. We remain curious if there are other such examples of behavioural composition of interest to real-time systems.