Optimal task allocation in distributed systems by graph matching and state space search
- 1 April 1999
- journal article
- Published by Elsevier BV in Journal of Systems and Software
- Vol. 46 (1), 59-75
- https://doi.org/10.1016/s0164-1212(98)10088-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An LC branch-and-bound algorithm for the module assignment problemInformation Processing Letters, 1989
- Efficient computation of optimal assignments for distributed tasksJournal of Parallel and Distributed Computing, 1987
- A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax CriterionIEEE Transactions on Computers, 1985
- Heuristic Models of Task Assignment Scheduling in Distributed SystemsComputer, 1982
- A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor SystemIEEE Transactions on Software Engineering, 1981
- Task Allocation in Distributed Data ProcessingComputer, 1980
- Dual Processor Scheduling with Dynamic ReassignmentIEEE Transactions on Software Engineering, 1979
- Control of Distributed ProcessesComputer, 1978
- Critical Load Factors in Two-Processor Distributed SystemsIEEE Transactions on Software Engineering, 1978
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977