Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Algorithms
Assignment Problems in Parallel and Distributed Computing
Assignment Problems in Parallel and Distributed Computing
A Task Allocation Model for Distributed Computing Systems
IEEE Transactions on Computers
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
The assignment of computational tasks among processors in a distributed system
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
On methods for generating random partial orders
Operations Research Letters
The task allocation problem with constant communication
Discrete Applied Mathematics
A study of the quadratic semi-assignment polytope
Discrete Optimization
An improved partial solution to the task assignment and multiway cut problems
Operations Research Letters
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
Operations Research Letters
Using xQx to model and solve the uncapacitated task allocation problem
Operations Research Letters
| Hi-index | 0.00 |
An exhaustive search algorithm is presented for the assignment of tasks to processors in a distributed processing system so that the sum of execution and communication costs is minimized. The algorithm relies on an efficient lower bound generated by reducing the original task graph to a tree, for which the optimization problem is polynomially solvable. It is also pointed out that the problem is NP-complete even in the case of 3 processors.