Search Results - "distributed-memory algorithm"

CLAIRE: A DISTRIBUTED-MEMORY SOLVER FOR CONSTRAINED LARGE DEFORMATION DIFFEOMORPHIC IMAGE REGISTRATION by Mang, Andreas, Gholami, Amir, Davatzikos, Christos, Biros, George

“…With this work we release CLAIRE, a distributed-memory implementation of an effective solver for constrained large deformation diifeomorphic image registration…”
Get more information

A Sparsity-Aware Distributed-Memory Algorithm for Sparse-Sparse Matrix Multiplication by Hong, Yuxi, Buluc, Aydin

“…Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in many areas including graph algorithms, bioinformatics, algebraic multigrid…”
Get full text

A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark by Plimpton, S.J., Brightwell, R., Vaughan, C., Underwood, K.

“…The RandomAccess benchmark as defined by the high performance computing challenge (HPCC) tests the speed at which a machine can update the elements of a table…”
Get full text

Development and assessment of a parallel computing implementation of the Coarse Mesh Radiation Transport (COMET) method by Remley, Kyle, Rahnema, Farzad

“…•COMET code solves whole core reactor eigenvalue and power distribution problems.•The COMET method/code is extended for parallel computing.•An estimated…”
Get full text

A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs by Azad, Ariful, Buluc, Aydın, Li, Xiaoye S, Wang, Xinliang, Langguth, Johannes

“… To overcome this limitation, we propose a fully parallel distributed memory algorithm that first generates a perfect matching and then iteratively improves…”
Get full text

A sparsity-aware distributed-memory algorithm for sparse-sparse matrix multiplication by Hong, Yuxi, Aydin Buluc

“…Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in many areas including graph algorithms, bioinformatics, algebraic multigrid…”
Get full text

A vertex centric parallel algorithm for linear temporal logic model checking in Pregel by Xie, Miao, Yang, Qiusong, Zhai, Jian, Wang, Qing

“…Linear Temporal Logic (LTL) Model Checking is a very important and popular technique for the automatic verification of safety-critical hardware and software…”
Get full text

A distributed memory algorithm for 3-D FFTs by Costian, Calin R., Marinescu, Dan C.

“…The present paper begins with a survey of various up-to-date parallel 3-D FFT algorithms and proposes an algorithm for the parallel in-place 3-D FFTs on…”
Get full text

A Distributed Memory Algorithm for Lexicon Building by Hawking, David

“…A parallel algorithm for preparing word frequency concordances over two specified sets of documents from a collection is presented. Good parallel efficiency is…”
Get full text

Engineering a Distributed-Memory Triangle Counting Algorithm by Sanders, Peter, Uhl, Tim Niklas

“…Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do…”
Get full text

Communication-Efficient String Sorting by Bingmann, Timo, Sanders, Peter, Schimek, Matthias

“…There has been surprisingly little work on algorithms for sorting strings on distributed-memory parallel machines. We develop efficient algorithms for this…”
Get full text

A distributed memory algorithm for volume rendering by Tiwari, R., Huntsberger, T.L.

“… generate volumetric data in the near future. The paper presents a new distributed memory algorithm for volume rendering in a message-passing environment…”
Get full text

Scenario Decomposition for 0-1 Stochastic Programs: Improvements and Asynchronous Implementation by Ryan, Kevin, Rajan, Deepak, Ahmed, Shabbir

“…A recently proposed scenario decomposition algorithm for stochastic 0-1 programs finds an optimal solution by evaluating and removing individual solutions that…”
Get full text

Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs by Azad, Ariful, Buluc, Aydin

“…We design and implement scalable distributed-memory algorithms for maximum cardinality matching in bipartite graphs…”
Get full text

Comparison of distributed memory algorithms for X-ray wave propagation in inhomogeneous media by Ali, Sajid, Du, Ming, Adams, Mark F., Smith, Barry, Jacobsen, Chris

“…Calculations of X-ray wave propagation in large objects are needed for modeling diffractive X-ray optics and for optimization-based approaches to image…”
Get full text

Distributed Memory Algorithms for Weight Cancellation in Monte Carlo Particle Transport Simulations by Grablevsky, Nicholas, Belanger, Hunter

“…Recent literature has demonstrated use cases for Monte Carlo transport simulations where particles can have statistical weights that are positive or negative…”
Get full text

An Efficient RI-MP2 Algorithm for Distributed Many-GPU Architectures by Snowdon, Calum, Barca, Giuseppe M J

“… Our novel algorithm achieves near-peak performance on GPU-based supercomputers through the development of a distributed memory algorithm for forming RI-MP2 intermediate tensors with zero internode…”
Get more information

Distributed Memory Algorithms for High-Dimensional Data Embedding by Ranawaka, Isuru Janith

“…High-dimensional data embedding converts high-dimensional data into a lower-dimensional embedding space while preserving intrinsic structure as much as…”
Get full text

Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra by Azad, Ariful, Buluc, Aydin

“…We design and implement distributed-memory parallel algorithms for computing maximal cardinality matching in a bipartite graph. Relying on matrix algebra…”
Get full text

Massive-Parallel Implementation of the Resolution-of-Identity Coupled-Cluster Approaches in the Numeric Atom-Centered Orbital Framework for Molecular Systems by Shen, Tonghao, Zhu, Zhenyu, Zhang, Igor Ying, Scheffler, Matthias

“…(T), in the FHI-aims package for molecular systems. A domain-based distributed-memory algorithm in the MPI/OpenMP hybrid framework has been designed to effectively utilize the memory bandwidth and significantly minimize the interconnect communication…”
Get more information