Paper Info
Title
Optimal task assignment with precedence in distributed computing systems
Abstract
We consider the problem of finding an optimal assignment of task modules with precedence relationships in a distributed system. The existing approaches cannot guarantee an optimal solution in some cases. We illustrate this situation and propose a new optimal assignment method. Module execution and intermodule communication are considered separately. They are completely scheduled. The state-space technique is applied to search the optimal solution. An underestimation function is used in order to speed up the search. The complexity and effectiveness of the algorithm are discussed. Examination via examples shows our method is feasible.
Year
DOI
Venue
1994
10.1016/0020-0255(94)90017-5
Information Sciences
DocType
Volume
Issue
Journal
78
1-2
ISSN
Citations 
PageRank 
0020-0255
3
0.42
References 
Authors
12
1
Name
Order
Citations
PageRank
Jin-Cherng Lin113616.88