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

Estimating the Number of Processors towards an Efficient Non-preemptive Scheduling Algorithm

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

3 Author(s)
Andrei, S. ; Dept. of Comput. Sci., Lamar Univ., Beaumont, TX, USA ; Cheng, A.M.K. ; Radulescu, V.

Given a task set T, finding a feasible schedule for T is one of the most significant problems of real time embedded systems. The research community has found a lot of important results for the scheduling problem on both uniprocessor and multiprocessor platforms. To the best of our knowledge, there is still room for research in determining the number of processors for a given task set, where each task is specified by its starting time, computation time, and deadline. The present paper describes an improved lower bound on the number of processors that allows a feasible schedule for a single-instance, non-preemptive, and independent task set T. In addition, an efficient algorithm is described, in order to achieve a feasible schedule for T for the real-time system with the number of processors equal to the lower bound previously determined. Both the above facts are extensions of the results presented in a previous work. Among many improvements, one of the main differences consists in considering the start times of the tasks when defining the task set, hence by allowing the considered model to cover more practical situations.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on

Date of Conference:

26-29 Sept. 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.