Performances of Partition Utility Accrual Real Time Scheduling Algorithm | Science Publications

Journal of Computer Science

Shamala Subramaniam¹  Zuriati Zulkarnain¹  Mohamed Othman¹  Idawaty Ahmad¹ 

关键词: TUF/UA scheduling;    real time system;    partitioned;    multiprocessor;   

DOI  :  10.3844/jcssp.2012.1225.1234

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

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.

【 授权许可】

Unknown