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.