By Topic

Scheduling of hard-aperiodic requests in dynamic priority systems

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

3 Author(s)
Hyungill Kim ; Dept. of Comput. Eng., Kyung Hee Univ., Seoul, South Korea ; Sungyoung Lee ; Jongwon Lee

In this paper, we discuss the problem of jointly scheduling both hard deadline of periodic and aperiodic tasks in dynamic priority systems. The proposed scheduling scheme has extended the APS (Alternative Priority Scheduling) algorithm which is developed by the authors. The APS algorithm has a simple slack calculation method which in consequence makes it be practical. The paper develops an efficient acceptance test method for hard-aperiodic requests. The on-line acceptance test performs to determine whether the timing requirements of the arriving hard aperiodic tasks can be met while guaranteeing all the deadlines of periodic tasks and any already accepted but not yet completed aperiodic tasks

Published in:

Real-Time Computing Systems and Applications, 1996. Proceedings., Third International Workshop on

Date of Conference:

30 Oct-1 Nov 1996