The authors study the problem of scheduling precedence-related tasks on a sufficiently large number of processors to minimize the total execution time. Without communication delay between processors, this problem can be solved by using the critical path method. The authors consider the case when communication delay cannot be disregarded. An algorithm with time complexity O((1.52)n×
Published in:
Circuits and Systems, 1991., IEEE International Sympoisum on
Date of Conference: 11-14 Jun 1991