Distributed task assignment using critical path estimate

DOI10.1016/0020-0255(93)90095-4zbMath0798.68019OpenAlexW1507611310MaRDI QIDQ1310961

Pao-Jyh Lee, Chiun-Chieh Hsu

Publication date: 26 January 1994

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(93)90095-4

zbMATH Keywords

distributed computingtask assignmentcritical path overestimate

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
• P-Complete Approximation Problems
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms

This page was built for publication: Distributed task assignment using critical path estimate