scholarly journals Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems

2009 ◽  
pp. 358-359 ◽  
Author(s):  
Carole Delporte-Gallet ◽  
Hugues Fauconnier ◽  
Sam Toueg
Keyword(s):  
Message Passing ◽  
Failure Detector ◽  
Non Local

The minimum information about failures for solving non-local tasks in message-passing systems

2011 ◽  
Vol 24 (5) ◽  
pp. 255-269 ◽  
Author(s):  
Carole Delporte-Gallet ◽  
Hugues Fauconnier ◽  
Sam Toueg
Keyword(s):  
Message Passing ◽  
Minimum Information ◽  
Non Local

scholarly journals The Weakest Failure Detector for Message Passing Set-Agreement

2008 ◽  
pp. 109-120 ◽  
Author(s):  
Carole Delporte-Gallet ◽  
Hugues Fauconnier ◽  
Rachid Guerraoui ◽  
Andreas Tielmann
Keyword(s):  
Message Passing ◽  
Failure Detector ◽  
Set Agreement

scholarly journals Linear scaling Coulomb interaction in the multiwavelet basis, a parallel implementation

2014 ◽  
Vol 05 (supp01) ◽  
pp. 1441003 ◽  
Author(s):  
Stig Rune Jensen ◽  
Jonas Jusélius ◽  
Antoine Durdek ◽  
Tor Flå ◽  
Peter Wind ◽  
...  
Keyword(s):  
Electrostatic Potential ◽  
Message Passing ◽  
Message Passing Interface ◽  
Parallel Implementation ◽  
Integral Form ◽  
System Size ◽  
Linear Scaling ◽  
Electronic Density ◽  
Operator Structure ◽  
Non Local

We present a parallel and linear scaling implementation of the calculation of the electrostatic potential arising from an arbitrary charge distribution. Our approach is making use of the multi-resolution basis of multiwavelets. The potential is obtained as the direct solution of the Poisson equation in its Green's function integral form. In the multiwavelet basis, the formally non local integral operator decays rapidly to negligible values away from the main diagonal, yielding an effectively banded structure where the bandwidth is only dictated by the requested accuracy. This sparse operator structure has been exploited to achieve linear scaling and parallel algorithms. Parallelization has been achieved both through the shared memory (OpenMP) and the message passing interface (MPI) paradigm. Our implementation has been tested by computing the electrostatic potential of the electronic density of long-chain alkanes and diamond fragments showing (sub)linear scaling with the system size and efficent parallelization.

scholarly journals On the road to the weakest failure detector for k-set agreement in message-passing systems

2011 ◽  
Vol 412 (33) ◽  
pp. 4273-4284 ◽  
Author(s):  
François Bonnet ◽  
Michel Raynal
Keyword(s):  
Message Passing ◽  
Failure Detector ◽  
The Road ◽  
Set Agreement ◽  
On The Road

HPF LIBRARY AND COMPILER SUPPORT FOR HALOS IN DATA PARALLEL IRREGULAR COMPUTATIONS

2000 ◽  
Vol 10 (02n03) ◽  
pp. 189-200 ◽  
Author(s):  
THOMAS BRANDES
Keyword(s):  
Message Passing ◽  
High Performance ◽  
Parallel Programs ◽  
Address Space ◽  
Compiler Support ◽  
Data Parallel ◽  
High Performance Fortran ◽  
Non Local ◽  
Performance Results ◽  
Memory Architectures

On distributed memory architectures data parallel compilers emulate the global address space by distributing the data onto the processors according to the mapping directives of the user and by generating automatically explicit inter-processor communication. A shadow is additionally allocated local memory to keep on one processor also non-local values of the data that is accessed or defined by this processor. While shadow edges are already well studied for structured grids, this paper focuses on its use for applications with unstructured grids where updates on the shadow edges involve unstructured communication with complex communication schedules. The use of shadow edges is considered for High Performance Fortran (HPF) as the de facto standard language for writing data parallel programs in Fortran. A library with a HPF binding provides the explicit control of unstructured shadows and their communication schedules, also called halos. This halo library allows writing HPF programs with a performance close to hand-coded message-passing versions but where the user is freed of the burden to calculate shadow sizes and communication schedules and to do the exchanging of data with explicit message passing commands. In certain situations, the HPF compiler can create and use halos automatically. This paper shows the advantages and also the limits of this approach. The halo library and an automatic support of halos have been implemented within the ADAPTOR HPF compilation system. The performance results verify the effectiveness of the chosen approach.

Sign in / Sign up

Export Citation Format

Share Document