摘要：Problem statement: This study proposed two utility accrual real time scheduling algorithms named as Preemptive Utility Accrual Scheduling (PUAS) and Non-preemptive Utility Accrual Scheduling (NUAS) algorithms. These algorithms addressed the unnecessary abortion problem that was identified in the existing algorithm known as General Utility Scheduling (GUS). It is observed that GUS is inefficient for independent task model because it simply aborts any task that currently executing a resource with lower utility when a new task with higher utility requests the resource. The scheduling optimality criteria are based on maximizing accrued utility accumulated from execution of all tasks in the system. These criteria are named as Utility Accrual (UA). The UA scheduling algorithms are design for adaptive real time system environment where deadline misses are tolerable and do not have great consequences to the system. Approach: We eliminated the scheduling decision to abort a task in GUS and proposed to preempt a task instead of being aborted if the task is preemptive able. We compared the performances of these algorithms by using discrete event simulation. Results: The proposed PUAS algorithm achieved the highest accrued utility for the entire load range. This is followed by the NUAS and GUS algorithms. Conclusion: Simulation results revealed that the proposed algorithms were more efficient than the existing algorithm, producing with higher accrued utility ratio and less abortion ratio making it more suitable and efficient for real time application domain.
