Scheduling on Two Types of Resources

The evolution in the design of modern parallel platforms leads to revisit the scheduling jobs on distributed heterogeneous resources. The goal of this survey is to present the main existing algorithms, to classify them based on their underlying principles, and to propose unified implementations to enable their fair comparison, in terms of running time and quality of schedules, on a large set of common benchmarks that we made available for the community. Beyond this comparison, our goal is also to understand the main difficulties that heterogeneity conveys and the shared principles that guide the design of efficient algorithms.

[1]  Denis Trystram,et al.  Scheduling Data Flow Program in XKaapi: A New Affinity Based Algorithm for Heterogeneous Architectures , 2014, Euro-Par.

[2]  Rizos Sakellariou,et al.  DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm , 2010, 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing.

[3]  Cédric Augonnet,et al.  StarPU: a unified platform for task scheduling on heterogeneous multicore architectures , 2011, Concurr. Comput. Pract. Exp..

[4]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[5]  Jack Dongarra,et al.  QUARK Users' Guide: QUeueing And Runtime for Kernels , 2011 .

[6]  AyguadéEduard,et al.  Hierarchical Task-Based Programming With StarSs , 2009 .

[7]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  Vincenzo Bonifaci,et al.  Scheduling Unrelated Machines of Few Different Types , 2012, ArXiv.

[9]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[10]  Olivier Beaumont,et al.  Fast approximation algorithms for task‐based runtime systems , 2018, Concurr. Comput. Pract. Exp..

[11]  Denis Trystram,et al.  Generic algorithms for scheduling applications on heterogeneous platforms , 2018, Concurr. Comput. Pract. Exp..

[12]  Denis Trystram,et al.  Generic Algorithms for Scheduling Applications on Hybrid Multi-core Machines , 2017, Euro-Par.

[13]  Subhash Khot,et al.  Optimal Long Code Test with One Free Bit , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Safia Kedad-Sidhoum,et al.  Scheduling independent tasks on multi‐cores with GPU accelerators , 2015, Concurr. Comput. Pract. Exp..

[15]  Anthony A. Maciejewski,et al.  Scalable linear programming based resource allocation for makespan minimization in heterogeneous computing systems , 2015, J. Parallel Distributed Comput..

[16]  Niranjan N. Chiplunkar,et al.  A survey on techniques for cooperative CPU-GPU computing , 2018, Sustain. Comput. Informatics Syst..

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Andy B. Yoo,et al.  Approved for Public Release; Further Dissemination Unlimited X-ray Pulse Compression Using Strained Crystals X-ray Pulse Compression Using Strained Crystals , 2002 .

[19]  Lilia Zaourar,et al.  Approximation Algorithm for Scheduling Applications on Hybrid Multi-core Machines with Communications Delays , 2018, 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW).

[20]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[21]  Maciej Drozdowski,et al.  Scheduling for Parallel Processing , 2009, Computer Communications and Networks.

[22]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[23]  Klaus Jansen,et al.  A PTAS for Scheduling Unrelated Machines of Few Different Types , 2016, SOFSEM.

[24]  Salim Hariri,et al.  Task scheduling algorithms for heterogeneous processors , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[25]  Olivier Beaumont,et al.  Approximation Proofs of a Fast and Efficient List Scheduling Algorithm for Task-Based Runtime Systems on Multicores and GPUs , 2017, 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[26]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[27]  Frédéric Vivien,et al.  Low-Cost Approximation Algorithms for Scheduling Independent Tasks on Hybrid Platforms , 2017, Euro-Par.

[28]  Martin Gairing,et al.  A faster combinatorial approximation algorithm for scheduling unrelated parallel machines , 2005, Theor. Comput. Sci..

[29]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[30]  Nodari Vakhania,et al.  An optimal rounding gives a better approximation for scheduling unrelated machines , 2005, Oper. Res. Lett..

[31]  Safia Kedad-Sidhoum,et al.  Scheduling Independent Moldable Tasks on Multi-Cores with GPUs , 2017, IEEE Transactions on Parallel and Distributed Systems.

[32]  Jeffrey S. Vetter,et al.  A Survey of CPU-GPU Heterogeneous Computing Techniques , 2015, ACM Comput. Surv..

[33]  Cristina Boeres,et al.  On the Feasibility of Dynamically Scheduling DAG Applications on Shared Heterogeneous Systems , 2009, Euro-Par.

[34]  Frédéric Vivien,et al.  Online Scheduling of Task Graphs on Hybrid Platforms , 2018, Euro-Par.

[35]  George Bosilca,et al.  PaRSEC : A programming paradigm exploiting heterogeneity for enhancing scalability , 2013 .

[36]  Tao Yang,et al.  DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[37]  Frédéric Vivien,et al.  Online Scheduling of Task Graphs on Heterogeneous Platforms , 2020, IEEE Transactions on Parallel and Distributed Systems.

[38]  Csanád Imreh,et al.  Scheduling Problems on Two Sets of Identical Machines , 2003, Computing.

[39]  Denis Trystram,et al.  Parallel algorithms and architectures , 1995 .

[40]  Safia Kedad-Sidhoum,et al.  Fast Biological Sequence Comparison on Hybrid Platforms , 2014, 2014 43rd International Conference on Parallel Processing.

[41]  Erik Saule,et al.  Considerations on Distributed Load Balancing for Fully Heterogeneous Machines: Two Particular Cases , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium Workshop.

[42]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[43]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[44]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[45]  Eduard Ayguadé,et al.  Hierarchical Task-Based Programming With StarSs , 2009, Int. J. High Perform. Comput. Appl..

[46]  Emmanuel Agullo,et al.  Task‐based FMM for heterogeneous architectures , 2016, Concurr. Comput. Pract. Exp..

[47]  Safia Kedad-Sidhoum,et al.  A Family of Scheduling Algorithms for Hybrid Parallel Platforms , 2018, Int. J. Found. Comput. Sci..

[48]  Lin Chen,et al.  Online Scheduling of mixed CPU-GPU jobs , 2014, Int. J. Found. Comput. Sci..

[49]  Jacques Carlier,et al.  Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .

[50]  Hai Liu,et al.  Energy efficient real-time task scheduling on CPU-GPU hybrid clusters , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[51]  Fabián A. Chudak,et al.  Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.

[52]  AgulloEmmanuel,et al.  Task-based FMM for heterogeneous architectures , 2016 .

[53]  Ola Svensson,et al.  Hardness of Precedence Constrained Scheduling on Identical Machines , 2011, SIAM J. Comput..

[54]  David B. Shmoys,et al.  Approximation schemes for constrained scheduling problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[55]  Safia Kedad-Sidhoum,et al.  Scheduling Tasks with Precedence Constraints on Hybrid Multi-core Machines , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium Workshop.