Browsing by Keywords "Combinatorial scientific computing"
Now showing items 111 of 11

1.5D parallel sparse matrixvector multiply
(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 ... 
Hypergraph partitioningbased fillreducing ordering for symmetric matrices
(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 ... 
Improving performance of sparse matrix dense matrix multiplication on largescale parallel systems
(Elsevier BV, 2016)We propose a comprehensive and generic framework to minimize multiple and different volumebased communication cost metrics for sparse matrix dense matrix multiplication (SpMM). SpMM is an important kernel that finds ... 
Latencycentric models and methods for scaling sparse operations
(Bilkent University, 201608)Parallelization of sparse kernels and operations on largescale distributed memory systems remains as a major challenge due to everincreasing scale of modern high performance computing systems and multiple con icting ... 
ON twodimensional sparse matrix partitioning: models, methods, and a recipe
(Society for Industrial and Applied Mathematics, 2010)We consider twodimensional partitioning of general sparse matrices for parallel sparse matrixvector multiply operation. We present three hypergraphpartitioningbased methods, each having unique advantages. The first one ... 
Parallelization of Sparse Matrix Kernels for big data applications
(Springer, 2016)Analysis of big data on largescale distributed systems often necessitates efficient parallel graph algorithms that are used to explore the relationships between individual components. Graph algorithms use the basic adjacency ... 
Partitioning hypergraphs in scientific computing applications through vertex separators on graphs
(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
(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 recursive graph bipartitioning algorithm by vertex separators with fixed vertices for permuting sparse matrices into block diagonal form with overlap
(Bilkent University, 2011)Solving sparse system of linear equations Ax=b using preconditioners can be effi ciently parallelized using graph partitioning tools. In this thesis, we investigate the problem of permuting a sparse matrix into a block ... 
A Recursive Hypergraph Bipartitioning Framework for Reducing Bandwidth and Latency Costs Simultaneously
(IEEE Computer Society, 2017)Intelligent partitioning models are commonly used for efficient parallelization of irregular applications on distributed systems. These models usually aim to minimize a single communication cost metric, which is either ... 
Reducing communication volume overhead in largescale parallel SpGEMM
(Bilkent University, 201612)Sparse matrixmatrix multiplication of the form of C = A x B, C = A x A and C = A x AT is a key operation in various domains and is characterized with high complexity and runtime overhead. There exist models for parallelizing ...