Show simple item record

dc.contributor.authorAtlas, Aliaen_US
dc.contributor.authorBestavros, Azeren_US
dc.date.accessioned2011-10-20T05:07:34Z
dc.date.available2011-10-20T05:07:34Z
dc.date.issued1998-09-02en_US
dc.identifier.citationAtlas, Alia; Bestavros, Azer. "Design and Implementation of SRMS in Kurt Linux", Technical Report BUCS-1998-013, Computer Science Department, Boston University, September 2, 1998. [Available from: http://hdl.handle.net/2144/1769]en_US
dc.identifier.urihttp://hdl.handle.net/2144/1769
dc.description.abstractStatistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could be smoothed through aggregation to yield guaranteed QoS. This aggregation is done over time for a given task and across multiple tasks for a given period of time. Similar to RMS, SRMS has two components: a feasibility test and a scheduling algorithm. SRMS feasibility test ensures that it is possible for a given periodic task set to share a given resource without violating any of the statistical QoS constraints imposed on each task in the set. The SRMS scheduling algorithm consists of two parts: a job admission controller and a scheduler. The SRMS scheduler is a simple, preemptive, fixed-priority scheduler. The SRMS job admission controller manages the QoS delivered to the various tasks through admit/reject and priority assignment decisions. In particular, it ensures the important property of task isolation, whereby tasks do not infringe on each other. In this paper we present the design and implementation of SRMS within the KURT Linux Operating System [HSPN98, SPH 98, Sri98]. KURT Linux supports conventional tasks as well as real-time tasks. It provides a mechanism for transitioning from normal Linux scheduling to a mixed scheduling of conventional and real-time tasks, and to a focused mode where only real-time tasks are scheduled. We overview the technical issues that we had to overcome in order to integrate SRMS into KURT Linux and present the API we have developed for scheduling periodic real-time tasks using SRMS.en_US
dc.description.sponsorshipNational Science Foundation (CCR-9706685)en_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-1998-013en_US
dc.subjectReal-time computing and communicationen_US
dc.subjectScheduling algorithms and analysisen_US
dc.subjectAdmission controlen_US
dc.subjectProbabilistic analysisen_US
dc.subjectQuality of Service (QoS) managementen_US
dc.subjectOperating systemsen_US
dc.subjectLinuxen_US
dc.titleDesign and Implementation of Statistical Rate Monotonic Scheduling in KURT Linuxen_US
dc.typeTechnical Reporten_US


Files in this item

This item appears in the following Collection(s)

Show simple item record