AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION
Honbo Zhou · International Journal of Parallel Emergent and Distributed Systems · 1994
In this study, we introduce the weak precedence constrained (WPC) problem and present a two-stage approach for its allocation in a homogenous distributed architecture. The performance of the two-stage algorithm is compared with that of a simulated annealing algorithm through experimental results. The two-stage algorithms outperform the simulated annealing algorithm significantly based on a given performance measure. A detailed description of the two-stage approach proposed in [22] is given here.