Extension of Stone´s task assignment model for distributed computer systems

The authors consider optimal static assignment of a group of communicating tasks among a set of processors. The assignment is based on the throughput metric optimality criteria by H.S. Stone (1977) which is the total cost for execution and interprocess communication. Stone´s model is generalized with the addition of an important factor called processor connectivity. The scheme is necessary in situations where the processors need not exhibit full connectivity. It is shown that a graph-theoretic approach similar to that proposed by C.C. Shen and W.H. Tsai (1985) for a delay metric can be used to solve the ensuing problem and it is found empirically that the procedure is computationally more efficient for the throughput metric