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

A Statistical Study of the Performance of a Task 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)
Bashir, A.F. ; Department of Electrical Engineering and Computer Science, University of Wisconsin ; Susarla, V. ; Vairavan, K.

In this note we report the results of an experimental investigation on the performance of the very simple level scheduling algorithm for unit time task systems. Although the problem of the construction of optimal k-processor schedules for unit time tasks is NP-complete, the experimental study suggests that this efficient linear time algorithm can produce optimal schedules most of the time in the sense that the probability of producing an optimal schedule using this efficient linear time algorithm is at least 0.9 for over 700 cases randomly constructed in our experiment.

Published in:

Computers, IEEE Transactions on  (Volume:C-32 ,  Issue: 8 )

Date of Publication:

Aug. 1983

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.