Efficiency of asynchronous parallel algorithms
Parallel Asynchronous Algorithms III. Application, Performances
Article REF: AF1387 V1
Efficiency of asynchronous parallel algorithms
Parallel Asynchronous Algorithms III. Application, Performances

Authors : Pierre SPITERI, Jean-Claude MIELLOU

Publication date: October 10, 2021 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

2. Efficiency of asynchronous parallel algorithms

In this section, we analyze, with reference to applications and associated parallel simulations, when synchronous or asynchronous methods are worth using. Beforehand, we give some indicators for measuring the performance of parallel algorithms.

2.1 Cluster-based performance measurement

To measure performance in terms of reduced job rendering time on multi-processor machines, a number of indicators can be used to measure the gain (or otherwise) obtained when using a parallel calculator. The ideal case is when the ratio of sequential time to parallel time (i.e. acceleration) is equal to the number of processors. However, except in special cases, this cannot practically be the case, as parallelizing a calculation code requires the activation of processors, which...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?


Ongoing reading
Efficiency of asynchronous parallel algorithms

Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details