By Topic

A near-optimal algorithm for scheduling soft-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

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

In this paper we propose a reasonably simple and near-optimal soft-aperiodic task scheduling algorithm in dynamic priority systems. The proposed algorithm has extended the EDF-CTI (Earliest Deadline First-Critical Task Indicating) Algorithm in such a way of modifying the slack calculation method which in turn reduces the computational complexity of slack calculation and resolves the unit scheduling problems. The paper also demonstrates near optimality of the algorithm. Our simulation study shows that the proposed algorithm, in most cases, is slightly better than the EDF-CTI algorithm in terms of short response time of aperiodic requests in a high workload

Published in:

Real-Time Systems, 1996., Proceedings of the Eighth Euromicro Workshop on

Date of Conference:

12-14 Jun 1996