EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE

DOI10.1142/S0129054101000485MaRDI QIDQ5249256zbMATH OpenFDO

Authors Fabrício A. B. da Silva, Isaac D. Scherson

Publication date 30 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

competitive analysisparallel computationbin packingresource managementcoschedulingGang schedulingparallel job schedulingdynamic algorithm analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 2221459
• scientific article; zbMATH DE number 5500652
• scientific article; zbMATH DE number 2080863
• Approximation and Online Algorithms
• Group based job scheduling to increase the high-performance computing efficiency
• Scheduling parallel jobs on heterogeneous platforms
• Simultaneous job scheduling and resource allocation on parallel machines

Cites work

• Bin packing with divisible item sizes
• Evaluation of design choices for gang scheduling using distributed hierarchical control
• Fuzzy sets
• Gang scheduling performance benefits for fine-grain synchronization

Cited in

(1)

• scientific article; zbMATH DE number 2080861 (Why is no real title available?)

This page was built for publication: EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE

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