Scheduling master-slave multiprocessor systems

DOI10.1109/12.543712MaRDI QIDQ4420837zbMATH OpenOpenAlexFDO

Authors Sartaj Sahni

Publication date 1996

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.543712

zbMATH Keywords

NP-hard problems

Mathematics Subject Classification ID

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

Recommendations

• On multiprocessor system scheduling
• Scheduling Multipipeline and Multiprocessor Computers
• scientific article; zbMATH DE number 3970495
• Scheduling problems in master-slave model
• Multiprocessor scheduling and combinatorial configurations
• Scheduling multiprocessor tasks -- An overview

Cited in

(6)

• Scalable scheduling for symmetric multiprocessors (SMP).
• The master-slave paradigm in parallel computer and industrial settings
• Scheduling self-suspending tasks: new and old results
• Minimizing mean flowtime and makespan on master-slave systems
• Scheduling with machine conflicts
• Scheduling problems in master-slave model

This page was built for publication: Scheduling master-slave multiprocessor systems

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