Sciweavers

33 search results - page 2 / 7
» On the Scalability of Hypergraph Models for Sparse Matrix Pa...
Sort
View
EPEW
2005
Springer
13 years 11 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
IPPS
2000
IEEE
13 years 9 months ago
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
Leonid Oliker, Xiaoye S. Li, Gerd Heber, Rupak Bis...
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 1 days ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
ICCS
2009
Springer
13 years 12 months ago
Evaluation of Hierarchical Mesh Reorderings
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...
Michelle Mills Strout, Nissa Osheim, Dave Rostron,...
IMCSIT
2010
13 years 3 months ago
Assembling Recursively Stored Sparse Matrices
Abstract--Recently, we have introduced an approach to multicore computations on sparse matrices using recursive partitioning, called Recursive Sparse Blocks (RSB). In this document...
Michele Martone, Salvatore Filippone, Marcin Paprz...