@article {10.3844/jcssp.2012.1225.1234,
article_type = {journal},
title = {Performances of Partition Utility Accrual Real Time Scheduling Algorithm},
author = {Ahmad, Idawaty and Subramaniam, Shamala and Othman, Mohamed and Zulkarnain, Zuriati},
volume = {8},
number = {8},
year = {2012},
month = {Jul},
pages = {1225-1234},
doi = {10.3844/jcssp.2012.1225.1234},
url = {https://thescipub.com/abstract/jcssp.2012.1225.1234},
abstract = {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.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}