Decentralized list scheduling

DOI10.1007/s10479-012-1149-7zbMath1273.90086arXiv1107.3734OpenAlexW2029265412MaRDI QIDQ367649

Nicolas Gast, Marc Tchiboukdjian, Denis Trystram

Publication date: 16 September 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

schedulingwork stealinglist algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Uses Software

• KAAPI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line hierarchical job scheduling on grids with admissible allocation
• Scheduling for parallel processing
• Online scheduling of parallel programs on heterogeneous systems with applications to Cilk
• On weighted balls-into-bins games
• An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
• A Tighter Analysis of Work Stealing
• Scheduling multithreaded computations by work stealing
• Distributed Selfish Load Balancing
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Balanced Allocations
• The Natural Work-Stealing Algorithm is Stable
• Bounds on Multiprocessing Timing Anomalies
• Thread scheduling for multiprogrammed multiprocessors

This page was built for publication: Decentralized list scheduling