Semantics of Modechart in real time logic
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Linux Journal
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Middleware for Distributed Industrial Real-Time Systems on ATM Networks
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A New Kernel Approach for Modular Real-Time Systems Development
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Handling Aperiodic Tasks in Diverse Real-Time Systems via Plug-Ins
ISORC '02 Proceedings of the Fifth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Translating Off-Line Schedules into Task Attributes for Fixed Priority Scheduling
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
| Hi-index | 0.00 |
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic paradigm, intertwined in the kernel architecture. Thus, scheduling services come in packages around single paradigms, fixed to a certain methodology and kernel architecture. Temporal constraints of applications are addressed by a combination of scheduler and system architecture. Consequently, changing system architecture results in a complete rescheduling of all tasks, calling for a new cycle of analysis and testing from scratch, although a schedule meeting all temporal constraints already existed. We propose a component based architecture for schedule reuse. Instead of tying temporal constraints, scheduler, and system architecture together, we provide methods which allow for the reuse of existing schedules on various system architectures. In particular, we show how a schedule developed for table driven, dynamic or static priority paradigm can be reused in the other schemes. We address an architecture to disentangle actual scheduling from dispatching and other kernel routines with a small interface, suited for a variety of scheduling schemes as components.