Scheduling Algorithms
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
A Framework for Simplifying the Development of Kernel Schedulers: Design and Performance Evaluation
HASE '05 Proceedings of the Ninth IEEE International Symposium on High-Assurance Systems Engineering
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
FlexSync: An aspect-oriented approach to Java synchronization
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
Making aspects natural: events and composition
Proceedings of the tenth international conference on Aspect-oriented software development
| Hi-index | 0.00 |
Schedulers decide when to execute what in a system. They often work in constrained environments, where these decisions have high impact on performance. Since schedulers should be designed according to a system's needs, it is imperative that scheduling requirements are well defined. Building a scheduler that satisfies these requirements is not a trivial task. In this position paper we present our initial work and ideas on a domain-specific framework for scheduling. We introduce our feature model of the problem space of scheduling and explain how it fits within a framework. Furthermore we present our ideas on how to make the scheduler framework modular by using an aspect oriented approach