Browsing by Keywords "Graph partitioning"
Now showing items 115 of 15

Adaptive decomposition and remapping algorithms for objectspaceparallel direct volume rendering of unstructured grids
(Academic Press, 200701)Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributedmemory architectures is investigated. The adaptive OS decomposition problem is modeled as a graph ... 
Cascadeaware partitioning of large graph databases
(Springer, 2019)Graph partitioning is an essential task for scalable data management and analysis. The current partitioning methods utilize the structure of the graph, and the query log if available. Some queries performed on the database ... 
An effective model to decompose linear programs for parallel solution
(Springer, 199608)Although inherent parallelism in the solution of block angulax Linear Programming (LP) problems has been exploited in many research works, the literature that addresses decomposing constraint matrices into block angular ... 
Exploiting locality in sparse matrixmatrix multiplication on manycore rchitectures
(IEEE Computer Society, 2017)Exploiting spatial and temporal localities is investigated for efficient rowbyrow parallelization of general sparse matrixmatrix multiplication (SpGEMM) operation of the form C=A,B on manycore architectures. Hypergraph ... 
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 ... 
A novel partitioning method for accelerating the block cimmino algorithm
(Society for Industrial and Applied Mathematics Publications, 2018)We propose a novel blockrow partitioning method in order to improve the convergence rate of the block Cimmino algorithm for solving general sparse linear systems of equations. The convergence rate of the block Cimmino ... 
Parallel direct and hybrid methods based on row block partitioning for solving sparse linear systems
(Bilkent University, 201708)Solving system of linear equations is a kernel operation in many scienti c and industrial applications. These applications usually give rise to linear systems in which the coe cient matrix is very large and sparse. The ... 
Partitioning models for scaling distributed graph computations
(Bilkent University, 201909)The focus of this thesis is intelligent partitioning models and methods for scaling the performance of parallel graph computations on distributedmemory systems. Distributed databases utilize graph partitioning to provide ... 
Partitioning models for scaling parallel sparse matrixmatrix multiplication
(Association for Computing Machinery, 2018)We investigate outerproductparallel, innerproductparallel, and rowbyrowproductparallel formulations of sparse matrixmatrix multiplication (SpGEMM) on distributed memory architectures. For each of these three ... 
Recursive bipartitioning models for performance improvement in sparse matrix computations
(Bilkent University, 201709)Sparse matrix computations are among the most important building blocks of linear algebra and arise in many scienti c and engineering problems. Depending on the problem type, these computations may be in the form of ... 
Reducing communication overhead in sparse matrix and tensor computations
(Bilkent University, 202008)Encapsulating multiple communication cost metrics, i.e., bandwidth and latency, is proven to be important in reducing communication overhead in the parallelization of sparse and irregular applications. Communication ... 
Scaling sparse matrixmatrix multiplication in the accumulo database
(Springer, 2020)We propose and implement a sparse matrixmatrix multiplication (SpGEMM) algorithm running on top of Accumulo’s iterator framework which enables high performance distributed parallelism. The proposed algorithm provides ... 
Sitebased partitioning and repartitioning techniques for parallel pagerank computation
(Institute of Electrical and Electronics Engineers, 201105)The PageRank algorithm is an important component in effective web search. At the core of this algorithm are repeated sparse matrixvector multiplications where the involved web matrices grow in parallel with the growth of ... 
Spatiotemporal graph and hypergraph partitioning models for sparse matrixvector multiplication on manycore architectures
(IEEE Computer Society, 2019)There exist graph/hypergraph partitioningbased row/column reordering methods for encoding either spatial or temporal locality for sparse matrixvector multiplication (SpMV) operations. Spatial and temporal hypergraph ...