Design and performance of a scheduling framework for resizable parallel applications

DOI10.1016/J.PARCO.2009.12.010MaRDI QIDQ991070zbMATH OpenOpenAlexFDO

Authors Rajesh Sudarsan, Calvin J. Ribbens

Publication date 2 September 2010

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.parco.2009.12.010

zbMATH Keywords

dynamic schedulinghigh performance computingdata redistributionrun-time systemsapplication resizing frameworkdynamic resizingmalleability in distributed-memory systemsscheduling malleable applications

Mathematics Subject Classification ID

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

Recommendations

• Integrated scheduling: The best of both worlds.
• scientific article; zbMATH DE number 2087831
• Agile parallel applications
• scientific article; zbMATH DE number 1760099
• A scheduling framework for large-scale, parallel, and topology-aware applications

Cites work

• Dynamic scheduling on parallel machines
• Integrated scheduling: The best of both worlds.
• Using moldability to improve the performance of supercomputer jobs

Cited in

(4)

• Agile parallel applications
• A high efficiency parallel unstructured solver dedicated to internal combustion engine simulation
• Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
• PSBS: Practical Size-Based Scheduling

Describes a project that uses

Uses Software

• ReSHAPE
• NAS Parallel Benchmarks
• CHARM++
• ScaLAPACK

This page was built for publication: Design and performance of a scheduling framework for resizable parallel applications

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