This Article 
 Bibliographic References 
 Add to: 
Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs
April 1994 (vol. 5 no. 4)
pp. 445-448

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.

[1] A. Billionnet, M. C. Costa, and A. Sutter, "les problèmes de placement dans les systèmes distribués,"Technique et Science Informatique, vol. 8, no. 3, pp. 307-337.
[2] A. Billionnet, M. C. Costa, and A. Sutter, "An efficient algorithm for a task allocation problem,"J. ACM, vol. 39, pp. 502-518, July 1992.
[3] S. H. Bokhari, "A shortest tree algorithm for optimal assignments across space and time in a distributed processor system,"IEEE Trans. Software Eng., vol. SE-7, no. 6, pp. 583-589, June 1981.
[4] S. H. Bokhari,Assignment Problems in Parallel and Distributed Computing. Boston, MA: Kluwer Academic, 1987.
[5] W. W. Chu, L. J. Holloway, M. Lan, and K. Efe, "Task allocation in distributed data processing,"Computer, pp. 57-69, Nov. 1980.
[6] K. Efe, "Heuristic models of task assignment scheduling in distributed systems,"Computer, vol. 15, pp. 50-56, 1982.
[7] D. Fernández-Baca, "Allocating modules to processors in a distributed system,"IEEE Trans. Software Eng., vol. SE-15, pp. 1427-1436, Nov. 1989.
[8] D. Fernández-Baca and A. Medepalli, "Approximation Algorithms for certains assignment problems in distributed systems," Tech. Rep. 91-17, Dept. of Comput. Sci., Iowa State Univ., Iowa City, IA, 1991.
[9] A. Gabrielian and D. B. Tyler, "Optimal object allocation in distributed computing system,"Proc. Int. Conf. Distribut. Computing Syst., 1984, pp. 88-95.
[10] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[11] V. M. Lo, "Heuristic algorithms for task assignment in distributed systems,"IEEE Trans. Comput., vol. C-37, no. 11, pp. 1384-1397, Nov. 1988.
[12] P. R. Ma, E. Y. S. Lee, and M. Tsuchiga, "A task allocation model for distributed computing systems,"IEEE Trans. Comput., vol. C-31, no. 1, pp. 41-47, Jan. 1982.
[13] C. C. Price and S. Krishnaprasad, "Software allocation models for distributed computing systems,"Proc. Int. Conf. Distribut. Computing Syst., 1984, pp. 40-48.
[14] G. S. Rao, H. S. Stone, and T. C. Hu, "Assignment of tasks in a distributed processor system with limited memory,"IEEE Trans. Comput.vol. C-28, no. 4, pp. 291-299, Apr. 1979.
[15] J. B. Sinclair, "Efficient computation of optimal assignments for distributed tasks,"J. Parallel Distributed Comput., vol. 4, pp. 342-362, 1987.
[16] H. Stone, "Multiprocessor scheduling with the aid of network flow algorithms,"IEEE Trans. Software Eng., vol. SE-3, pp. 85-94, 1977.
[17] H. Stone, "Critical load factors in two processors distributed systems,"IEEE Trans. Software Eng., vol. SE-4, pp. 254-258, 1978.
[18] 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:
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 and Distributed Systems, vol. 5, no. 4, pp. 445-448, April 1994, doi:10.1109/71.273051
Usage of this product signifies your acceptance of the Terms of Use.