By Topic

A new kind of real-time control scheduling algorithm

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
$33 $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)
Jian Song ; Coll. of Network Educ., Lanzhou Univ. of Technol., China ; Dong-Zhi He ; Wei Li

Many application specific operating systems based on system on chip are composed of lots of tasks that can generate multi-tasking using preemptive scheduling. Preemptive multi-tasking incurs high preemption switching overheads, and these costs may jeopardize the system schedulability. In this paper, a novel scheduling, named dynamic preemption threshold, is proposed. The scheduling can reduce preemption costs by thread assignment and changing task dynamic preemption threshold at runtime. Because dynamic preemption threshold is based on dynamic algorithm, it can achieve higher processor utilization with relative low costs in context switching and memory requirement. The scheduling perfectly integrates preemption threshold scheduling into EDF algorithm, and accomplishes to transform static model to dynamic algorithm seamlessly.

Published in:

Control, Automation, Robotics and Vision Conference, 2004. ICARCV 2004 8th  (Volume:3 )

Date of Conference:

6-9 Dec. 2004