Sciweavers

416 search results - page 19 / 84
» A Paradigm for Parallel Matrix Algorithms:
Sort
View
EUROPAR
2003
Springer
15 years 4 months ago
RECSY - A High Performance Library for Sylvester-Type Matrix Equations
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
Isak Jonsson, Bo Kågström
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
15 years 15 days ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee
ISPDC
2010
IEEE
14 years 9 months ago
Pretty Good Accuracy in Matrix Multiplication with GPUs
—With systems such as Road Runner, there is a trend in super computing to offload parallel tasks to special purpose co-processors, composed of many relatively simple scalar proc...
Matthew Badin, Lubomir Bic, Michael B. Dillencourt...
EUROPAR
2005
Springer
15 years 4 months ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
88
Voted
PPOPP
1997
ACM
15 years 3 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon