Scheduling on Hybrid Platforms: Improved Approximability Window
- 3 December 2020
- book chapter
- Published by Springer Nature
- p. 38-49
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Online Scheduling of Task Graphs on Heterogeneous PlatformsIEEE Transactions on Parallel and Distributed Systems, 2019
- Generic Algorithms for Scheduling Applications on Hybrid Multi-core Machines2017
- Towards Tight Lower Bounds for Scheduling Problems2015
- Scheduling Tasks with Precedence Constraints on Hybrid Multi-core Machines2015
- Scheduling independent tasks on multi‐cores with GPU acceleratorsConcurrency and Computation: Practice and Experience, 2014
- ONLINE SCHEDULING OF MIXED CPU-GPU JOBSInternational Journal of Foundations of Computer Science, 2014
- Optimal Long Code Test with One Free Bit2009
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related MachinesJournal of Algorithms, 2001
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different SpeedsJournal of Algorithms, 1999
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969