Ahmad, Idawaty and Subramaniam, Shamala and Othman, Mohamed and Othman, Muhammad Fauzan (2008) A preemptive utility accrual scheduling algorithm in adaptive real time system. International Journal of Computer Science and Network Security, 8 (5). pp. 57-61. ISSN 1738-7906
Full text not available from this repository.
In this paper, we propose a preemptive utility accrual scheduling(or PUAS) algorithm as an enhancement to General Utility Scheduling ( or GUS) algorithm proposed by Peng Li . These scheduling algorithms are designed for adaptive real time system environment where undesirable effects such as overload and deadline misses are tolerable. We consider independent task models that are subject to deadline constraints specified using step time/utility functions (or TUFs). The basic idea of our algorithm is to reduce the number of unnecessary abortion that occurs in GUS by preemption instead of abortion. We consider the scheduling objective of maximizing the utility that is accrued by the completion of all tasks. Simulation results revealed that the proposed algorithm outperforms GUS algorithm. By reducing the total number of task aborted together with lower abortion ratio, this in effect produced a higher utility and reduced the average response time, making it more suitable and efficient in time-critical application domain.
|Keyword:||Real time system; Utility Accrual Scheduling; Time/Utility Function|
|Subject:||Real-time data processing - Management.|
|Subject:||Information technology - Management.|
|Faculty or Institute:||Faculty of Computer Science and Information Technology|
|Publisher:||International Journal of Computer Science and Network Security|
|Deposited By:||Umikalthom Abdullah|
|Deposited On:||25 Jan 2012 04:43|
|Last Modified:||25 Jan 2012 04:43|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 25 Jan 2012 04:43.