A Simple Model for Portable and Fast Prediction of Execution Time and Power Consumption of GPU Kernels

January 20, 2020 Β· Declared Dead Β· πŸ› ACM Transactions on Architecture and Code Optimization (TACO)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Lorenz Braun, Sotirios Nikas, Chen Song, Vincent Heuveline, Holger FrΓΆning arXiv ID 2001.07104 Category cs.DC: Distributed Computing Cross-listed cs.LG, cs.PF Citations 45 Venue ACM Transactions on Architecture and Code Optimization (TACO) Last Checked 3 months ago
Abstract
Characterizing compute kernel execution behavior on GPUs for efficient task scheduling is a non-trivial task. We address this with a simple model enabling portable and fast predictions among different GPUs using only hardware-independent features. This model is built based on random forests using 189 individual compute kernels from benchmarks such as Parboil, Rodinia, Polybench-GPU and SHOC. Evaluation of the model performance using cross-validation yields a median Mean Average Percentage Error (MAPE) of 8.86-52.00% and 1.84-2.94%, for time respectively power prediction across five different GPUs, while latency for a single prediction varies between 15 and 108 milliseconds.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted