Complexity of master-slave tasking on heterogeneous trees

DOI10.1016/J.EJOR.2003.10.051zbMath1058.68021OpenAlexW1999159043MaRDI QIDQ1767690

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Closed form solutions for bus and tree networks of processors load sharing a divisible job

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