An extendible approach for analyzing fixed priority hard real-time tasks

  title={An extendible approach for analyzing fixed priority hard real-time tasks},
  author={Ken Tindell and Alan Burns and Andy J. Wellings},
  journal={Real-Time Systems},
As the real-time computing industry moves away from static cyclic executive-based scheduling towards more flexible process-based scheduling, so it is important for current scheduling analysis techniques to advance and to address more realistic application areas. This paper extends the current analysis associated with static priority pre-emptive based scheduling; in particular it derives analysis for tasks with arbitrary deadlines that may suffer release jitter due to being dispatched by a tick… CONTINUE READING
Highly Influential
This paper has highly influenced 30 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 335 citations. REVIEW CITATIONS
237 Citations
17 References
Similar Papers


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

335 Citations

Citations per Year
Semantic Scholar estimates that this publication has 335 citations based on the available data.

See our FAQ for additional information.


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

Timings of Run-time Operations in Modified York Ada,

  • A. D. Hutcheon
  • Task 8 Volume C, Deliverable on ESTEC Contract…
  • 1992
Highly Influential
7 Excerpts

Using Offset Information to Analyse Static Priority Pre-Emptively Scheduled Task Sets,

  • K. Tindell
  • Dept of Computer Science,
  • 1992

Mesler, “Building a Predictable Avionics Platform in Ada: A Case Study,

  • C. D. Locke, T.J.D.R. Vogel
  • Proceedings of the 12th Real Time Systems…
  • 1991
2 Excerpts

Similar Papers

Loading similar papers…