Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
PAMR: A Process Algebra for the Management of Resources in Concurrent Systems
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
Timed Automata with Asynchronous Processes: Schedulability and Decidability
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Analysis of Hierar hical Fixed-Priority Scheduling
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Scheduling real-time applications in an open environment
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
A Framework for Scheduler Synthesis
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
Periodic Resource Model for Compositional Real-Time Guarantees
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Compositional Real-Time Scheduling Framework
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
An Interface Algebra for Real-Time Components
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Real-time interfaces for composing real-time systems
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Task automata: Schedulability, decidability and undecidability
Information and Computation
Compositional Analysis Framework Using EDP Resource Models
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
A process algebraic framework for modeling resource demand and supply
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
| Hi-index | 5.23 |
As real-time embedded systems become more complex, resource partitioning is increasingly used to guarantee real-time performance. Recently, several compositional frameworks of resource partitioning have been proposed using real-time scheduling theory with various notions of real-time tasks running under restricted resource supply environments. However, these real-time scheduling-based approaches are limited in their expressiveness in that, although capable of describing resource-demand tasks, they are unable to model resource supply. This paper describes a process algebraic framework PADSfor reasoning about resource demand and resource supply inspired by the timed process algebra ACSR. In ACSR, real-time tasks are specified by enunciating their consumption needs for resources. To also accommodate resource-supply processes in PADS, given a resource cpu, we write cpu@? to denote the availability of cpu for a requesting task process. Using PADS, we define a supply-demand relation where a pair (T,S) belongs to the relation if the demand process T can be scheduled under supply S. We develop a theory of compositional schedulability analysis as well as a technique for synthesizing an optimal supply process for a set of tasks. Furthermore, we define ordering relations between supplies which describe when a supply offers more resource capacity than another. With this notion it is possible to formally represent hierarchical scheduling approaches that assign more ''generous'' resource allocations to tasks in exchange for a simple representation. We illustrate our techniques via a number of examples.