Optimal task assignment with precedence in distributed computing systems
From MaRDI portal
Publication:1328541
DOI10.1016/0020-0255(94)90017-5zbMath0810.68067OpenAlexW1571991012MaRDI QIDQ1328541
Publication date: 27 September 1994
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(94)90017-5
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- Critical Load Factors in Two-Processor Distributed Systems
- Assignment of Tasks in a Distributed Processor System with Limited Memory
This page was built for publication: Optimal task assignment with precedence in distributed computing systems