Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
A solvable case of quadratic 0-1 programming
Discrete Applied Mathematics
Optimal Assignments in Broadcast Networks
IEEE Transactions on Computers
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Solving parametric problems on trees
Journal of Algorithms
Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
Algorithms finding tree-decompositions of graphs
Journal of Algorithms
Handbook of theoretical computer science (vol. A)
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Journal of the ACM (JACM)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
Computer Standards & Interfaces
| Hi-index | 14.98 |
The problem of allocating modules to processors in a distributed system to minimize total costs when the underlying communication graph is a partial k-tree and all costs are linear functions of a real parameter t is considered. It is shown that if the number of processors is fixed, the sequence of optimum assignments that are obtained as t varies from zero to infinity can be constructed in polynomial time. As an auxiliary result, a linear time separator algorithm for k-trees is developed. The implications of the results for parametric versions of the weighted vertex cover, independent set, and 0-1 quadratic programming problems on partial k-trees are discussed.