Personal tools
You are here: Home Publications Optimization of Sparse Matrix-Vector Multiplication on Emerging Multicore Programs
Document Actions

Sam Williams, Leonid Oliker, Richard Vuduc, James Demmel, and Katherine Yelick (2007)

Optimization of Sparse Matrix-Vector Multiplication on Emerging Multicore Programs

In: Proceedings of Supercomputing (SC07), Reno, Nevada, ACM.

<p>We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from cell phones to supercomputers confronts parallelism of unprecedented scale. To fully unleash the potential of these systems, the HPC community must develop multicore-specific optimization methodologies for important scientific computations. In this work, we examine sparse matrix-vector multiply (SpMV), one of the most heavily used kernels in scientific computing, across a broad spectrum of multicore designs. Our experimental platform includes the AMD dual-core, the Intel quad-core, the heterogeneous STI Cell, as well as the first scientific study of the highly multithreaded Sun Niagara2. We present several optimization strategies especially effective for the multicore environment, and demonstrate significant performance improvements compared to existing state-of-the-art serial and parallel SpMV implementations. Additionally, we present key insights into the architectural tradeoffs of leading multicore design strategies, in the context of demanding memory-bound numerical algorithms.</p>

by admin last modified 2008-04-17 09:47
« September 2017 »
Su Mo Tu We Th Fr Sa
12
3456789
10111213141516
17181920212223
24252627282930
 

Powered by Plone

CScADS Collaborators include:

Rice University ANL UCB UTK WISC