OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree
WSA '93 Proceedings of the Third International Workshop on Static Analysis
A New Kernel Approach for Modular Real-Time Systems Development
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
HLS: A Framework for Composing Soft Real-Time Schedulers
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Using hierarchical scheduling to support soft real-time applications in general-purpose operating systems
Capturing OS expertise in an event type system: the Bossa experience
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Vassal: loadable scheduler support for multi-policy scheduling
WINSYM'98 Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2
AADL modeling and analysis of hierarchical schedulers
Proceedings of the 2007 ACM international conference on SIGAda annual international conference
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Bossa nova: introducing modularity into the bossa domain-specific language
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Hi-index | 0.00 |
Standard operating systems provide only a single fixed scheduler, which does not meet all possible application scheduling needs. More flexibility can be achieved using a hierarchy of schedulers, allowing multiple schedulers to coexist in a single operating system (OS). Bossa is a framework for facilitating the implementation and deployment of OS process schedulers. In this paper, we describe the features of Bossa that enable the creation and management of a scheduling hierarchy. These features include a domain-specific language for implementing schedulers and a type system for describing requirements on scheduler behavior. The use of the domain-specific language eases scheduler development and enables scheduler verification. We have found that the approach allows programmers, even students who are not kernel or scheduling experts, to easily and safely implement and deploy schedulers that meet specific application needs.