A Survey on Scheduling Approaches for Hard Real-Time Systems

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 as energy consumption, dependability, performance, scheduling feasibility and utilization of memory resource. Finally, the analysis and evaluation of the mentioned methods are shown based on the schedulability of task sets and efficiency.

[1]  Marco Caccamo,et al.  Memory-centric scheduling for multicore hard real-time systems , 2012, Real-Time Systems.

[2]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[3]  Robert I. Davis.  A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems , 2014, SIGBED.

[4]  Hamid R. Zarandi,et al.  DFTS: A dynamic fault-tolerant scheduling for real-time tasks in multicore processors , 2014, Microprocess. Microsystems.

[5]  Alan Burns,et al.  A survey of hard real-time scheduling for multiprocessor systems , 2011, CSUR.

[6]  Wan Yeon Lee,et al.  Energy-Efficient Scheduling of Periodic Real-Time Tasks on Lightly Loaded Multicore Processors , 2012, IEEE Transactions on Parallel and Distributed Systems.

[7]  Tei-Wei Kuo,et al.  Energy-Efficient Scheduling of Periodic Real-Time Tasks over Homogeneous Multiprocessors , 2005 .

[8]  Wang Yi,et al.  Energy-efficient scheduling of real-time tasks on cluster-based multicores , 2011, 2011 Design, Automation & Test in Europe.

[9]  Petru Eles,et al.  Bus Access Optimization for Predictable Implementation of Real-Time Applications on Multiprocessor Systems-on-Chip , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[10]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[11]  Sanjoy K. Baruah,et al.  Partitioned EDF scheduling on a few types of unrelated multiprocessors , 2012, Real-Time Systems.

[12]  Mostafa E. Salehi,et al.  Fault tolerant task scheduling algorithm for multicore systems , 2014, 2014 22nd Iranian Conference on Electrical Engineering (ICEE).

[13]  Kalpana Manudhane,et al.  QoS-Aware Approaches to Real-Time task scheduling on Heterogeneous Clusters , 2013 .

[14]  Arezou Mohammadi,et al.  Scheduling Algorithms for Real-Time Systems , 2009 .

[15]  Rami G. Melhem,et al.  Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems , 1997, IEEE Trans. Parallel Distributed Syst..

[16]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[17]  Wolfgang A. Halang,et al.  An energy-aware dynamic scheduling algorithm for hard real-time systems , 2014, 2014 3rd Mediterranean Conference on Embedded Computing (MECO).

[18]  Chittaranjan Tripathy,et al.  Fault tolerant scheduling of hard real-time tasks on multiprocessor system using a hybrid genetic algorithm , 2014, Swarm Evol. Comput..