165 search results - page 4 / 33 » Optimizing Matrix Multiplication on Heterogeneous Reconfigur... |
TVLSI
2010
14 years 6 months ago
2010
In many applications, a reduction of the amount of the original data or a representation of the original data by a small set of variables is often required. Among many techniques, ...
106
click to vote
FCCM
2007
IEEE
15 years 1 months ago
2007
IEEE
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
104
click to vote
ERSA
2007
15 years 1 months ago
2007
- Even though state-of-the-art FPGAs present new opportunities in exploring low-cost high-performance architectures for floating-point scientific applications, they also pose serio...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
104
click to vote
ICCS
2001
Springer
15 years 4 months ago
2001
Springer
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...