By Topic

Bounds on the performance of heuristic algorithms for multiprocessor scheduling of hard real-time tasks

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)
Wang, F. ; Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA ; Ramamritham, K. ; Stankovic, J.A.

The authors analyze the performance of a heuristic algorithm, Hk, which tries to keep at least k processors busy, if possible. Hk combines the features of two known heuristic scheduling algorithms: list scheduling and the H scheduling algorithm. The authors analyze its schedule length bound for both uniform tasks, i.e. tasks with the same computation time, and nonuniform tasks, i.e. tasks with arbitrary computation times. When k=2, the time complexity of H is the same as the complexity of the H scheduling algorithm and list scheduling, which is O(n2r), where n is the number of tasks and r is the number of resources. Whereas the H scheduling algorithm has a poor schedule length bound but performs very well in finding feasible schedules, and list scheduling does not perform well in finding feasible schedules but has a good bound, the results show that H2 has both a good schedule length bound and performs well in finding feasible schedules

Published in:

Real-Time Systems Symposium, 1992

Date of Conference:

2-4 Dec 1992