An approximation algorithm for scheduling trees of malleable tasks

DOI10.1016/S0377-2217(02)00264-3zbMath1082.90527OpenAlexW1993720874MaRDI QIDQ1848358

Renaud Lepère, Grégory Mounié, Denis Trystram

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00264-3

zbMATH Keywords

SchedulingParallel computingTreesPrecedence constraintsMalleable tasks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (4)

Scheduling malleable tasks with precedence constraints ⋮ Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width ⋮ Idle regulation in non-clairvoyant scheduling of parallel jobs ⋮ An optimal schedule for Gaussian elimination on an MIMD architecture

Cites Work

• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Optimal online scheduling of parallel jobs with dependencies
• Bounds for Certain Multiprocessing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation algorithm for scheduling trees of malleable tasks