This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comments on 'Allocating Programs Containing Branches and Loops Within a Multiple Processor System' by D. Towsley
April 1990 (vol. 16 no. 4)
pp. 471

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.

[1] D. Towsley, "Allocating programs containing branches and loops within a multiple processor system,"IEEE Trans. Software Eng., vol. SE-12, pp. 1018-1024, Oct. 1986.

Index Terms:
programs allocation; branches; loops; multiple processor system; assignment algorithms; operating systems (computers); scheduling.
Citation:
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. 4, pp. 471, April 1990, doi:10.1109/32.54298
Usage of this product signifies your acceptance of the Terms of Use.