By Topic

On-line scheduling of hard 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
$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)
M. Dominic ; Ergo Software Syst. Ltd., Noida, India ; B. N. Jain

We consider the problem of on-line scheduling of a set of hard real-time tasks in an environment where future task parameters are not known a-priori. First, we derive necessary and sufficient conditions to determine whether a given set of tasks with known parameters is feasible using a set of m processors. Next, we consider two sets of tasks T0 and Tt where T0 is the set of tasks that need to be scheduled at time 0 such that any future task set Tt , t>0 can be scheduled with or without disturbing the schedule for T0. In this context, we derive necessary and sufficient conditions applicable to the schedule obtained for T0 at time 0 such that, any future task set Tt can be scheduled provided the task set T0∪Tt is feasible using m processors

Published in:

High Performance Computing, 1996. Proceedings. 3rd International Conference on

Date of Conference:

19-22 Dec 1996