Výsledky vyhľadávania - "communication-avoiding algorithms"
-
1
Communication Avoiding Algorithms: Analysis and Code Generation for Parallel Systems
ISSN: 1089-795XVydavateľské údaje: IEEE 01.10.2015Vydané v 2015 International Conference on Parallel Architecture and Compilation (PACT) (01.10.2015)“… The class of .5D communication-avoiding algorithms were developed to address this bottleneck…”
Získať plný text
Konferenčný príspevok.. -
2
A massively parallel tensor contraction framework for coupled-cluster computations
ISSN: 0743-7315, 1096-0848Vydavateľské údaje: Elsevier Inc 01.12.2014Vydané v Journal of parallel and distributed computing (01.12.2014)“…Precise calculation of molecular electronic wavefunctions by methods such as coupled-cluster requires the computation of tensor contractions, the cost of which…”
Získať plný text
Journal Article -
3
A Class of Communication-avoiding Algorithms for Solving General Dense Linear Systems on CPU/GPU Parallel Machines
ISSN: 1877-0509, 1877-0509Vydavateľské údaje: Elsevier B.V 2012Vydané v Procedia computer science (2012)“…We study several solvers for the solution of general linear systems where the main objective is to reduce the communication overhead due to pivoting. We first…”
Získať plný text
Journal Article -
4
Communication avoiding algorithms
ISBN: 9781467362184, 1467362182Vydavateľské údaje: IEEE 01.11.2012Vydané v 2012 SC Companion: High Performance Computing, Networking, Storage and Analysis (SCC) (01.11.2012)“…This article consists of a collection of slides from the author's conference presentation. Some of the specific areas/topics discussed include: To redesign…”
Získať plný text
Konferenčný príspevok.. -
5
Communication-Avoiding Algorithms for a High-Performance Hyperbolic Pde Engine
Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2020“…The study of waves has always been an important subject of research. Earthquakes, for example, have a direct impact on the daily lives of millions of people…”
Získať plný text
Dissertation -
6
Multiscale high-order/low-order (HOLO) algorithms and applications
ISSN: 0021-9991, 1090-2716Vydavateľské údaje: Cambridge Elsevier Inc 01.02.2017Vydané v Journal of computational physics (01.02.2017)“…We review the state of the art in the formulation, implementation, and performance of so-called high-order/low-order (HOLO) algorithms for challenging…”
Získať plný text
Journal Article -
7
Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides
ISSN: 0895-4798, 1095-7162Vydavateľské údaje: Society for Industrial and Applied Mathematics 01.01.2024Vydané v SIAM journal on matrix analysis and applications (01.01.2024)“…Block low-rank (BLR) compression can significantly reduce the memory and time costs of parallel sparse direct solvers. In this paper, we investigate the…”
Získať plný text
Journal Article -
8
Parallel Fast Multipole Method accelerated FFT on HPC clusters
ISSN: 0167-8191, 1872-7336Vydavateľské údaje: Elsevier B.V 01.07.2021Vydané v Parallel computing (01.07.2021)“… In the past decade there has been a growing interest in communication-avoiding algorithms. The distributed memory Fast Fourier Transform is an important algorithm which suffers from major communication bottlenecks…”
Získať plný text
Journal Article -
9
Multiscale high-order/low-order (HOLO) algorithms and applications
ISSN: 0021-9991, 1090-2716Vydavateľské údaje: United States Elsevier 11.11.2016Vydané v Journal of computational physics (11.11.2016)“…Here, we review the state of the art in the formulation, implementation, and performance of so-called high-order/low-order (HOLO) algorithms for challenging…”
Získať plný text
Journal Article -
10
Communication-Avoiding Recursive Aggregation
ISSN: 2168-9253Vydavateľské údaje: IEEE 31.10.2023Vydané v Proceedings / IEEE International Conference on Cluster Computing (31.10.2023)“…Recursive aggregation has been of considerable interest due to its unifying a wide range of deductive-analytic workloads, including social-media mining and…”
Získať plný text
Konferenčný príspevok.. -
11
Translational process: Mathematical software perspective
ISSN: 1877-7503, 1877-7511Vydavateľské údaje: Netherlands Elsevier B.V 01.05.2021Vydané v Journal of computational science (01.05.2021)“…Each successive generation of computer architecture has brought new challenges to achieving high performance mathematical solvers, necessitating development…”
Získať plný text
Journal Article -
12
Accelerating solutions of one-dimensional unsteady PDEs with GPU-based swept time–space decomposition
ISSN: 0021-9991, 1090-2716Vydavateľské údaje: Cambridge Elsevier Inc 15.03.2018Vydané v Journal of computational physics (15.03.2018)“…•A GPU implementation of the swept time–space decomposition rule is presented.•Three versions of the scheme are considered.•The shared-memory implementation…”
Získať plný text
Journal Article -
13
Reconstructing Householder vectors from Tall-Skinny QR
ISSN: 0743-7315, 1096-0848Vydavateľské údaje: United States Elsevier Inc 01.11.2015Vydané v Journal of parallel and distributed computing (01.11.2015)“…The Tall-Skinny QR (TSQR) algorithm is more communication efficient than the standard Householder algorithm for QR decomposition of matrices with many more…”
Získať plný text
Journal Article -
14
Applying the swept rule for solving explicit partial differential equations on heterogeneous computing systems
ISSN: 0920-8542, 1573-0484Vydavateľské údaje: New York Springer US 01.02.2021Vydané v The Journal of supercomputing (01.02.2021)“…Applications that exploit the architectural details of high-performance computing (HPC) systems have become increasingly invaluable in academia and industry…”
Získať plný text
Journal Article -
15
Reducing Communication in Graph Neural Network Training
ISSN: 2167-4329Vydavateľské údaje: United States IEEE 01.11.2020Vydané v International Conference for High Performance Computing, Networking, Storage and Analysis (Online) (01.11.2020)“…Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this…”
Získať plný text
Konferenčný príspevok.. Journal Article -
16
Topics in communication avoiding algorithms and stability analysis
ISBN: 9781303932564, 1303932563Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2014“…High performance linear algebra kernels are essential for scientific computing. Fast, accurate, and robust algorithms are required to process the large amount…”
Získať plný text
Dissertation -
17
Communication-Avoiding Symmetric-Indefinite Factorization
ISSN: 0895-4798, 1095-7162Vydavateľské údaje: United States SIAM 01.01.2014Vydané v SIAM journal on matrix analysis and applications (01.01.2014)“…We describe and analyze a novel symmetric triangular factorization algorithm. The algorithm is essentially a block version of Aasen's triangular…”
Získať plný text
Journal Article -
18
Communication-avoiding algorithms for linear algebra and beyond
ISBN: 146736066X, 9781467360661ISSN: 1530-2075Vydavateľské údaje: IEEE 01.05.2013Vydané v 2013 IEEE 27th International Symposium on Parallel and Distributed Processing (01.05.2013)“…Algorithms have two costs: arithmetic and communication, i.e. moving data between levels of a memory hierarchy or processors over a network. Communication…”
Získať plný text
Konferenčný príspevok.. -
19
Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance
“…Communication-avoiding algorithms allow redundant computations to minimize the number of inter-process communications…”Vydavateľské údaje: IEEE 01.04.2016
Získať plný text
Konferenčný príspevok.. -
20
Fast and robust communication avoiding algorithms: current status and future prospects
ISBN: 1450337236, 9781450337236Vydavateľské údaje: New York, NY, USA ACM 15.11.2015Vydané v Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (15.11.2015)“…In this talk I address one of the main challenges in high performance computing which is the increased cost of communication with respect to computation, where…”
Získať plný text
Konferenčný príspevok..

