Presentation is loading. Please wait.

Presentation is loading. Please wait.

Automatic Performance Tuning of SpMV on GPGPU Xianyi Zhang Lab of Parallel Computing Institute of Software Chinese Academy of Sciences

Published byHillary Carpenter Modified over 8 years ago

Similar presentations

Presentation on theme: "Automatic Performance Tuning of SpMV on GPGPU Xianyi Zhang Lab of Parallel Computing Institute of Software Chinese Academy of Sciences"— Presentation transcript:

1 Automatic Performance Tuning of SpMV on GPGPU Xianyi Zhang Lab of Parallel Computing Institute of Software Chinese Academy of Sciences zxy@mail.rdcps.ac.cn

2 Outline  Motivation  SpMV Introduction  AMD Stream Computing  GOSpMV Overview  GOSpMV Performance Evaluation  Conclusion & Future Work

3 Motivation  Sparse Matrix-Vector Multiplication (SpMV) y=y+Ax  The important kernel in scientific applications PDE solver, simulation, etc.  Low performance Irregular memory access pattern

4 Motivation  GPU  Huge computation power Jason Yang, James Goodman. Symmetric Key Cryptography on Modern Graphics Hardware. http://ati.amd.com/technology/streamcomputing/asiacrypt2007.pdf http://ati.amd.com/technology/streamcomputing/asiacrypt2007.pdf

5 SpMV Introduction  CSR (Compressed Sparse Row) A_val=[1,2,4,1] A_col=[0,2,1,2] A_ptr=[0,2,3,4] for(i = 0; i < n ; i++) { value = 0; for(j = A_ptr[i]; j < A_ptr[i+1] ; j++) value = value + A_val[j]*x[A_col[j]]; y[i] += value; } x is accessed irregularly x is accessed indirectly

6 SpMV Introduction  BCSR (Block Compressed Sparse Row)  BCSR 2 × 3

7 AMD Stream Computing  Programming Model AMD Stream Computing User Guide

8 AMD Stream Computing  AMD Brook+ AMD Stream Computing User Guide

9 GOSpMV Overview  GOSpMV Software Architecture

10 GOSpMV Overview  BCSR SpMV implementation on GPGPU

11 GOSpMV Overview  Automatic Performance Tuning

12 GOSpMV Overview  Off-line GPGPU Benchmark Dense matrix (different size) Every BCSR block size

13 GOSpMV Overview  Run-Time Evaluation(search optimal BCSR block size) Input: Sparse Matrix A, GPGPU Benchmark data P dense (block-format, nz d ) Output: the maximum P (A, block-format, σ), optimal BCSR block size For each BCSR r × c block, do calculate fill ratio f Erc (A, σ) with sample rate σ P sp (block-format, nz EBCSR )= P dense (block-format, nz d ), nz d is nearest to nz EBCSR P (A, block-format, σ) = P (block-format, nz EBCSR )/ f Erc (A, σ) done

14 GOSpMV Performance Evaluation  Test box  Intel Pentium Dual Core E2160/1.8GHz, 2.0GB memory  GPU AMD Radeon HD 3690 (RV670), theoretical peak:428.8 GigaFlOPS (single precision)  AMD Stream SDK v1.1-beta  Ubuntu 8.04, Linux 2.6.24, gcc 4.2.3  Test matrices  8 sparse matrices, different size (small, medium, large) Small (nonzeros < 100,000) Medium (100,000 < nonzeros < 1,000,000) Large (nonzeros >= 1,000,000)  Matrix Market and UF Sparse Matrix Collection.

15 GOSpMV Performance Evaluation  Test matrices

16 GOSpMV Performance Evaluation  AMD Radeon HD 3690 Result  SpMV BCSR on GPGPU (1500 iterations)

17 GOSpMV Performance Evaluation  Different iterations (100,300,500,1000,1500)

18 GOSpMV Performance Evaluation  The automatic performance tuning (1500 iterations)  The average speedup: 3.11

19 Conclusion  GOSpMV Performance Speedup  AMD Radeon HD 3690 average: 3.11, max: 5.96, 1500 iterations  GOSpMV is suited for  Medium matrices, Large matrices  Iteration number>= 300  Regular matrices (low fill ratio)  In general, GOSpMV selects the better BCSR block size by automatic performance tuning technology.

20 Future Work  Double precision  Support other BCSR block size (e.g. 8x8)  New HW (AMD RV770)  Automatic performance tuning strategy  Re-ordering matrix

21 Thank you ！ Ｑ＆Ａ

Download ppt "Automatic Performance Tuning of SpMV on GPGPU Xianyi Zhang Lab of Parallel Computing Institute of Software Chinese Academy of Sciences"

Similar presentations

Copyright 2011, Data Mining Research Laboratory Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining Xintian Yang, Srinivasan.

Copyright 2011, Data Mining Research Laboratory Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining Xintian Yang, Srinivasan.
Adaptable benchmarks for register blocked sparse matrix-vector multiplication ● Berkeley Benchmarking and Optimization group (BeBOP) ● Hormozd Gahvari.

Adaptable benchmarks for register blocked sparse matrix-vector multiplication ● Berkeley Benchmarking and Optimization group (BeBOP) ● Hormozd Gahvari.
SE263 Video Analytics Course Project Initial Report Presented by M. Aravind Krishnan, SERC, IISc X. Mei and H. Ling, ICCV’09.

SE263 Video Analytics Course Project Initial Report Presented by M. Aravind Krishnan, SERC, IISc X. Mei and H. Ling, ICCV’09.
GPU Virtualization Support in Cloud System Ching-Chi Lin Institute of Information Science, Academia Sinica Department of Computer Science and Information.

GPU Virtualization Support in Cloud System Ching-Chi Lin Institute of Information Science, Academia Sinica Department of Computer Science and Information.
Early Linpack Performance Benchmarking on IPE Mole-8.5 Fermi GPU Cluster Xianyi Zhang 1),2) and Yunquan Zhang 1),3) 1) Laboratory of Parallel Software.

Early Linpack Performance Benchmarking on IPE Mole-8.5 Fermi GPU Cluster Xianyi Zhang 1),2) and Yunquan Zhang 1),3) 1) Laboratory of Parallel Software.
Sparse LU Factorization for Parallel Circuit Simulation on GPU Ling Ren, Xiaoming Chen, Yu Wang, Chenxi Zhang, Huazhong Yang Department of Electronic Engineering,

Sparse LU Factorization for Parallel Circuit Simulation on GPU Ling Ren, Xiaoming Chen, Yu Wang, Chenxi Zhang, Huazhong Yang Department of Electronic Engineering,
Benchmarking Sparse Matrix-Vector Multiply In 5 Minutes Hormozd Gahvari, Mark Hoemmen, James Demmel, and Kathy Yelick January 21, 2007 Hormozd Gahvari,

Benchmarking Sparse Matrix-Vector Multiply In 5 Minutes Hormozd Gahvari, Mark Hoemmen, James Demmel, and Kathy Yelick January 21, 2007 Hormozd Gahvari,
A Sparse Matrix Personality for the Convey HC-1 Dept. of Computer Science and Engineering University of South Carolina Krishna K Nagar, Jason D. Bakos.

A Sparse Matrix Personality for the Convey HC-1 Dept. of Computer Science and Engineering University of South Carolina Krishna K Nagar, Jason D. Bakos.
Computes the partial dot products for only the diagonal and upper triangle of the input matrix. The vector computed by this architecture is added to the.

Computes the partial dot products for only the diagonal and upper triangle of the input matrix. The vector computed by this architecture is added to the.
Presented by Rengan Xu LCPC 2014 09/16/2014

Presented by Rengan Xu LCPC /16/2014
Languages and Compilers for High Performance Computing Kathy Yelick EECS Department U.C. Berkeley.

Languages and Compilers for High Performance Computing Kathy Yelick EECS Department U.C. Berkeley.
Automatic Performance Tuning of Sparse Matrix Kernels Observations and Experience Performance tuning is tedious and time- consuming work. Richard Vuduc.

Automatic Performance Tuning of Sparse Matrix Kernels Observations and Experience Performance tuning is tedious and time- consuming work. Richard Vuduc.
A Stratified Approach for Supporting High Throughput Event Processing Applications July 2009 Geetika T. LakshmananYuri G. RabinovichOpher Etzion IBM T.

A Stratified Approach for Supporting High Throughput Event Processing Applications July 2009 Geetika T. LakshmananYuri G. RabinovichOpher Etzion IBM T.
1cs542g-term1-2007 Sparse matrix data structure  Typically either Compressed Sparse Row (CSR) or Compressed Sparse Column (CSC) Informally “ia-ja” format.

1cs542g-term Sparse matrix data structure  Typically either Compressed Sparse Row (CSR) or Compressed Sparse Column (CSC) Informally “ia-ja” format.
L12: Sparse Linear Algebra on GPUs CS6963. Administrative Issues Next assignment, triangular solve – Due 5PM, Monday, March 8 – handin cs6963 lab 3 ”

L12: Sparse Linear Algebra on GPUs CS6963. Administrative Issues Next assignment, triangular solve – Due 5PM, Monday, March 8 – handin cs6963 lab 3 ”
Synergy.cs.vt.edu Power and Performance Characterization of Computational Kernels on the GPU Yang Jiao, Heshan Lin, Pavan Balaji (ANL), Wu-chun Feng.

Synergy.cs.vt.edu Power and Performance Characterization of Computational Kernels on the GPU Yang Jiao, Heshan Lin, Pavan Balaji (ANL), Wu-chun Feng.
SAGE: Self-Tuning Approximation for Graphics Engines

SAGE: Self-Tuning Approximation for Graphics Engines
Motivation “Every three minutes a woman is diagnosed with Breast cancer” (American Cancer Society, “Detailed Guide: Breast Cancer,” 2006) Explore the use.

Motivation “Every three minutes a woman is diagnosed with Breast cancer” (American Cancer Society, “Detailed Guide: Breast Cancer,” 2006) Explore the use.
Introduction Hardware accelerators, such as General-Purpose Graphics Processing Units (GPGPUs), are promising parallel platforms for highperformance computing.

Introduction Hardware accelerators, such as General-Purpose Graphics Processing Units (GPGPUs), are promising parallel platforms for highperformance computing.
An approach for solving the Helmholtz Equation on heterogeneous platforms An approach for solving the Helmholtz Equation on heterogeneous platforms G.

An approach for solving the Helmholtz Equation on heterogeneous platforms An approach for solving the Helmholtz Equation on heterogeneous platforms G.

Similar presentations

Ads by Google