Bal, Henri E.

El-Helw, Ismail

Hofman, Rutger

English

Building efficient algorithms for data-intensive problems requires deep analysis of data access patterns. Random data access patterns exacerbate this process. In this paper, we discuss accelerating a randomized data-intensive machine learning algorithm using multi-core CPUs and several types of GPUs. A thorough analysis of the algorithm’s data dependencies enabled a 75% reduction in its memory footprint. We created custom compute kernels via code generation to identify the optimal set of data placement and computational optimizations per compute device. An empirical evaluation shows up to 245x speedup compared to an optimized sequential version. Another result from this evaluation is that achieving peak performance does not always match intuition: e.g., depending on the GPU architecture, vectorization may increase or hamper performance.</p

VU Research Portal

Accelerating overlapping community detection:Performance tuning a stochastic gradient Markov chain Monte Carlo algorithm

http://www.scopus.com/inward/record.url?scp=85090097403&partnerID=8YFLogxK

Accelerating overlapping community detection:Performance tuning a stochastic gradient Markov chain Monte Carlo algorithm

Abstract

Similar works

Full text

Available Versions

VU Research Portal