Cart (Loading....) | Create Account
Close category search window

Extended Empty-Slots method for fixed priority feasibility analysis

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)
Li Jin ; Missile Inst., Air Force Eng. Univ., Sanyuan, China ; Min-Allah, N. ; Jian-Sheng Xing ; Xiu-Li Wang

For preemptive scheduling, the discrete scheduling has the same capability as the continuous scheduling. However, most work previously done has been focused on the continuous scheduling. In this paper, a discrete analysis approach Empty-Slots method is discussed and applied to fixed priority scheduling for constraint-deadline task model. Then a new schedulability test using the Empty-Slots method is presented. Compared with classical schedulability tests for continuous scheduling, this test is more convenient to be used and more efficient to tackle practical problems.

Published in:

Computer Engineering and Technology (ICCET), 2010 2nd International Conference on  (Volume:7 )

Date of Conference:

16-18 April 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.