By Topic

Design and Evaluation of Sectional Real-Time Scheduling Algorithms Based on System Load

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)
Wanfu Ding ; Grad. Univ. of Chinese Acad. of Sci., Beijing ; Ruifeng Guo

The real-time scheduling algorithms play an important role in real-time systems. Whether or not the real-time tasks could be completed within the specified deadline mainly relies on scheduling algorithms. This article proposes a sectional real-time scheduling algorithm called SS (sectional scheduling), and this algorithm divides the system load into three cases according to the intension of system load: normal load, overload and serious overload. Every case utilizes a different algorithm. The experimental results show that this algorithm could improve real-time system performance remarkably compared to the classical EDF (earliest deadline first), HVF (highest value first) and HVDF (highest value density first) algorithms under all workload conditions.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008