6105 search results - page 186 / 1221 » A Parallel Algorithm for Bound-Smoothing |
168
click to vote
ICPP
2008
IEEE
16 years 23 days ago
2008
IEEE
We identify the challenges that are special to parallel sparse matrix-matrix multiplication (PSpGEMM). We show that sparse algorithms are not as scalable as their dense counterpar...
130
Voted
PARA
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
174
click to vote
ICS
1994
Tsinghua U.
15 years 10 months ago
1994
Tsinghua U.
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
153
click to vote
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
166
click to vote
PARELEC
2006
IEEE
16 years 10 days ago
2006
IEEE
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor arr...