Minimizing mean flowtime and makespan on master-slave systems

DOI10.1016/J.JPDC.2005.03.004MaRDI QIDQ557659zbMATH OpenOpenAlexFDO

Authors Hairong Zhao, Joseph Y.-T. Leung

Publication date 30 June 2005

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.03.004

zbMATH Keywords

NP-hardHeuristicsMakespanMaster-slave systemsMean flowtimeScheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• Scheduling problems in master-slave model
• The master-slave paradigm in parallel computer and industrial settings
• Scheduling master-slave multiprocessor systems
• Minimizing mean flow time with parallel processors and resource constraints
• Complexity of master-slave tasking on heterogeneous trees

Cited in

(1)

• Scheduling problems in master-slave model

This page was built for publication: Minimizing mean flowtime and makespan on master-slave systems

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