Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search

DOI10.1007/BF01934694MaRDI QIDQ921925zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• Arrangements, Homomorphisms, and Discrete Relaxation
• Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
• Optimization by simulated annealing
• Random Graph Isomorphism
• Scheduling precedence graphs of bounded height
• Subgraph error-correcting isomorphisms for syntactic pattern recognition
• The graph isomorphism disease

Cited in

(4)

• Methods for task allocation via agent coalition formation
• A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
• Distributed task assignment using critical path estimate
• Optimal task assignment with precedence in distributed computing systems

This page was built for publication: Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921925)