Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
From MaRDI portal
Publication:921925
DOI10.1007/BF01934694zbMath0709.68516OpenAlexW2063169100MaRDI QIDQ921925
Ling-Ling Wang, Wen-Hsiang Tsai
Publication date: 1988
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01934694
Related Items (4)
Optimal task assignment with precedence in distributed computing systems ⋮ A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations ⋮ Methods for task allocation via agent coalition formation ⋮ Distributed task assignment using critical path estimate
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Scheduling precedence graphs of bounded height
- Random Graph Isomorphism
- Subgraph error-correcting isomorphisms for syntactic pattern recognition
- The graph isomorphism disease
- Arrangements, Homomorphisms, and Discrete Relaxation
- Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
This page was built for publication: Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
