loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 IEEE Real-Time and Embedded Technology and Applications Symposium
Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems
April 22-April 24
ISBN: 978-0-7695-3146-5
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid scheduling algorithm is a generalization of both FP and EDF, and tends to retain most of the desirable properties and features of both individual policies. An exact (i.e., necessary and sufficient) test is derived for the preemptive uniprocessor scheduling of resource sharing sporadic task systems using this hybrid scheduling algorithm, with access to shared resources arbitrated using the Stack Resource Policy (SRP).
Citation:
Sanjoy Baruah, Nathan Fisher, "Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems," rtas, pp.248-257, 2008 IEEE Real-Time and Embedded Technology and Applications Symposium, 2008
Usage of this product signifies your acceptance of the Terms of Use.