Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ECRTS
2003
IEEE

favoriteEmaildiscussreport

96views Embedded Systems» more ECRTS 2003»

An Improved Schedulability Test for Uniprocessor Periodic Task Systems

13 years 9 months ago

An Improved Schedulability Test for Uniprocessor Periodic Task Systems

Download www.cse.unl.edu

We present a sufﬁcient 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 commonlyused 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-timeschedulability test presented previously for a restricted class of task systems in which utilization is strictly less than one.

UmaMaheswari C. Devi

Real-time Traffic

Arbitrary Relative Deadlines | ECRTS 2003 | Linear-time Schedulability Test | Task Systems |

claim paper

Related Content

» StaticPriority Periodic Scheduling on Multiprocessors

» Uniprocessor EDF Feasibility is an Integer Problem

» FaultTolerant RateMonotonic Scheduling Algorithm in Uniprocessor Embedded Systems

» Algorithms and Complexity for Periodic RealTime Scheduling

» Scheduling of Hard Aperiodic Tasks in Hybrid StaticDynamic Priority Systems

» Minimum Deadline Calculation for Periodic RealTime Tasks in Dynamic Priority Systems

» An approach to task attribute assignment for uniprocessor systems

» Improvements in PolynomialTime Feasibility Testing for EDF

» Optimal deadline assignment for periodic realtime tasks in dynamic priority systems

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	ECRTS
Authors	UmaMaheswari C. Devi

Comments (0)