Performances of Partition Utility Accrual Real Time Scheduling Algorithm
Idawaty Ahmad, Shamala Subramaniam, Mohamed Othman and Zuriati Zulkarnain
DOI : 10.3844/jcssp.2012.1225.1234
Journal of Computer Science
Volume 8, Issue 8
Problem statement: This study proposed a TUF/UA real time scheduling algorithm known as Partition Preemptive Utility Accrual Scheduling (PUAS) also known as PPUAS algorithm. This algorithm addressed the overloaded problem that was identified in a uniprocessor scheduling environment and the necessity to design the scheduling algorithm in a multiprocessor environment. Approach: The PUAS algorithm was enhanced into the partitioned multiprocessor environment. The comparison of PUAS and PPUAS were made by using a discrete event simulation. Results: The proposed PUAS algorithm achieved a higher accrued utility for the entire load range as compared in the uniprocessor environment. Conclusion: Simulation results revealed that the proposed algorithms PPUAS are more efficient than the existing PUAS algorithm, producing a higher utility ratio and less abortion ratio making it suitable and efficient for real time application executed in multiprocessor environment.
© 2012 Idawaty Ahmad, Shamala Subramaniam, Mohamed Othman and Zuriati Zulkarnain. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.