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

Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform 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)
Cucu, L. ; Univ. Libre de Bruxelles ; Goossens, J.

In this paper we study the global scheduling of periodic task systems upon uniform multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor one: (i) under few and not so restrictive assumptions, we show that any feasible schedules of periodic task system are periodic from some point and (ii) for the specific case of synchronous periodic task systems, we show that the schedule repeats from the origin. We then present our main result: any feasible schedules of asynchronous periodic task sets using a fixed-priority scheduler are periodic from a specific point. Moreover, we characterize that point and we provide a feasibility interval for those systems.

Published in:

Emerging Technologies and Factory Automation, 2006. ETFA '06. IEEE Conference on

Date of Conference:

20-22 Sept. 2006

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.