Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
The complexity of multiway cuts (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An efficient algorithm for a task allocation problem
Journal of the ACM (JACM)
The Module Allocation Problem: An Average Case Analysis
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
An improved partial solution to the task assignment and multiway cut problems
Operations Research Letters
An algorithm for the multiprocessor assignment problem
Operations Research Letters
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
| Hi-index | 0.04 |
In the module allocation problem we are given n tasks t"1,...,t"n, to be executed by m processors P"1,...,P"m, subject to both execution and communication costs. The cost of any assignment of the tasks to the processors is defined as the sum of the corresponding execution costs, and the communication costs for any pair of tasks assigned to distinct processors. We consider the case where all the tasks communicate with communication costs all equal to a constant c"0. When the number of processors is bounded, we give two exact, polynomial-time algorithms, an elementary one for the case where the execution costs take only two distinct values and one for the general case. When the number of processors is not bounded, we obtain a polynomial-time approximation scheme. We obtain a similar algorithm when the communication graph is the edge union of a bounded number of cliques and complete bipartite graphs.