A preemptive utility accrual scheduling algorithm in adaptive real time system.

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 [1]. These scheduling algorithms are designed for adaptive real time system environment where undesirable effects such as overl...

Full description

Bibliographic Details
Main Authors: Ahmad, Idawaty, Subramaniam, Shamala, Othman, Mohamed, Othman, Muhammad Fauzan
Format: Article
Language:English
English
Published: International Journal of Computer Science and Network Security 2008
Subjects:
Online Access:http://psasir.upm.edu.my/id/eprint/12783/1/A%20preemptive%20utility%20accrual%20scheduling%20algorithm%20in%20adaptive%20real%20time%20system.pdf
_version_ 1825945110050766848
author Ahmad, Idawaty
Subramaniam, Shamala
Othman, Mohamed
Othman, Muhammad Fauzan
author_facet Ahmad, Idawaty
Subramaniam, Shamala
Othman, Mohamed
Othman, Muhammad Fauzan
author_sort Ahmad, Idawaty
collection UPM
description 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 [1]. 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.
first_indexed 2024-03-06T07:26:24Z
format Article
id upm.eprints-12783
institution Universiti Putra Malaysia
language English
English
last_indexed 2024-03-06T07:26:24Z
publishDate 2008
publisher International Journal of Computer Science and Network Security
record_format dspace
spelling upm.eprints-127832015-12-07T07:21:13Z http://psasir.upm.edu.my/id/eprint/12783/ A preemptive utility accrual scheduling algorithm in adaptive real time system. Ahmad, Idawaty Subramaniam, Shamala Othman, Mohamed Othman, Muhammad Fauzan 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 [1]. 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. International Journal of Computer Science and Network Security 2008 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/12783/1/A%20preemptive%20utility%20accrual%20scheduling%20algorithm%20in%20adaptive%20real%20time%20system.pdf 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 Real-time data processing - Management. Information technology - Management. Computer algorithms. English
spellingShingle Real-time data processing - Management.
Information technology - Management.
Computer algorithms.
Ahmad, Idawaty
Subramaniam, Shamala
Othman, Mohamed
Othman, Muhammad Fauzan
A preemptive utility accrual scheduling algorithm in adaptive real time system.
title A preemptive utility accrual scheduling algorithm in adaptive real time system.
title_full A preemptive utility accrual scheduling algorithm in adaptive real time system.
title_fullStr A preemptive utility accrual scheduling algorithm in adaptive real time system.
title_full_unstemmed A preemptive utility accrual scheduling algorithm in adaptive real time system.
title_short A preemptive utility accrual scheduling algorithm in adaptive real time system.
title_sort preemptive utility accrual scheduling algorithm in adaptive real time system
topic Real-time data processing - Management.
Information technology - Management.
Computer algorithms.
url http://psasir.upm.edu.my/id/eprint/12783/1/A%20preemptive%20utility%20accrual%20scheduling%20algorithm%20in%20adaptive%20real%20time%20system.pdf
work_keys_str_mv AT ahmadidawaty apreemptiveutilityaccrualschedulingalgorithminadaptiverealtimesystem
AT subramaniamshamala apreemptiveutilityaccrualschedulingalgorithminadaptiverealtimesystem
AT othmanmohamed apreemptiveutilityaccrualschedulingalgorithminadaptiverealtimesystem
AT othmanmuhammadfauzan apreemptiveutilityaccrualschedulingalgorithminadaptiverealtimesystem
AT ahmadidawaty preemptiveutilityaccrualschedulingalgorithminadaptiverealtimesystem
AT subramaniamshamala preemptiveutilityaccrualschedulingalgorithminadaptiverealtimesystem
AT othmanmohamed preemptiveutilityaccrualschedulingalgorithminadaptiverealtimesystem
AT othmanmuhammadfauzan preemptiveutilityaccrualschedulingalgorithminadaptiverealtimesystem