Referenced Items are not available for this document.
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
- Page(s):
- 20 - 27
- Meeting Date :
- 09 Jun 1992-12 Jun 1992
- Print ISBN:
- 0-8186-2865-0
- INSPEC Accession Number:
- 4463285
- Conference Location :
- Yokohama
- Digital Object Identifier :
- 10.1109/ICDCS.1992.235059
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
