Abstract
A common approach to the problem of assigning the tasks of a modular program to the processors of a distributed system relies on its close relation with the multiway cut problem in graphs. All known algorithms exploiting this relation aim to reduce the problem size by extracting partial solutions, using network flow methods. However, for large sized problems, such reductions tend to become useless. In this paper network flow methods are exploited in a different vein and a simple polynomial heuristic algorithm, which exhibits satisfactory computational behavior, is presented.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. G. Abraham and E. S. Davidson, Task assignment using network flow methods for minimizing communication in n-processor systems, Center for Supercomp. Res. Develop., Tech. Rep. 598 (1986).
D. Fernádez-Baca, Allocating modules to processors in a distributed system, IEEE Trans. Soft. Eng. SE-15 (1989) 1427–1436.
A. Billionnet, M. C. Costa and A.Sutter, An efficient algorithm for a task allocation problem, J.ACM 39 (1992) 502–518.
S. H. Bokhari, A shortest tree algorithm for optimal assignments across space and time in a distributed processor system, IEEE Trans. Soft. Eng. SE-7 (1981) 583–589.
M. S. Cherh, G.H. Chen and P. Liu, An LC branch-and-bound algorithm for the module assignment problem, Inf. Proc. Lett. 32 (1989) 61–71.
E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. Seymour and M. Yannakakis, The complexity of multiway cut, In Proc. 24th ACM STOC (1992) 241–251.
A. V. Goldberg and D. S. Hochbaum, A polynomial algorithm for the k-cut problem, In Proc. 29th IEEE FOCS (1988) 445–451.
C.-H. Lee, D. Lee and M. Kim, Optimal task assignment in linear array networks IEEE Trans. Comp. TSC-41 (1992) 877–880.
V. M. Lo, Heuristic algorithms for task assignment in distributed systems, IEEE Trans. Comp. TSC-37 (1988) 1384–1397.
V.F. Magirou, An improved partial solution to the task assignment and multiway cut problems, Operations Research Letters 12 (1992) 3–10.
V. F. Magirou and J. Z. Milis, An algorithm for the multiprocessor assignment problem, Operations Research Letters 8 (1989) 351–356.
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ (1982).
C. C. Price and S. Krishnaprasad, Software allocation models for distributed computing systems, In Proc. 4th Int. Conf. on Distributed Computing System (1984) 40–48.
J. B. Sinclair, Efficient computation of optimal assignment for distributed tasks, J. Paral. and Distr. Comput. 4 (1987) 342–362.
H. S. Stone, Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. Soft. Eng. SE-3 (1977) 85–93.
D. F. Towsley, Allocating programs containing branches and loops within a multiple processor system, IEEE Trans. Soft. Eng. SE-12 (1986) 1018–1024.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milis, I. (1996). Task assignment in distributed systems using network flow methods. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_98
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61576-7
Online ISBN: 978-3-540-70627-4
eBook Packages: Springer Book Archive