Abstract
With the rise of accelerators (e.g., GPUs, FPGAs, and APUs) in computing systems, the parallel computing community needs better tools and mechanisms with which to productively extract performance. While modern compilers provide .ags to activate di.erent optimizations to improve performance, the e.ectiveness of such automated optimization depends on the algorithm and its mapping to the underlying accelerator architecture. Currently, however, extracting the best performance from an algorithm on an accelerator requires signi.cant expertise and manual effort to exploit both spatial and temporal sharing of computing resources in order to improve overall performance. In particular, maximizing the performance on an algorithm on an accelerator requires extensive hyperparameter (e.g., thread-block size) selection and tuning. Given the myriad of hyperparameter dimensions to optimize across, the search space of optimizations is generally extremely large, making it infeasible to exhaustively evaluate each optimization configuration. This paper proposes an approach that uses statistical analysis with iterative machine learning (IterML) to prune and tune hyperparameters to achieve better performance. During each iteration, we leverage machine-learning (ML) models to provide pruning and tuning guidance for the subsequent iterations. We evaluate our IterML approach on the selection of the GPU thread-block size across many benchmarks running on an NVIDIA P100 or V100 GPU. The experimental results show that our IterML approach can significantly reduce (i.e., improve) the search effort by 40% to 80%.
Author supplied keywords
Cite
CITATION STYLE
Cui, X., & Feng, W. C. (2019). Iterative Machine Learning (IterML) for Effective parameter pruning and tuning in accelerators. In ACM International Conference on Computing Frontiers 2019, CF 2019 - Proceedings (pp. 16–19). Association for Computing Machinery, Inc. https://doi.org/10.1145/3310273.3321563
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.