Browsing by Author "Kayaaslan, E."
Now showing items 18 of 8

1.5D parallel sparse matrixvector multiply
Kayaaslan, E.; Aykanat, Cevdet; Uçar, B. (Society for Industrial and Applied Mathematics, 2018)There are three common parallel sparse matrixvector multiply algorithms: 1D rowparallel, 1D columnparallel, and 2D rowcolumnparallel. The 1D parallel algorithms offer the advantage of having only one communication ... 
Document replication strategies for geographically distributed web search engines
Kayaaslan, E.; Cambazoglu, B. B.; Aykanat, Cevdet (Elsevier Ltd., 2013)Largescale web search engines are composed of multiple data centers that are geographically distant to each other. Typically, a user query is processed in a data center that is geographically close to the origin of the ... 
Hypergraph partitioning based models and methods for exploiting cache locality in sparse matrixvector multiplication
Akbudak, K.; Kayaaslan, E.; Aykanat, Cevdet (Society for Industrial and Applied Mathematics, 20130227)Sparse matrixvector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity ... 
A hypergraph partitioning model for profile minimization
Acer, Seher; Kayaaslan, E.; Aykanat, Cevdet (Society for Industrial and Applied Mathematics Publications, 2019)In this paper, the aim is to symmetrically permute the rows and columns of a given sparse symmetric matrix so that the profile of the permuted matrix is minimized. We formulate this permutation problem by first defining ... 
Hypergraph partitioningbased fillreducing ordering for symmetric matrices
Çatalyürek, Ü. V.; Aykanat, Cevdet; Kayaaslan, E. (Society for Industrial and Applied Mathematics, 2011)A typical first step of a direct solver for the lin ear system Mx = b is reordering of the symmetric matrix M to improve execution time and space requirements of the solution process. In this work, we propose a novel ... 
Partitioning hypergraphs in scientific computing applications through vertex separators on graphs
Kayaaslan, E.; Pinar, A.; Çatalyürek, U.; Aykanat, Cevdet (Society for Industrial and Applied Mathematics, 2012)The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. ... 
A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
Acer, S.; Kayaaslan, E.; Aykanat, Cevdet (Society for Industrial and Applied Mathematics, 2013)We investigate the problem of symmetrically permuting a square sparse matrix into a block diagonal form with overlap. This permutation problem arises in the parallelization of an explicit formulation of the multiplicative ... 
A termbased inverted index partitioning model for efficient distributed query processing
Cambazoglu, B. B.; Kayaaslan, E.; Jonassen, S.; Aykanat, Cevdet (Association for Computing Machinery, 2013)In a sharednothing, distributed text retrieval system, queries are processed over an inverted index that is partitioned among a number of index servers. In practice, the index is either documentbased or termbased ...