Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The assignment algorithms proposed by D. Towsley may not minimize the total communication and execution costs as stated. An example where the proposed restricted assignment algorithm fails to find an optimal assignment is given, and modifications that allow the algorithm to properly consider execution costs are proposed. Additional changes needed to model communication costs correctly in many assignment problems are discussed.