Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
- 1 March 1988
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 28 (1) , 54-68
- https://doi.org/10.1007/bf01934694
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax CriterionIEEE Transactions on Computers, 1985
- Scheduling precedence graphs of bounded heightJournal of Algorithms, 1984
- Optimization by Simulated AnnealingScience, 1983
- Heuristic Models of Task Assignment Scheduling in Distributed SystemsComputer, 1982
- On the Mapping ProblemIEEE Transactions on Computers, 1981
- Task Allocation in Distributed Data ProcessingComputer, 1980
- Random Graph IsomorphismSIAM Journal on Computing, 1980
- Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor SystemIEEE Transactions on Computers, 1979
- Control of Distributed ProcessesComputer, 1978
- The graph isomorphism diseaseJournal of Graph Theory, 1977