Search Results - "Distributed-memory parallel algorithm"

PSelInv – A distributed memory parallel algorithm for selected inversion: The non-symmetric case by Jacquelin, Mathias, Lin, Lin, Yang, Chao

“…•Parallel selected inversion for non-symmetric sparse matrices.•High performance implementation on distributed memory platforms.•Experiments demonstrate…”
Get full text

PSelInv – A distributed memory parallel algorithm for selected inversion: The non-symmetric case by Jacquelin, Mathias, Lin, Lin, Yang, Chao

Get full text

An Asynchronous Distributed-Memory Parallel Algorithm for k-Mer Counting by Hati, Souvadra, Hayashi, Akihiro, Vuduc, Richard

“…This paper describes a new asynchronous algorithm and implementation for the problem of \boldsymbol{k} -mer counting (\text{KC}) , which concerns quantifying…”
Get full text

A parallel structured banded DC algorithm for symmetric eigenvalue problems by Li, Shengguo, Liao, Xia, Lu, Yutong, Roman, Jose E., Yue, Xiaoqiang

“…In this paper, a novel parallel structured divide-and-conquer (DC) algorithm is proposed for symmetric banded eigenvalue problems, denoted by PBSDC, which…”
Get full text

A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver by Abouali, O, Alishahi, M M

“…In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around…”
Get full text

A distributed memory parallel algorithm for the efficient computation of sensitivities of differential-algebraic systems by Keeping, B.R., Pantelides, C.C.

“…An efficient algorithm for the evaluation of the parametric sensitivities for mixed systems of differential and algebraic equations (DAEs) on computers…”
Get full text

PSelInv - A Distributed Memory Parallel Algorithm for Selected Inversion: the non-symmetric Case by Mathias Jacquelin, Lin, Lin, Yang, Chao

“…This paper generalizes the parallel selected inversion algorithm called PSelInv to sparse non- symmetric matrices. We assume a general sparse matrix A has been…”
Get full text

PSelInv -- A Distributed Memory Parallel Algorithm for Selected Inversion : the Symmetric Case by Mathias Jacquelin, Lin, Lin, Yang, Chao

“…We describe an efficient parallel implementation of the selected inversion algorithm for distributed memory computer systems, which we call \texttt{PSelInv}…”
Get full text

Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation by Bozdağ, Doruk, Çatalyürek, Ümt V., Gebremedhin, Assefaw H., Manne, Fredrik, Boman, Erik G., Özgüner, Füsun

“…The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater…”
Get full text

Asynchronous Distributed-Memory Parallel Algorithms for Influence Maximization by Singhal, Shubhendra Pal, Hati, Souvadra, Young, Jeffrey, Sarkar, Vivek, Hayashi, Akihiro, Vuduc, Richard

“… We propose distributed-memory parallel algorithms for the two main kernels of a state-of-the-art implementation of one IM algorithm, influence maximization via martingales (IMM…”
Get full text

DISTRIBUTED-MEMORY PARALLEL ALGORITHMS FOR DISTANCE-2 COLORING AND RELATED PROBLEMS IN DERIVATIVE COMPUTATION by BOZDAG, Doruk, CATALYUREK, Ümİt V, GEBREMEDHIN, Assefaw H, MANNE, Fredrik, BOMAN, Erik G, OZGUNER, Fusun

Get full text

Distributed Memory Parallel Algorithms for Minimum Spanning Trees by Loncar, Vladmir, Skrbic, Srdjan, Balaz, Antun

“…Finding a minimum spanning tree of a graph is a well known problem in graph theory with many practical applications. We study serial variants of Prim's and…”
Get full text

Fast Distributed Memory Parallel Algorithms for Finding Connected Components in Large Graphs by Khan, Maleq, Boddu, Sharon

“…Finding the connected components in a graph is a fundamental problem in graph theory and network science. A connected component in a graph is a maximal set of…”
Get full text

Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication by Ranawaka, Isuru, Hussain, Md Taufique, Block, Charles, Gerogiannis, Gerasimos, Torrellas, Josep, Azad, Ariful

“…We consider a sparse matrix-matrix multiplication (SpGEMM) setting where one matrix is square and the other is tall and skinny. This special variant,…”
Get full text

Fast de Bruijn Graph Compaction in Distributed Memory Environments by Pan, Tony, Nihalani, Rahul, Aluru, Srinivas

“… In this paper, we present a distributed memory parallel algorithm for simultaneous compaction of all chains in bi-directed de Bruijn graphs…”
Get full text

Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model by Alam, Maksudul, Khan, Maleq, Marathe, Madhav V.

“… In this paper, we present MPI-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model…”
Get full text

Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication by Ranawaka, Isuru, Hussain, Md Taufique, Block, Charles, Gerogiannis, Gerasimos, Torrellas, Josep, Azad, Ariful

“…We consider a sparse matrix-matrix multiplication (SpGEMM) setting where one matrix is square and the other is tall and skinny. This special variant, called…”
Get full text

Shared and distributed memory parallel algorithms to solve big data problems in biological, social network and spatial domain applications by Sharma, Rahil

“…Big data refers to information which cannot be processed and analyzed using traditional approaches and tools, due to 4 V's—sheer Volume, Velocity at which data…”
Get full text

Sequential and parallel algorithms for all-pair k-mismatch maximal common substrings by Chockalingam, Sriram P., Thankachan, Sharma V., Aluru, Srinivas

“…Identifying long pairwise maximal common substrings among a large set of sequences is a frequently used construct in computational biology, with applications…”
Get full text

Parallel Hierarchical Clustering using Rank-Two Nonnegative Matrix Factorization by Manning, Lawton, Ballard, Grey, Kannan, Ramakrishnan, Park, Haesun

“…Nonnegative Matrix Factorization (NMF) is an effective tool for clustering nonnegative data, either for computing a flat partitioning of a dataset or for…”
Get full text