Recent Developments in Iterative Methods for Reducing Synchronization

12/02/2019
by   Qinmeng Zou, et al.
0

On modern parallel architectures, the cost of synchronization among processors can often dominate the cost of floating-point computation. Several modifications of the existing methods have been proposed in order to keep the communication cost as low as possible. This paper aims at providing a brief overview of recent advances in parallel iterative methods for solving large-scale problems. We refer the reader to the related references for more details on the derivation, implementation, performance, and analysis of these techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/17/2017

Avoiding Synchronization in First-Order Methods for Sparse Convex Optimization

Parallel computing has played an important role in speeding up convex op...
research
01/15/2018

The Communication-Hiding Conjugate Gradient Method with Deep Pipelines

Krylov subspace methods are among the most efficient present-day solvers...
research
08/09/2019

Fast Tetrahedral Meshing in the Wild

We propose a new tetrahedral meshing technique, fTetWild, to convert tri...
research
10/03/2016

An overview about Networks-on-Chip with multicast suppor

Modern System-on-Chip (SoC) platforms typically consist of multiple proc...
research
03/29/2023

Statistical Methods for Microbiome Analysis: A brief review

Recent attacks of various viruses with having deep and extensive impact ...
research
10/24/2018

Scheduling computations with provably low synchronization overheads

Work Stealing has been a very successful algorithm for scheduling parall...

Please sign up or login with your details

Forgot password? Click here to reset