skip to main content
10.1145/2751205.2751235acmconferencesArticle/Chapter ViewAbstractPublication PagesicsConference Proceedingsconference-collections
research-article

Criticality-Aware Dynamic Task Scheduling for Heterogeneous Architectures

Published:08 June 2015Publication History

ABSTRACT

Current and future parallel programming models need to be portable and efficient when moving to heterogeneous multi-core systems. OmpSs is a task-based programming model with dependency tracking and dynamic scheduling. This paper describes the OmpSs approach on scheduling dependent tasks onto the asymmetric cores of a heterogeneous system. The proposed scheduling policy improves performance by prioritizing the newly-created tasks at runtime, detecting the longest path of the dynamic task dependency graph, and assigning critical tasks to fast cores. While previous works use profiling information and are static, this dynamic scheduling approach uses information that is discoverable at runtime which makes it implementable and functional without the need of an oracle or profiling. The evaluation results show that our proposal outperforms a dynamic implementation of Heterogeneous Earliest Finish Time by up to 1.15x, and the default breadth-first OmpSs scheduler by up to 1.3x in an 8-core heterogeneous platform and up to 2.7x in a simulated 128-core chip.

References

  1. T. L. Adam, K. M. Chandy, and J. R. Dickson. A Comparison of List Schedules for Parallel Processing Systems. Commun. ACM, 17(12), 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Agarwal and P. Kumar. Economical Duplication Based Task Scheduling for Heterogeneous and Homogeneous Computing Systems. IACC 2009, 2009.Google ScholarGoogle Scholar
  3. C. Augonnet, S. Thibault, R. Namyst, and P.-A. Wacrenier. StarPU: A Unified Platform for Task Scheduling on Heterogeneous Multicore Architectures. Concurr. Comput. : Pract. Exper., 23(2), 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. E. Ayguadé, R. Badia, P. Bellens, D. Cabrera, A. Duran, R. Ferrer, M. Gonzàlez, F. Igual, D. Jiménez-González, J. Labarta, L. Martinell, X. Martorell, R. Mayo, J. Pérez, J. Planas, and E. Quintana-Ortí. Extending OpenMP to Survive the Heterogeneous Multi-Core Era. International Journal of Parallel Programming, 38(5--6), 2010.Google ScholarGoogle Scholar
  5. S. Bansal, P. Kumar, and K. Singh. An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems. Parallel and Distributed Systems, IEEE Transactions on, 14(6), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Barcelona Supercomputing Center. Barcelona Application Repository. Available online on April 18th, 2014.Google ScholarGoogle Scholar
  7. P. Bellens, K. Palaniappan, R. Badia, G. Seetharaman, and J. Labarta. Parallel Implementation of the Integral Histogram. In Advanced Concepts for Intelligent Vision Systems, volume 6915 of Lecture Notes in Computer Science. 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Buttari, J. Langou, J. Kurzak, and J. Dongarra. Parallel tiled QR factorization for multicore architectures. Technical report, 2007.Google ScholarGoogle Scholar
  9. M. Daoud and N. Kharma. Efficient Compile-Time Task Scheduling for Heterogeneous Distributed Computing Systems. ICPADS 2006, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Duran, E. Ayguadé, R. M. Badia, J. Labarta, L. Martinell, X. Martorell, and J. Planas. Ompss: a Proposal for Programming Heterogeneous Multi-Core Architectures. Parallel Processing Letters, 21, 2011.Google ScholarGoogle Scholar
  11. A. Duran, J. Corbalán, and E. Ayguadé. Evaluation of OpenMP Task Scheduling Strategies. IWOMP'08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Duran, J. M. Perez, E. Ayguadé, R. M. Badia, and J. Labarta. Extending the OpenMP Tasking Model to Allow Dependent Tasks. IWOMP'08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Fedorova, J. C. Saez, D. Shelepov, and M. Prieto. Communications of the ACM, (12).Google ScholarGoogle Scholar
  14. P. Greenhalgh. big.LITTLE Processing with ARM Cortex-A15 & Cortex-A7. ARM White Paper, 2011.Google ScholarGoogle Scholar
  15. M. Hakem and F. Butelle. Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors. IPDPS'05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Intel Corporation. Reference Manual for Intel Math Kernel Library 11.1 .Google ScholarGoogle Scholar
  17. M. A. Iverson, F. Özgüner, and G. J. Follen. Parallelizing Existing Applications in a Distributed Heterogeneous Environment. HCW'95, 1995.Google ScholarGoogle Scholar
  18. P. Kogge, K. Bergman, S. Borkar, D. Campbell, W. Carson, W. Dally, M. Denneau, P. Franzon, W. Harrod, K. Hill, and Others. Exascale Computing Study: Technology Challenges in Achieving Exascale Systems. Technical report, University of Notre Dame, CSE Dept., 2008.Google ScholarGoogle Scholar
  19. K. Li, Z. Zhang, Y. Xu, B. Gao, and L. He. Chemical Reaction Optimization for Heterogeneous Computing Environments. ISPA, 2012.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C.-H. Liu, C.-F. Li, K.-C. Lai, and C.-C. Wu. A dynamic Critical Path Duplication Task Scheduling Algorithm for Distributed Heterogeneous Computing Systems. volume 1 of ICPADS 2006, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. A. Page and T. Naughton. Dynamic Task Scheduling using Genetic Algorithms for Heterogeneous Distributed Computing. In Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. A. Pienaar, S. Chakradhar, and A. Raghunathan. Automatic Generation of Software Pipelines for Heterogeneous Parallel Systems. SC '12, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. J. Planas, R. Badia, E. Ayguade, and J. Labarta. Self-Adaptive OmpSs Tasks in Heterogeneous Environments. IPDPS, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. A. Rico, F. Cabarcas, C. Villavieja, M. Pavlovic, A. Vega, Y. Etsion, A. Ramirez, and M. Valero. On the Simulation of Large-Scale Architectures Using Multiple Application Abstraction Levels. ACM Trans. Archit. Code Optim., 8(4). Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. H. Topcuoglu, S. Hariri, and M.-Y. Wu. Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems, 13(3), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. M.-Y. Wu and D. Gajski. Hypertool: a Programming Aid for Message-Passing Systems. Parallel and Distributed Systems, IEEE Transactions on, 1(3), 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. T. Yang and A. Gerasoulis. DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. Parallel and Distributed Systems, IEEE Transactions on, 5(9), 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. H. Yu. A Hybrid GA-based Scheduling Algorithm for Heterogeneous Computing Environments. SCIS'07, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  29. Z. Zong, A. Manzanares, X. Ruan, and X. Qin. EAD and PEBD: Two Energy-Aware Duplication Scheduling Algorithms for Parallel Tasks on Homogeneous Clusters. Computers, IEEE Transactions on, 60(3), 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Criticality-Aware Dynamic Task Scheduling for Heterogeneous Architectures

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          ICS '15: Proceedings of the 29th ACM on International Conference on Supercomputing
          June 2015
          446 pages
          ISBN:9781450335591
          DOI:10.1145/2751205

          Copyright © 2015 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 8 June 2015

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          ICS '15 Paper Acceptance Rate40of160submissions,25%Overall Acceptance Rate584of2,055submissions,28%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader