Speedup-aware co-schedules for efficient workload management

DOI10.1142/S012962641340001XMaRDI QIDQ3458241zbMATH OpenOpenAlexFDO

Authors Manu Shantharam, Youngtae Youn, Padma Raghavan

Publication date 18 December 2015

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s012962641340001x

zbMATH Keywords

co-schedulesspeedupworkload management

Mathematics Subject Classification ID

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

Recommendations

• Co-scheduling algorithms for high-throughput workload execution
• Euro-Par 2004 Parallel Processing
• Local versus global schedulers with processor co-allocation in multicluster systems
• Speed scaling for energy and performance with instantaneous parallelism
• Energy-efficient multiprocessor scheduling for flow time and makespan

Cites work

• An exact approach to the strip-packing problem
• Fast parallel algorithms for short-range molecular dynamics
• Maximum matching and a polyhedron with 0,1-vertices
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(3)

• Co-scheduling algorithms for high-throughput workload execution
• Novel fairness-aware co-scheduling for shared cache contention game on chip multiprocessors
• Euro-Par 2004 Parallel Processing

This page was built for publication: Speedup-aware co-schedules for efficient workload management

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