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

Hybrid-priority Scheduling of Resource-Sharing Sporadic Task 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)
Baruah, S. ; North Carolina Univ. - Chapel Hill, Chapel Hill, NC ; Fisher, N.

A hybrid scheduling algorithm is proposed, which integrates features of the fixed priority (FP) and earliest deadline first (EDF) scheduling policies. It is shown that this hybrid scheduling algorithm is a generalization of both FP and EDF, and tends to retain most of the desirable properties and features of both individual policies. An exact (i.e., necessary and sufficient) test is derived for the preemptive uniprocessor scheduling of resource- sharing sporadic task systems using this hybrid scheduling algorithm, with access to shared resources arbitrated using the stack resource policy (SRP).

Published in:

Real-Time and Embedded Technology and Applications Symposium, 2008. RTAS '08. IEEE

Date of Conference:

22-24 April 2008

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.