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

Scheduling directed task graphs on multiprocessors using simulated annealing

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)
Nanda, A.K. ; Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA ; DeGroot, D. ; Stenger, D.L.

Two algorithms based on simulated annealing for minimizing the schedule length of a directed task graph on a multiprocessor system are presented. The first algorithm uses the schedule length itself as the cost function to be minimized. The second algorithm uses an indirect cost function that minimizes the total communication overhead and the total loss of parallelism simultaneously. Implementation results indicate that the first algorithm is superior to the second one in terms of the schedule length it gives, but the second algorithm is superior to the first in terms of algorithm run time

Published in:

Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on

Date of Conference:

9-12 Jun 1992

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.