MMUF: An Optimized Scheduling Algorithm for Dynamically Reconfigurable Real-Time Systems

In this paper we compare our proposed hybrid scheduling algorithm which is a modification of Maximum Urgency First (MUF) scheduling algorithm with MUF scheduling algorithm. The maximum urgency first algorithm combines the advantages of fixed and dynamic scheduling to provide the dynamically changing systems with flexible scheduling. This algorithm, however, has a major shortcoming due to its scheduling mechanism which may cause a critical task to miss its deadline. The modified maximum urgency first scheduling algorithm resolves the mentioned problem. We have made a comparison between our proposed algorithm and maximum urgency first algorithm using simulation and results are presented. It is shown that modified maximum urgency first is superior to maximum urgency first, since it usually has less task preemption and hence, less related overhead. It also leads to less failed non-critical tasks in overloaded situations and leads to less average response time for tasks. Moreover, in most cases, MMUF better utilizes the CPU than MUF does.

[1]  D. B. Stewart,et al.  Real-time scheduling of dynamically reconfigurable systems , 1991, IEEE 1991 International Conference on Systems Engineering.

[2]  Mahmoud Naghibzadeh,et al.  Intelligent Rate-monotonic Scheduling Algorithm for Real-time Systems , 2022 .

[3]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

[4]  Seung-Min Yang,et al.  A Modified Least-Laxity-First scheduling algorithm for real-time tasks , 1998, Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236).

[5]  David B. Stewart,et al.  Real-Time Scheduling of Sensor-Based Control Systems , 1991 .

[6]  Douglas C. Schmidt,et al.  Dynamic scheduling strategies for avionics mission computing , 1998, 17th DASC. AIAA/IEEE/SAE. Digital Avionics Systems Conference. Proceedings (Cat. No.98CH36267).

[7]  Pradeep K. Khosla,et al.  Implementing real-time robotic systems using CHIMERA II , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[8]  Aloysius K. Mok,et al.  Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks , 1989, IEEE Trans. Software Eng..

[9]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[10]  Michel Jaring,et al.  Variability engineering as an integral part of the software product family development process , 2005 .

[11]  K. H. Kim,et al.  A modified version of rate-monotonic scheduling algorithm and its' efficiency assessment , 2002, Proceedings of the Seventh IEEE International Workshop on Object-Oriented Real-Time Dependable Systems. (WORDS 2002).

[12]  Joël Goossens,et al.  Overview of real-time scheduling problems , 2004 .

[13]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[14]  Mahmoud Naghibzadeh,et al.  A Modified Maximum Urgency First Scheduling Algorithm for Real-Time Tasks , 2005 .

[15]  Lui Sha,et al.  Solutions for Some Practical Problems in Prioritized Preemptive Scheduling , 1986, RTSS.