Sciweavers

230 search results - page 23 / 46
» Sparse matrix factorization on massively parallel computers
Sort
View
ISPASS
2009
IEEE
15 years 4 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
ISCIS
2003
Springer
15 years 2 months ago
Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices
Abstract. We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partitioning of sparse matrices for parallel processing. In the first phase...
Bora Uçar, Cevdet Aykanat
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 9 months ago
Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile a...
Emmanuel Agullo, Henricus Bouwmeester, Jack Dongar...
ACIVS
2006
Springer
15 years 3 months ago
Dedicated Hardware for Real-Time Computation of Second-Order Statistical Features for High Resolution Images
We present a novel dedicated hardware system for the extraction of second-order statistical features from high-resolution images. The selected features are based on gray level co-o...
Dimitris G. Bariamis, Dimitrios K. Iakovidis, Dimi...
70
Voted
CCGRID
2004
IEEE
15 years 1 months ago
High performance LU factorization for non-dedicated clusters
This paper describes an implementation of parallel LU factorization. The focus is to achieve high performance on non-dedicated clusters, where the number of available computing re...
Toshio Endo, Kenji Kaneda, Kenjiro Taura, Akinori ...