Idle regulation in non-clairvoyant scheduling of parallel jobs

DOI10.1016/j.dam.2008.03.005zbMath1155.90394OpenAlexW2010485870MaRDI QIDQ1003681

Andrei Tchernykh, Denis Trystram, Isaac D. Scherson, Carlos A. Brizuela

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.005

zbMATH Keywords

schedulingparallel jobsidle regulation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ PHEFT: pessimistic image processing workflow scheduling for DSP clusters

Cites Work

• Online algorithms. The state of the art
• Optimal on-line scheduling of parallel jobs with dependencies
• An approximation algorithm for scheduling trees of malleable tasks
• Evaluation of design choices for gang scheduling using distributed hierarchical control
• Concurrent Task Systems
• Scheduling Parallel Machines On-Line
• Parallel Processing and Applied Mathematics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item