Sciweavers

230 search results - page 7 / 46
» Sparse matrix factorization on massively parallel computers
Sort
View
EUROPAR
1997
Springer
15 years 3 months ago
A Relational Approach to the Compilation of Sparse Matrix Programs
Abstract. We present a relational algebra based framework for compiling e cient sparse matrix code from dense DO-ANY loops and a speci cation of the representation of the sparse ma...
Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
60
Voted
ICS
2009
Tsinghua U.
15 years 6 months ago
Pattern-based sparse matrix representation for memory-efficient SMVM kernels
Mehmet Belgin, Godmar Back, Calvin J. Ribbens
PPOPP
2012
ACM
13 years 7 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
97
Voted
FGCS
2006
122views more  FGCS 2006»
14 years 11 months ago
Conceptual interfaces in hypre
The hypre software library is being developed with the aim of providing scalable solvers for the solution of large, sparse linear systems on massively parallel computers. To this e...
Robert D. Falgout, Jim E. Jones, Ulrike Meier Yang