Design and performance of a scheduling framework for resizable parallel applications

DOI10.1016/j.parco.2009.12.010zbMath1209.68148MaRDI QIDQ991070

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

high performance computing; dynamic scheduling; data redistribution; run-time systems; application resizing framework; dynamic resizing; malleability in distributed-memory systems; scheduling malleable applications

Mathematics Subject Classification ID

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

68N99: Theory of software

Related Items

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

Uses Software

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

Cites Work

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