Browsing by Keywords "Partitioning"
Now showing items 1-5 of 5
-
Balance preserving min-cut replication set for a K-way hypergraph partitioning
(Bilkent University, 2010)Replication is a widely used technique in information retrieval and database systems for providing fault-tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning ... -
Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains
(SIAM, 2000)Experimental results for large, sparse Markov chains, especially the ill-conditioned nearly completely decomposable (NCD) ones, are few. We believe there is need for further research in this area, specifically to aid in ... -
Parallel hardware and software implementations for electromagnetic computations
(Bilkent University, 2005)Multilevel fast multipole algorithm (MLFMA) is an accurate frequencydomain electromagnetics solver that reduces the computational complexity and memory requirement significantly. Despite the advantages of the MLFMA, ... -
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 large-scale parallel SpGEMM
(Bilkent University, 2016-12)Sparse matrix-matrix 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 ...
