Revisiting hypergraph models for sparse matrix partitioning

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage603en_US
dc.citation.issueNumber4en_US
dc.citation.spage595en_US
dc.citation.volumeNumber49en_US
dc.contributor.authorUçar, B.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.date.accessioned2016-02-08T10:10:58Z
dc.date.available2016-02-08T10:10:58Z
dc.date.issued2007en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractWe provide an exposition of hypergraph models for parallelizing sparse matrix-vector multiplies. Our aim is to emphasize the expressive power of hypergraph models. First, we set forth an elementary hypergraph model for the parallel matrix-vector multiply based on one-dimensional (1D) matrix partitioning. In the elementary model, the vertices represent the data of a matrix-vector multiply, and the nets encode dependencies among the data. We then apply a recently proposed hypergraph transformation operation to devise models for 1D sparse matrix partitioning. The resulting 1D partitioning models are equivalent to the previously proposed computational hypergraph models and are not meant to be replacements for them. Nevertheless, the new models give us insights into the previous ones and help us explain a subtle requirement, known as the consistency condition, of hypergraph partitioning models. Later, we demonstrate the flexibility of the elementary model on a few 1D partitioning problems that are hard to solve using the previously proposed models. We also discuss extensions of the proposed elementary model to two-dimensional matrix partitioning. © 2007 Society for Industrial and Applied Mathematics.en_US
dc.identifier.doi10.1137/060662459en_US
dc.identifier.issn0036-1445
dc.identifier.urihttp://hdl.handle.net/11693/23257
dc.language.isoEnglishen_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1137/060662459en_US
dc.source.titleSIAM Reviewen_US
dc.subjectHypergraph modelsen_US
dc.subjectParallel computingen_US
dc.subjectSparse matrix-vector multiplyen_US
dc.subjectComputer simulationen_US
dc.subjectMathematical modelsen_US
dc.subjectMatrix algebraen_US
dc.subjectVectorsen_US
dc.subjectParallel processing systemsen_US
dc.titleRevisiting hypergraph models for sparse matrix partitioningen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Revisiting hypergraph models for sparse matrix partitioning.pdf
Size:
405.94 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Computer Engineering