The limited-preemption uniprocessor scheduling of sporadic task systems

@article{Baruah2005TheLU,
  title={The limited-preemption uniprocessor scheduling of sporadic task systems},
  author={Sanjoy K. Baruah},
  journal={17th Euromicro Conference on Real-Time Systems (ECRTS'05)},
  year={2005},
  pages={137-144}
}
Although preemptive uniprocessor scheduling algorithms are able to successfully schedule some systems that cannot be scheduled by any non-preemptive scheduling algorithm, the run-time overhead associated with implementing preemptive algorithms is often higher than for non-preemptive algorithms. In choosing between preemptive and non-preemptive scheduling algorithms on uniprocessors, the tradeoff is therefore between enhanced feasibility on the one hand, and increased overheads on the other… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 95 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
71 Extracted Citations
0 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 71 extracted citations

95 Citations

051015'07'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 95 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…