By Topic

A novel dynamic fuzzy threshold preemption scheduling algorithm for soft real-time 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

2 Author(s)
Wei Ba ; Dalian Univ. of Technol., Dalian ; Dabo Zhang

In the context of least slack first scheduling, switching may frequently be caused. The extra overheads of preemptions among tasks debase the performance of soft real-time systems significantly. In this paper, we present a novel scheduling algorithm, named dynamic fuzzy threshold least slack first (DFTLSF) scheduling, which solved the switching problem when use least slack first scheduling algorithm in tasks. The notion of dynamic fuzzy threshold coefficient was defined to fuzzy the threshold dynamically. The slack time of the running task is reduced to its fuzzy threshold to avoid thrashing. Comparing to the traditional least slack first scheduling algorithm, the simulation results show that, the dynamic fuzzy preemption make the switching number of the novel algorithm smaller and the missed deadline percentage decreased.

Published in:

Decision and Control, 2007 46th IEEE Conference on

Date of Conference:

12-14 Dec. 2007