HPX Smart Executors
Open Access
- 12 November 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Abstract
The performance of many parallel applications depends on loop-level parallelism. However, manually parallelizing all loops may result in degrading parallel performance, as some of them cannot scale desirably to a large number of threads. In addition, the overheads of manually tuning loop parameters might prevent an application from reaching its maximum parallel performance. We illustrate how machine learning techniques can be applied to address these challenges. In this research, we develop a framework that is able to automatically capture the static and dynamic information of a loop. Moreover, we advocate a novel method by introducing HPX smart executors for determining the execution policy, chunk size, and prefetching distance of an HPX loop to achieve higher possible performance by feeding static information captured during compilation and runtime-based dynamic information to our learning model. Our evaluated execution results show that using these smart executors can speed up the HPX execution process by around 12%-35% for the Matrix Multiplication, Stream and $2D$ Stencil benchmarks compared to setting their HPX loop's execution policy/parameters manually or using HPX auto-parallelization techniques.Comment: In Proceedings of ESPM2'17: Third International Workshop on Extreme Scale Programming Models and Middleware, Denver, CO, USA, November 12-17,,2017 (ESPM2'17), 8 page
Keywords
All Related Versions
Funding Information
- National Science Foundation (1447831)
This publication has 17 references indexed in Scilit:
- HPX2014
- Classification and regression treesWIREs Data Mining and Knowledge Discovery, 2011
- Efficient Program Compilation Through Machine Learning Techniques2010
- Method-specific dynamic compilation using logistic regressionACM SIGPLAN Notices, 2006
- Feature selection for the naive bayesian classifier using decision treesApplied Artificial Intelligence, 2003
- Evidence-based static branch prediction using machine learningACM Transactions on Programming Languages and Systems, 1997
- A scalable method for run-time loop parallelizationInternational Journal of Parallel Programming, 1995
- Historical Development of the Newton–Raphson MethodSIAM Review, 1995
- Run-time methods for parallelizing partially parallel loops1995
- The incremental garbage collection of processesACM SIGPLAN Notices, 1977