Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Comments on "Allocating programs containing branches and loops within a multiple processor system" by D. Towsley

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Kaudel, F. ; Dept of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada

The assignment algorithms proposed by D. Towsley (see ibid., vol.12, no.10, p.1018-24 (1986)) 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.<>

Published in:

Software Engineering, IEEE Transactions on  (Volume:16 ,  Issue: 4 )