Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
Efficient computation of optimal assignments for distributed tasks
Journal of Parallel and Distributed Computing
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
An efficient algorithm for a task allocation problem
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed Multimedia Application Configuration Management
IEEE Transactions on Parallel and Distributed Systems
A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
Computers and Operations Research
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Studies the complexity of the problem of allocating m modules to n processors in adistributed system to minimize total communication and execution costs. When thecommunication graph is a tree, Bokhari has shown that the optimum allocation can bedetermined in O(mn/sup 2/) time. Recently, this result has been generalized byFernandez-Baca, who has proposed an allocation algorithm in O(mn/sup k+1/) when thecommunication graph is a partial k-tree. The author shows that in the case wherecommunication costs are uniform, the module allocation problem can be solved in O(mn)time if the communication graph is a tree. This algorithm is asymptotically optimum.