Computing the Minimum EDF Feasible Deadline in Periodic Systems

@article{Bengtsson2006ComputingTM,
  title={Computing the Minimum EDF Feasible Deadline in Periodic Systems},
  author={Hoai Hoang Bengtsson and Giorgio C. Buttazzo and Magnus Jonsson and Stefan M. Karlsson},
  journal={12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)},
  year={2006},
  pages={125-134}
}
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requirements can be met by assigning suitable relative deadlines and guaranteeing the feasibility of the schedule. This paper presents a method (called minD) for calculating the minimum EDF-feasible deadline of a real-time task. More precisely, given a set of periodic tasks with hard real-time requirements, which is feasible… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS
31 Citations
22 References
Similar Papers

Citations

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

References

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

Similar Papers

Loading similar papers…