Výsledky vyhledávání - "Distributed memory algorithm"
-
1
CLAIRE: A DISTRIBUTED-MEMORY SOLVER FOR CONSTRAINED LARGE DEFORMATION DIFFEOMORPHIC IMAGE REGISTRATION
ISSN: 1064-8275Vydáno: 01.01.2019Vydáno v SIAM journal on scientific computing (01.01.2019)“…With this work we release CLAIRE, a distributed-memory implementation of an effective solver for constrained large deformation diifeomorphic image registration…”
Zjistit podrobnosti o přístupu
Journal Article -
2
A Sparsity-Aware Distributed-Memory Algorithm for Sparse-Sparse Matrix Multiplication
Vydáno: IEEE 17.11.2024Vydáno v SC24: International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“…Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in many areas including graph algorithms, bioinformatics, algebraic multigrid…”
Získat plný text
Konferenční příspěvek -
3
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
ISBN: 1424403278, 9781424403271ISSN: 1552-5244Vydáno: IEEE 01.09.2006Vydáno v 2006 IEEE International Conference on Cluster Computing (01.09.2006)“…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…”
Získat plný text
Konferenční příspěvek -
4
Development and assessment of a parallel computing implementation of the Coarse Mesh Radiation Transport (COMET) method
ISSN: 0306-4549, 1873-2100Vydáno: Elsevier Ltd 01.04.2018Vydáno v Annals of nuclear energy (01.04.2018)“…•COMET code solves whole core reactor eigenvalue and power distribution problems.•The COMET method/code is extended for parallel computing.•An estimated…”
Získat plný text
Journal Article -
5
A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 04.09.2020Vydáno v arXiv.org (04.09.2020)“… To overcome this limitation, we propose a fully parallel distributed memory algorithm that first generates a perfect matching and then iteratively improves…”
Získat plný text
Paper -
6
A sparsity-aware distributed-memory algorithm for sparse-sparse matrix multiplication
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 26.08.2024Vydáno v arXiv.org (26.08.2024)“…Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in many areas including graph algorithms, bioinformatics, algebraic multigrid…”
Získat plný text
Paper -
7
A vertex centric parallel algorithm for linear temporal logic model checking in Pregel
ISSN: 0743-7315, 1096-0848Vydáno: Elsevier Inc 01.11.2014Vydáno v Journal of parallel and distributed computing (01.11.2014)“…Linear Temporal Logic (LTL) Model Checking is a very important and popular technique for the automatic verification of safety-critical hardware and software…”
Získat plný text
Journal Article -
8
A distributed memory algorithm for 3-D FFTs
ISSN: 0377-0427, 1879-1778Vydáno: Amsterdam Elsevier B.V 01.01.1996Vydáno v Journal of computational and applied mathematics (01.01.1996)“…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…”
Získat plný text
Journal Article Konferenční příspěvek -
9
A Distributed Memory Algorithm for Lexicon Building
ISSN: 0743-7315, 1096-0848Vydáno: San Diego, CA Elsevier Inc 10.07.1997Vydáno v Journal of parallel and distributed computing (10.07.1997)“…A parallel algorithm for preparing word frequency concordances over two specified sets of documents from a collection is presented. Good parallel efficiency is…”
Získat plný text
Journal Article -
10
Engineering a Distributed-Memory Triangle Counting Algorithm
ISSN: 1530-2075Vydáno: IEEE 01.05.2023Vydáno v Proceedings - IEEE International Parallel and Distributed Processing Symposium (01.05.2023)“…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…”
Získat plný text
Konferenční příspěvek -
11
Communication-Efficient String Sorting
ISSN: 1530-2075Vydáno: IEEE 01.05.2020Vydáno v Proceedings - IEEE International Parallel and Distributed Processing Symposium (01.05.2020)“…There has been surprisingly little work on algorithms for sorting strings on distributed-memory parallel machines. We develop efficient algorithms for this…”
Získat plný text
Konferenční příspěvek -
12
A distributed memory algorithm for volume rendering
ISBN: 0818656808, 9780818656804Vydáno: IEEE Comput. Soc. Press 1994Vydáno v Proceedings of the Scalable High-Performance Computing Conference, May 23-25, 1994, Knoxville, Tennessee (1994)“… generate volumetric data in the near future. The paper presents a new distributed memory algorithm for volume rendering in a message-passing environment…”
Získat plný text
Konferenční příspěvek -
13
Scenario Decomposition for 0-1 Stochastic Programs: Improvements and Asynchronous Implementation
Vydáno: IEEE 01.05.2016Vydáno v 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (01.05.2016)“…A recently proposed scenario decomposition algorithm for stochastic 0-1 programs finds an optimal solution by evaluating and removing individual solutions that…”
Získat plný text
Konferenční příspěvek -
14
Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs
ISSN: 1530-2075Vydáno: IEEE 01.05.2016Vydáno v Proceedings - IEEE International Parallel and Distributed Processing Symposium (01.05.2016)“…We design and implement scalable distributed-memory algorithms for maximum cardinality matching in bipartite graphs…”
Získat plný text
Konferenční příspěvek -
15
Comparison of distributed memory algorithms for X-ray wave propagation in inhomogeneous media
ISSN: 1094-4087, 1094-4087Vydáno: United States Optical Society of America (OSA) 28.09.2020Vydáno v Optics express (28.09.2020)“…Calculations of X-ray wave propagation in large objects are needed for modeling diffractive X-ray optics and for optimization-based approaches to image…”
Získat plný text
Journal Article -
16
Distributed Memory Algorithms for Weight Cancellation in Monte Carlo Particle Transport Simulations
ISSN: 2100-014X, 2101-6275, 2100-014XVydáno: Les Ulis EDP Sciences 01.01.2024Vydáno v EPJ Web of conferences (01.01.2024)“…Recent literature has demonstrated use cases for Monte Carlo transport simulations where particles can have statistical weights that are positive or negative…”
Získat plný text
Journal Article Konferenční příspěvek -
17
An Efficient RI-MP2 Algorithm for Distributed Many-GPU Architectures
ISSN: 1549-9626, 1549-9626Vydáno: United States 12.11.2024Vydáno v Journal of chemical theory and computation (12.11.2024)“… 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…”
Zjistit podrobnosti o přístupu
Journal Article -
18
Distributed Memory Algorithms for High-Dimensional Data Embedding
ISBN: 9798314896259Vydáno: ProQuest Dissertations & Theses 01.01.2025“…High-dimensional data embedding converts high-dimensional data into a lower-dimensional embedding space while preserving intrinsic structure as much as…”
Získat plný text
Dissertation -
19
Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra
ISSN: 1552-5244Vydáno: IEEE 01.09.2015Vydáno v Proceedings / IEEE International Conference on Cluster Computing (01.09.2015)“…We design and implement distributed-memory parallel algorithms for computing maximal cardinality matching in a bipartite graph. Relying on matrix algebra…”
Získat plný text
Konferenční příspěvek -
20
Massive-Parallel Implementation of the Resolution-of-Identity Coupled-Cluster Approaches in the Numeric Atom-Centered Orbital Framework for Molecular Systems
ISSN: 1549-9626, 1549-9626Vydáno: United States 10.09.2019Vydáno v Journal of chemical theory and computation (10.09.2019)“…(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…”
Zjistit podrobnosti o přístupu
Journal Article

