Co-scheduling algorithms for high-throughput workload execution

DOI10.1007/s10951-015-0445-xzbMath1386.90045arXiv1304.7793OpenAlexW1927385229MaRDI QIDQ1702725

Anne Benoit, Guillaume Aupy, Padma Raghavan, Manu Shantharam, Yves Robert

Publication date: 28 February 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.7793

zbMATH Keywords

optimizationschedulingworkload execution

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Novel fairness-aware co-scheduling for shared cache contention game on chip multiprocessors

Uses Software

• ScaLAPACK
• PETSc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• Fast parallel algorithms for short-range molecular dynamics
• Two-dimensional packing problems: a survey
• Scheduling with batching: A review
• Optimal Batch Schedules for Parallel Machines
• SPEEDUP-AWARE CO-SCHEDULES FOR EFFICIENT WORKLOAD MANAGEMENT
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• ScaLAPACK Users' Guide
• Optimal control of batch service queues
• ON DEVIATION MATRICES FOR BIRTH–DEATH PROCESSES

This page was built for publication: Co-scheduling algorithms for high-throughput workload execution