loading...
An Improved Schedulability Test for Uniprocessor Periodic Task Systems
Porto, Portugal July 02-July 04
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EMRTS.2003.121272315th Euromicro Conference on Real-Tim ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
UmaMaheswari C. Devi, University of North Carolina at Chapel Hill
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm. We show analytically and empirically that this test is more accurate than the commonly-used density condition. We also present and discuss the results of experiments that compare the accuracy and execution time of our test with that of a pseudo-polynomial-time schedulability test presented previously for a restricted class of task systems in which utilization is strictly less than one.
Citation:
UmaMaheswari C. Devi, "An Improved Schedulability Test for Uniprocessor Periodic Task Systems," ecrts, pp.23, 15th Euromicro Conference on Real-Time Systems (ECRTS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.