K-Priority Scheduling of Hard Real-Time Implicit-Deadline Periodic Task Systems on Uniprocessor

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/146464
Download file(s):
File Description SizeFormat 
146464.pdfFulltext982.9 kBAdobe PDFView/Open
Type: Examensarbete för masterexamen
Master Thesis
Title: K-Priority Scheduling of Hard Real-Time Implicit-Deadline Periodic Task Systems on Uniprocessor
Authors: Mensah, Gilbert
Abstract: The Rate Monotonic (RM) scheduling algorithm (static priority scheme) has an advantage in that it is simple to implement and incurs less run time overhead. It however has a disadvantage that it cannot guarantee 100% utilization of the processor for many tasks set having 100% tasks utilization. The earliest deadline first (EDF) scheduling algorithm (dynamic priority scheme) has a significant advantage in terms of processor utilization but increase in runtime overhead undermines this advantage. In this thesis, a dual priority algorithm is proposed. Each task has two static priorities – lower and upper band priorities with each priority band following the rate monotonic priority ordering. Initially each task executes with the lower band priority and promoted to the upper band priority after a particular (promotion point) time offset from the release of the task. We show by using simulation that 100% processor utilization is possible and our conjecture is that 100% processor utilization is possible.
Keywords: Information Technology;Informationsteknik
Issue Date: 2011
Publisher: Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
URI: https://hdl.handle.net/20.500.12380/146464
Collection:Examensarbeten för masterexamen // Master Theses



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.