A Survey on Scheduling Approaches for Hard Real-Time Systems

@inproceedings{Rouhifar2015ASO,
  title={A Survey on Scheduling Approaches for Hard Real-Time Systems},
  author={Mehrin Rouhifar and Reza Ravanmehr},
  year={2015}
}
In this paper, main scheduling algorithms for hard real-time systems (RTSs) have been investigated that include both uni and multi processors schemes. It provides the summary of schedulability analysis and well-known attributes. This paper composed of two parts; first part surveyed the basic hard RTS scheduling algorithms that guarantee the on-time completion of the tasks. Second part contains the different heuristic and partitioned approaches for some specific factors of real-time systems such… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Fault tolerant task scheduling algorithm for multicore systems

  • 2014 22nd Iranian Conference on Electrical Engineering (ICEE)
  • 2014

and A

K. Hoube
  • Halan, “An Energy-Aware Dynamic Scheduling Algorithm for Hard Real-Time Systems”, 3rd Mediterranean Conference on Embedded Computing, MECO –
  • 2014

A Review of Fixed Priority and EDF Scheduling for Hard 1 / 3 A Survey on Scheduling Approaches for Hard Real-Time Systems Real-Time

I Robert, R Davis, A Burns
  • Uniprocessor Systems”,
  • 2013