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

Guaranteed Scheduling for (m,k)-firm Deadline-Constrained Real-Time Tasks on Multiprocessors

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)
Yeonhwa Kong ; Dept. of Comput. & Inf. Sci., Korea Univ., Seoul, South Korea ; Hyeonjoong Cho

We present a guaranteed real-time scheduling algorithm for multiple real-time tasks subject to (m,k)-firm deadlines on homogeneous multiprocessors. The scheduling objective of the proposed algorithm is to provide guaranteed performance by bounding the probability of missing (m,k)-firm deadline constraints while improving the probability of deadline satisfactions as much as possible. This goal is established to satisfy the minimum requirements expressed by (m,k)-firm deadlines and simultaneously provide the best possible quality of service. We analytically establish that the proposed algorithm provides assurance on the bounded probability of missing (m,k)-firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed scheme in achieving our scheduling objective.

Published in:

Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2011 12th International Conference on

Date of Conference:

20-22 Oct. 2011

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.