Efficient computation of optimal assignments for distributed tasks
- 1 August 1987
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 4 (4) , 342-362
- https://doi.org/10.1016/0743-7315(87)90024-4
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax CriterionIEEE Transactions on Computers, 1985
- Parametric Combinatorial Computing and a Problem of Program Module DistributionJournal of the ACM, 1983
- Optimization by Simulated AnnealingScience, 1983
- Load Balancing in Distributed SystemsIEEE Transactions on Software Engineering, 1982
- Heuristic Models of Task Assignment Scheduling in Distributed SystemsComputer, 1982
- A Task Allocation Model for Distributed Computing SystemsIEEE Transactions on Computers, 1982
- A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor SystemIEEE Transactions on Software Engineering, 1981
- A queueing network approach to the module allocation problem in distributed systemsACM SIGMETRICS Performance Evaluation Review, 1981
- Task Allocation in Distributed Data ProcessingComputer, 1980
- Control of Distributed ProcessesComputer, 1978