Polynomial scheduling algorithm for parallel applications on hybrid platforms

DOI10.1007/978-3-030-53262-8_12MaRDI QIDQ2225058zbMATH OpenOpenAlexFDO

Authors Massinissa Ait Aba, Lilia Zaourar, A. Munier

Publication date 4 February 2021

Full work available at URL https://doi.org/10.1007/978-3-030-53262-8_12

zbMATH Keywords

approximation algorithmCPUDAG applicationsGPUhybrid platformmakespanscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A family of scheduling algorithms for hybrid parallel platforms
• Scheduling and optimizing algorithm for parallel tasks in heterogeneous distributed computing systems
• Generic algorithms for scheduling applications on hybrid multi-core machines
• Low-cost approximation algorithms for scheduling independent tasks on hybrid platforms
• Euro-Par 2004 Parallel Processing

Cited in

(8)

• Scheduling on hybrid platforms: improved approximability window
• A family of scheduling algorithms for hybrid parallel platforms
• A meta-scheduler for the par-monad, composable scheduling for the heterogeneous cloud
• Generic algorithms for scheduling applications on hybrid multi-core machines
• Low-cost approximation algorithms for scheduling independent tasks on hybrid platforms
• Euro-Par 2004 Parallel Processing
• Performance driven distributed scheduling of parallel hybrid computations
• Optimizing latency and throughput of application workflows on clusters

This page was built for publication: Polynomial scheduling algorithm for parallel applications on hybrid platforms

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