Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling

@article{Davis2009ExactQO,
  title={Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling},
  author={Robert I. Davis and Thomas Rothvo\ss and Sanjoy K. Baruah and Alan Burns},
  journal={Real-Time Systems},
  year={2009},
  volume={43},
  pages={211-258}
}
This paper examines the relative effectiveness of fixed priority pre-emptive scheduling in a uniprocessor system, compared to an optimal algorithm such as Earliest Deadline First (EDF). The quantitative metric used in this comparison is the processor speedup factor, equivalent to the factor by which processor speed needs to increase to ensure that any taskset that is schedulable according to an optimal scheduling algorithm can be scheduled using fixed priority pre-emptive scheduling, assuming… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks

2016 28th Euromicro Conference on Real-Time Systems (ECRTS) • 2016
View 1 Excerpt

56 Citations

051015'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Exact characterization and average case behaviour

C. L. Liu, J. W. Layland
In Proceedings of the IEEE Real-Time Systems Symposium, • 1973
View 15 Excerpts
Highly Influenced

Sustainable Scheduling Analysis

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) • 2006
View 2 Excerpts

“ Rate Monotonic Scheduling : The Hyperbolic Bound ”

E. Bini, C. ButtazzoG., M. ButtazzoG.
IEEE Transactions on Computers • 2003
View 1 Excerpt

Similar Papers

Loading similar papers…