Sciweavers

36 search results - page 2 / 8
» Hypergraph Partitioning for Faster Parallel PageRank Computa...
Sort
View
PDP
2010
IEEE
13 years 11 months ago
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning
Abstract—We investigate the scalability of the hypergraphbased sparse matrix partitioning methods with respect to the increasing sizes of matrices and number of nonzeros. We prop...
Bora Ucar, Ümit V. Çatalyürek
IPPS
2000
IEEE
13 years 9 months ago
The Parallelization of a Knowledge Discovery System with Hypergraph Representation
Abstract. Knowledge discovery is a time-consuming and space intensive endeavor. By distributing such an endeavor, we can diminish both time and space. System INDEDpronounced indee...
Jennifer Seitzer, James P. Buckley, Yi Pan, Lee A....
SIAMSC
2010
210views more  SIAMSC 2010»
12 years 11 months ago
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...
Ümit V. Çatalyürek, Cevdet Aykana...
IPPS
2007
IEEE
13 years 11 months ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
PODC
2010
ACM
13 years 8 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer