Compressed Multiple-Row Storage Format

Details Compressed Multiple-Row Storage Format Compressed Multiple-Row Storage Format

2012-03-13

arxiv.org/abs/1203.2946v1

Physics

Computational Physics

17 pages, 3 figures

Scientific paper

A new format for storing sparse matrices is proposed for efficient sparse matrix-vector (SpMV) product calculation on modern throughput-oriented computer architectures. This format extends the standard compressed row storage (CRS) format and is easily convertible to and from it without any memory overhead. Computational performance of an SpMV kernel for the new format is determined for over 140 sparse matrices on two Fermi-class graphics processing units (GPUs) and the efficiency of the kernel, which peaks at 36 and 25 GFLOPS at single and double precision, respectively, is compared with that of five existing generic algorithms and industrial implementations. The efficiency of the new format is also measured as a function of the mean (\mu) and of the standard deviation (\sigma) of the number of matrix nonzero elements per row. The largest speedup is found for matrices with \mu > 20 and \mu > \sigma > 1.5 and can be as high as 43%.

Affiliated with

Also associated with

No associations

Rating

Compressed Multiple-Row Storage Format does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compressed Multiple-Row Storage Format, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed Multiple-Row Storage Format will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-714983