The Community for Technology Leaders
Green Image
<p>Studies the complexity of the problem of allocating m modules to n processors in adistributed system to minimize total communication and execution costs. When thecommunication graph is a tree, Bokhari has shown that the optimum allocation can bedetermined in O(mn/sup 2/) time. Recently, this result has been generalized byFernandez-Baca, who has proposed an allocation algorithm in O(mn/sup k+1/) when thecommunication graph is a partial k-tree. The author shows that in the case wherecommunication 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.</p>
Index Termscomputational complexity; distributed processing; tree data structures; resource allocation; parallel programming; tree structured programs; distributed system; communication costs; complexity; communication graph; computer network; optimization; task allocation
A. Billionnet, "Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs", IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 445-448, April 1994, doi:10.1109/71.273051
88 ms
(Ver 3.3 (11022016))