#### Filter Results:

- Full text PDF available (49)

#### Publication Year

1986

2019

- This year (12)
- Last 5 years (32)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ümit V. Çatalyürek, Cevdet Aykanat
- IEEE Trans. Parallel Distrib. Syst.
- 1999

In this work, we show that the standard graph-partitioning based decomposition of sparse matrices does not reflect the actual communication volume requirement for parallel matrix-vector… (More)

- Bora Uçar, Cevdet Aykanat
- SIAM J. Scientific Computing
- 2004

This paper addresses the problem of one-dimensional partitioning of structurally unsymmetric square and rectangular sparse matrices for parallel matrix-vector and matrix-transposevector multiplies.… (More)

- Ümit V. Çatalyürek, Cevdet Aykanat
- Proceedings 15th International Parallel and…
- 2001

We propose a new hypergraph model for the decomposition of irregular computational domains. This work focuses on the decomposition of sparse matrices for parallel matrix-vector multiplication.… (More)

- Ümit V. Çatalyürek, Cevdet Aykanat
- Encyclopedia of Parallel Computing
- 2011

- Ümit V. Çatalyürek, Cevdet Aykanat, Bora Uçar
- SIAM J. Scientific Computing
- 2010

We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, each having unique… (More)

- Cevdet Aykanat, Ali Pinar, Ümit V. Çatalyürek
- SIAM J. Scientific Computing
- 2004

We investigate the problem of permuting a sparse rectangular matrix into blockdiagonal form. Block-diagonal form of a matrix grants an inherent parallelism for solving the deriving problem, as… (More)

- Ümit V. Çatalyürek, Cevdet Aykanat
- IRREGULAR
- 1996

Abs t r ac t . In this work, we show the deficiencies of the graph model for decomposing sparse matrices for parallel matrix-vector multiplication. Then, we propose two hypergraph models which avoid… (More)

- Ümit V. Çatalyürek, Cevdet Aykanat
- SC
- 2001

- Ali Pinar, Cevdet Aykanat
- J. Parallel Distrib. Comput.
- 2004

One-dimensional decompositionof nonuniformworkload arrays for optimal load balancing is investigated. The problemhas been studied in the literature as "chains-on-chains partitioning" problem. Despite… (More)

- Kadir Akbudak, Cevdet Aykanat
- SIAM J. Scientific Computing
- 2014

For outer-product–parallel sparse matrix-matrix multiplication (SpGEMM) of the form C=A×B, we propose three hypergraph models that achieve simultaneous partitioning of input and output matrices… (More)