TY  - JOUR
AU  - Ahmad, Idawaty 
AU  - Subramaniam, Shamala 
AU  - Othman, Mohamed 
AU  - Zulkarnain, Zuriati 
PY  - 2012
TI  - Performances of Partition Utility Accrual Real Time Scheduling Algorithm
JF  - Journal of Computer Science
VL  - 8
IS  - 8
DO  - 10.3844/jcssp.2012.1225.1234
UR  - https://thescipub.com/abstract/jcssp.2012.1225.1234
AB  - 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.