By Topic

Analysis and Improvement of Scheduling Algorithms Based on (m, k)-Firm Constraint

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

2 Author(s)
Lanying Li ; Sch. of Comput. Sci. & Technol., Harbin Univ. of Sci. & Technol., Harbin, China ; Yu Tan

On the basis of the definition of WHRT (weakly hard real-time), this paper summarizes the constraint qualifications of the existing WHRT and scheduling algorithms, places emphasis on the discussion of DBP algorithm and E-DBP algorithm, proposes two concepts according to the deficiencies of the two algorithms, namely total distance of entering invalidation and total distance of aborting invalidation, presents the distance calculation equation, develops TDBP(total distance based priority) algorithm and extends the priority setting methods of DBP and E-DBP further more which solve the problem of the 01 state distributing information ignored in both algorithms. The simulation results indicate that TDBP has reduced the rate of dynamic invalidation and increased the performance of the system, and it also makes the number of received packets in each terminal close to average value.

Published in:

Computer Science and Computational Technology, 2008. ISCSCT '08. International Symposium on  (Volume:2 )

Date of Conference:

20-22 Dec. 2008