Extended empty-slots method for fixed priority feasibility analysis
conference paper
For preemptive scheduling, the discrete scheduling has the same capability as the continuous scheduling. However, most work previously done has been focused on the continuous scheduling. In this paper, a discrete analysis approach EmptySlots method is discussed and applied to fixed priority scheduling for constraint-deadline task model. Then a new schedulability test using the Empty-Slots method is presented.
Compared with classical schedulability tests for continuous scheduling, this test is more convenient to be used and more efficient to tackle practical problems.
Compared with classical schedulability tests for continuous scheduling, this test is more convenient to be used and more efficient to tackle practical problems.
Topics
TNO Identifier
954154
ISBN
9781424463503
Publisher
IEEE
Article nr.
5485295
Source title
2nd International Conference on Computer Engineering and Technology, ICCET 2010, 16 April 2010 through 18 April 2010
Files
To receive the publication files, please send an e-mail request to TNO Repository.