Task assignment in distributed systems using network flow methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1120, Issue , 1996, Pages 396-405

  Milis, Ioannis ^a,b  

^a INRIA   (France)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; HEURISTIC ALGORITHMS; PROGRAM PROCESSORS;

DISTRIBUTED SYSTEMS; LARGE-SIZED; MODULAR PROGRAMS; MULTIWAY CUT PROBLEMS; NETWORK FLOWS; PROBLEM SIZE; TASK ASSIGNMENT;

HEURISTIC METHODS;

EID: 21444459456     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61576-8_98     Document Type: Conference Paper

References (16)

1. 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).
2. D. Fernàdez-Baca, Allocating modules to processors in a distributed system, IEEE Trans. Soft. Eng. SE-15 (1989) 142771436.
3. A. Billionnet, M. C. Costa and A.Sutter, An efficient algorithm for a task allocation problem, J.ACM 39 (1992) 502-518.
4. 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.
5. M. S. Cherh, G.H. Chen and P. Liu, An LC branch-and-bound algorithm/or the module assignment problem, Inf. Proc. Lett. 32 (1989) 61-71.
6. 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.
7. A. V. Goldberg and D. S. Hochbaum, A polynomial algorithm for the k-cut problem, In Proc. 29th IEEE FOCS (1988) 445-451.
8. C.-H. Lee, D. Lee and M. Kim, Optimal task assignment in linear array networks IEEE Trans. Comp. TSC-41 (1992) 877-880.
9. V. M. Lo, Heuristic algorithms for task assignment in distributed systems, IEEE Trans. Comp. TSC-37 (1988) 1384-1397.
10. V.F. Magirou, An improved partial solution to the task assignment and multiway cut problems, Operations Research Letters 12 (1992) 3-10.
11. V. F. Magirou and J. Z. Mills, An algorithm for the multiprocessor assignment problem, Operations Research Letters 8 (1989) 351-356.
12. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ (1982).
13. 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.
14. J. B. Sinclair, Efficient computation of optimal assignment for distributed tasks, J. Paral. and Distr. Comput. 4 (1987) 342-362.
15. H. S. Stone, Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. Soft. Eng. SE-3 (1977) 85-93.
16. D. F. Towsley, Allocating programs containing branches and loops within a multiple processor system, IEEE Trans. Soft. Eng. SE-12 (1986) 1018-1024.