Optimal processor assignment for a class of pipelined computations

A.N. Choudhary, B. Narahari, D.M. Nicol, R. Simha
1994 IEEE Transactions on Parallel and Distributed Systems  
We study the complexity of the problem of allocating m modules to n processors in a distributed system to minimize total communication and execution costs. When the communication graph is a tree, Bokhari has shown that the optimum allocation can be determined in O(mr?) time. Recently, this result has been generalized by FernBndez-Baca, who has proposed an allocation algorithm in O(mnk+') when the communication graph is a partial k-tree. We show that in the case where communication costs are
more » ... ation costs are uniform, the module allocation problem can be solved in O(mn) time if the communication graph is a tree. This algorithm is asymptotically optimum.
doi:10.1109/71.273050 fatcat:ksdmk4d3s5h3ndlfydnnhfcg5a