Sciweavers

8 search results - page 2 / 2
» On Improving the Memory Access Patterns During The Execution...
Sort
View
PPAM
2005
Springer
13 years 10 months ago
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
Pavel Tvrdík, Ivan Simecek
DAMON
2009
Springer
13 years 6 months ago
k-ary search on modern processors
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner
PC
2010
196views Management» more  PC 2010»
13 years 3 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak