Title :
An improved schedulability test for uniprocessor periodic task systems
Author :
Devi, UmaMaheswari C.
Author_Institution :
Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
Abstract :
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 that this test is more accurate than the commonly-used density condition. We also present and discuss the results 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.
Keywords :
algorithm theory; processor scheduling; real-time systems; task analysis; PPT testing; arbitrary deadline; asynchronous task system; density condition; linear-time testing; lock-free synchronization; optimal scheduling algorithm; preemptable task system; pseudopolynomial-time testing; relative deadline; resource contention; schedulability testing; uniprocessor periodic task system; Computer science; Costs; Delay; Gold; Optimal scheduling; Polynomials; Processor scheduling; Scheduling algorithm; Sequential analysis; System testing;
Conference_Titel :
Real-Time Systems, 2003. Proceedings. 15th Euromicro Conference on
Print_ISBN :
0-7695-1936-9
DOI :
10.1109/EMRTS.2003.1212723
