By Topic

Implementation of Backward Recovery Mechanism in Preemptive Utility Accrual Real Time Scheduling Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ahmad, Idawaty ; Dept. of Commun. Technol. & Network, Univ. Putra Malaysia, Serdang, Malaysia ; Othman, Muhammad Fauzan

This paper proposed a robust algorithm named as Backward Recovery Preemptive Utility Accrual Scheduling (BRPUAS). The proposed algorithm solved the abortion problem in the existing TUF/UA scheduling paradigm known as ARPUAS that only considers the abortion recovery as their fault recovery solution. BRPUAS enables the re-execution of the affected tasks rather than abortion to reduce the number of aborted tasks. It ensures the correctness of the executed tasks in the best effort basis in such a way that the infeasible tasks are aborted and produced zero utility, while the feasible tasks are re-executed to produce positive utility and consequently maximizing the total accrued utility to the system. Simulation results revealed that the BRPUAS achieved higher accrued utility compared to the ARPUAS for the entire load range, making it more reliable and efficient for adaptive real time application domain.

Published in:

Network Applications Protocols and Services (NETAPPS), 2010 Second International Conference on

Date of Conference:

22-23 Sept. 2010