Distributed task assignment using critical path estimate

DOI10.1016/0020-0255(93)90095-4MaRDI QIDQ1310961zbMATH OpenOpenAlexFDO

Authors Chiun-Chieh Hsu, Pao-Jyh Lee

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)

Recommendations

• Task assignment in distributed computing systems
• Task allocation model for distributed systems
• scientific article; zbMATH DE number 1161227
• An algorithm for the multiprocessor assignment problem
• Task assignment in heterogeneous computing systems

Cites work

• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
• P-Complete Approximation Problems

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

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