By Topic

An Algorithm for Scheduling Aperiodic Real-Time Tasks on a Static Schedule

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)
Jin-Yong Yin ; Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China ; Guo-Chang Guo

In many real-time systems, there are not only periodic real-time tasks, but also aperiodic real-time tasks arising from arbitrary critical events. In this paper, we propose an algorithm (SATSS, Schedule Aperiodic Tasks on a Static Schedule) scheduling both periodic real-time tasks and aperiodic real-time tasks. This algorithm first produces a schedule which consists of only periodic tasks before the system is started and schedules aperiodic tasks on the static schedule on run time. It can guarantee all accepted tasks' deadlines by testing the schedulability of aperiodic tasks in a busy period consisting of not only the running tasks but also the periodic tasks in future. Experimental results show that the algorithm is effective.

Published in:

Information and Computing Science, 2009. ICIC '09. Second International Conference on  (Volume:1 )

Date of Conference:

21-22 May 2009