Sciweavers

189 search results - page 17 / 38
» Combining Multiple Kernels by Augmenting the Kernel Matrix
Sort
View
ICCS
2001
Springer
15 years 4 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
IPPS
2009
IEEE
15 years 6 months ago
Exploring the effect of block shapes on the performance of sparse kernels
In this paper we explore the impact of the block shape on blocked and vectorized versions of the Sparse Matrix-Vector Multiplication (SpMV) kernel and build upon previous work by ...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...
SPAA
1999
ACM
15 years 4 months ago
Recursive Array Layouts and Fast Parallel Matrix Multiplication
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
ASAP
2008
IEEE
118views Hardware» more  ASAP 2008»
15 years 6 months ago
Bit matrix multiplication in commodity processors
Registers in processors generally contain words or, with the addition of multimedia extensions, short vectors of subwords of bytes or 16-bit elements. In this paper, we view the c...
Yedidya Hilewitz, Cédric Lauradoux, Ruby B....
95
Voted
SAIG
2000
Springer
15 years 3 months ago
Code Generators for Automatic Tuning of Numerical Kernels: Experiences with FFTW
Achieving peak performance in important numerical kernels such as dense matrix multiply or sparse-matrix vector multiplication usually requires extensive, machine-dependent tuning ...
Rich Vuduc, James Demmel