A Multilevel Approach for the Performance Analysis of Parallel Algorithms

01/14/2019
by   Luisa D'Amore, et al.
0

We provide a multilevel approach for analysing performances of parallel algorithms. The main outcome of such approach is that the algorithm is described by using a set of operators which are related to each other according to the problem decomposition. Decomposition level determines the granularity of the algorithm. A set of block matrices (decomposition and execution) highlights fundamental characteristics of the algorithm, such as inherent parallelism and sources of overheads.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2020

MGARD+: Optimizing Multilevel Methods for Error-bounded Scientific Data Reduction

Data management is becoming increasingly important in dealing with the l...
research
04/06/2022

Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening

Given a graph, finding the distance-2 maximal independent set (MIS-2) of...
research
06/07/2022

Inexact and primal multilevel FETI-DP methods: a multilevel extension and interplay with BDDC

We study a framework that allows to solve the coarse problem in the FETI...
research
03/06/2020

Neural networks approach for mammography diagnosis using wavelets features

A supervised diagnosis system for digital mammogram is developed. The di...
research
12/19/2019

On the stability of Scott-Zhang type operators and application to multilevel preconditioning in fractional diffusion

We provide an endpoint stability result for Scott-Zhang type operators i...
research
07/12/2019

Equal bi-Vectorized (EBV) method to high performance on GPU

Due to importance of reducing of time solution in numerical codes, we pr...
research
08/04/2021

Local Fourier analysis of Balancing Domain Decomposition by Constraints algorithms

Local Fourier analysis is a commonly used tool for the analysis of multi...

Please sign up or login with your details

Forgot password? Click here to reset