# Ümit V. Çatalyürek

Georgia Institute of Technology

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication

- Ümit V. Çatalyürek, C. Aykanat
- Computer Science
- IEEE Trans. Parallel Distrib. Syst.
- 1 July 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… Expand

Parallel hypergraph partitioning for scientific computing

- K. Devine, E. Boman, R. Heaphy, R. Bisseling, Ümit V. Çatalyürek
- Computer Science
- Proceedings 20th IEEE International Parallel…
- 25 April 2006

Graph partitioning is often used for load balancing in parallel computing, but it is known that hypergraph partitioning has several advantages. First, hypergraphs more accurately model communication… Expand

PaToH (Partitioning Tool for Hypergraphs)

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

Benchmarking short sequence mapping tools

- Ayat Hatem, D. Bozdag, A. Toland, Ümit V. Çatalyürek
- Computer Science, Medicine
- IEEE International Conference on Bioinformatics…
- 7 June 2013

BackgroundThe development of next-generation sequencing instruments has led to the generation of millions of short sequences in a single run. The process of aligning these reads to a reference genome… Expand

A comparative analysis of biclustering algorithms for gene expression data

- K. Eren, M. Deveci, Onur Küçüktunç, Ümit V. Çatalyürek
- Medicine, Computer Science
- Briefings Bioinform.
- 1 May 2013

The need to analyze high-dimension biological data is driving the development of new data mining methods. Biclustering algorithms have been successfully applied to gene expression data to discover… Expand

A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L

- A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, Ümit V. Çatalyürek
- Computer Science
- ACM/IEEE SC Conference (SC'05)
- 12 November 2005

Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth- first search (BFS)… Expand

Permuting Sparse Rectangular Matrices into Block-Diagonal Form

- C. Aykanat, Ali Pinar, Ümit V. Çatalyürek
- Computer Science, Mathematics
- SIAM J. Sci. Comput.
- 1 June 2004

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

Histopathological Image Analysis Using Model-Based Intermediate Representations and Color Texture: Follicular Lymphoma Grading

- O. Sertel, J. Kong, Ümit V. Çatalyürek, G. Lozanski, J. Saltz, M. Gürcan
- Computer Science
- J. Signal Process. Syst.
- 1 April 2009

Follicular lymphoma (FL) is a cancer of lymph system and it is the second most common lymphoid malignancy in the western world. Currently, the risk stratification of FL relies on histological grading… Expand

Graph coloring algorithms for multi-core and massively multithreaded architectures

- Ümit V. Çatalyürek, J. Feo, A. Gebremedhin, M. Halappanavar, A. Pothen
- Computer Science
- Parallel Comput.
- 16 May 2012

We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance… Expand

Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi

- E. Saule, K. Kaya, Ümit V. Çatalyürek
- Computer Science
- PPAM
- 5 February 2013

Intel Xeon Phi is a recently released high-performance coprocessor which features 61 cores each supporting 4 hardware threads with 512-bit wide SIMD registers achieving a peak theoretical performance… Expand