The Community for Technology Leaders
Green Image
<p>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.</p>
programs allocation; branches; loops; multiple processor system; assignment algorithms; operating systems (computers); scheduling.
F. Kaudel, "Comments on 'Allocating Programs Containing Branches and Loops Within a Multiple Processor System' by D. Towsley", IEEE Transactions on Software Engineering, vol. 16, no. , pp. 471, April 1990, doi:10.1109/32.54298
98 ms
(Ver 3.3 (11022016))