Complexity of master-slave tasking on heterogeneous trees

DOI10.1016/J.EJOR.2003.10.051MaRDI QIDQ1767690zbMATH OpenOpenAlexFDO

Authors Pierre-François Dudot

Publication date 8 March 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2003.10.051

zbMATH Keywords

Complexity theoryHeterogeneous platformsMaster-slave tasking

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 2089185
• Scheduling tree-structured tasks with restricted execution times
• Complexity of Task Graph Scheduling with Fixed Communication Capacity
• Scheduling trees with large communication delays on two identical processors
• Tree scheduling with communication delays

Cites work

• Closed form solutions for bus and tree networks of processors load sharing a divisible job
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2135240 (Why is no real title available?)

Cited in

(4)

• Scheduling tree-structured tasks with restricted execution times
• scientific article; zbMATH DE number 2089185 (Why is no real title available?)
• Minimizing mean flowtime and makespan on master-slave systems
• Scheduling problems in master-slave model

This page was built for publication: Complexity of master-slave tasking on heterogeneous trees

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