Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Optimal Task Assignment in Homogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed Multimedia Application Configuration Management
IEEE Transactions on Parallel and Distributed Systems
Optimizing Computing Costs Using Divisible Load Analysis
IEEE Transactions on Parallel and Distributed Systems
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Scheduling algorithm: tasks scheduling algorithm for multiple processors with dynamic reassignment
Journal of Computer Systems, Networks, and Communications
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
On minimizing the resource consumption of cloud applications using process migrations
Journal of Parallel and Distributed Computing
Line ordering of reversible circuits for linear nearest neighbor realization
Quantum Information Processing
| Hi-index | 14.98 |
The problem of assigning tasks to the processors of a distributed computing system such that the sum of execution and communication costs is minimized is discussed. This problem is known to be NP-complete in the general case, and thus intractable for systems with a large number of processors. H.S. Stone's (1977) network flow approach for a two-processor system is extended to the case for a linear array of any number of processors. The task assignment problem for a linear array network is first transformed into the two-terminal network flow problem, and then solved by applying the Goldberg-Tarjan (1987) network flow algorithm in time no worse than O(n/sup 2/m/sup 3/ log n), where n and m are the number of processors and the number of tasks, respectively.