Research Article Open Access

Performances of Partition Utility Accrual Real Time Scheduling Algorithm

Idawaty Ahmad1, Shamala Subramaniam1, Mohamed Othman1 and Zuriati Zulkarnain1
  • 1 University Putra Malaysia, Malaysia
Journal of Computer Science
Volume 8 No. 8, 2012, 1225-1234

DOI: https://doi.org/10.3844/jcssp.2012.1225.1234

Submitted On: 15 March 2012 Published On: 12 July 2012

How to Cite: Ahmad, I., Subramaniam, S., Othman, M. & Zulkarnain, Z. (2012). Performances of Partition Utility Accrual Real Time Scheduling Algorithm. Journal of Computer Science, 8(8), 1225-1234. https://doi.org/10.3844/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.

  • 1,081 Views
  • 1,327 Downloads
  • 0 Citations

Download

Keywords

  • TUF/UA scheduling
  • real time system
  • partitioned
  • multiprocessor