pith. sign in

arxiv: 1004.0024 · v1 · pith:OGMHBTVMnew · submitted 2010-03-31 · 💻 cs.DC · cs.PF· physics.comp-ph

Importance of Explicit Vectorization for CPU and GPU Software Performance

classification 💻 cs.DC cs.PFphysics.comp-ph
keywords explicitvectorizationversionalgorithmcomputingfully-optimizedmulti-threadingperformance
0
0 comments X
read the original abstract

Much of the current focus in high-performance computing is on multi-threading, multi-computing, and graphics processing unit (GPU) computing. However, vectorization and non-parallel optimization techniques, which can often be employed additionally, are less frequently discussed. In this paper, we present an analysis of several optimizations done on both central processing unit (CPU) and GPU implementations of a particular computationally intensive Metropolis Monte Carlo algorithm. Explicit vectorization on the CPU and the equivalent, explicit memory coalescing, on the GPU are found to be critical to achieving good performance of this algorithm in both environments. The fully-optimized CPU version achieves a 9x to 12x speedup over the original CPU version, in addition to speedup from multi-threading. This is 2x faster than the fully-optimized GPU version.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.