Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model

Leader election in anonymous rings and complete networks is a very practical problem in distributed computing. Previous algorithms for this problem are generally designed for a classical message passing model where complex messages are exchanged. However, the need to send and receive complex messages makes such algorithms less practical for some real applications. We present some simple synchronous algorithms for distributed leader election in anonymous rings and complete networks that are inspired by the development of the neural system of the fruit fly. Our leader election algorithms all assume that only one-bit messages are broadcast by nodes in the network and processors are only able to distinguish between silence and the arrival of one or more messages. These restrictions allow implementations to use a simpler message-passing architecture. Even with these harsh restrictions our algorithms are shown to achieve good time and message complexity both analytically and experimentally.

Download Full-text

Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge

Parallel Processing Letters ◽

10.1142/s0129626417500025 ◽

2017 ◽

Vol 27 (02) ◽

pp. 1750002 ◽

Cited By ~ 1

Author(s):

Ajoy K. Datta ◽

Stephane Devismes ◽

Lawrence L. Larmore ◽

Vincent Villain

Keyword(s):

Upper Bound ◽

Message Passing ◽

A Priori ◽

Leader Election ◽

A Priori Knowledge ◽

Stabilization Time ◽

Global Parameter ◽

Priori Knowledge

We propose a deterministic silent self-stabilizing algorithm for the weak leader election problem in anonymous trees. Our algorithm is designed in the message passing model, and requires only O(1) bits of memory per edge. It does not necessitate the a priori knowledge of any global parameter on the network. Finally, its stabilization time is at most [Formula: see text] time units, where 𝒟 is the diameter of the network, X is an upper bound on the time to execute some recurrent code by processes, and Imax is the maximal number of messages initially in a link.

Download Full-text

HOMMEXX 1.0: a performance-portable atmospheric dynamical core for the Energy Exascale Earth System Model

Geoscientific Model Development ◽

10.5194/gmd-12-1423-2019 ◽

2019 ◽

Vol 12 (4) ◽

pp. 1423-1441 ◽

Cited By ~ 5

Author(s):

Luca Bertagna ◽

Michael Deakin ◽

Oksana Guba ◽

Daniel Sunderland ◽

Andrew M. Bradley ◽

...

Keyword(s):

Message Passing ◽

Message Passing Interface ◽

Earth System Model ◽

Parallel Execution ◽

System Model ◽

Earth System ◽

Dynamical Core ◽

Fortran Implementation ◽

Many Core ◽

Intel Xeon

Abstract. We present an architecture-portable and performant implementation of the atmospheric dynamical core (High-Order Methods Modeling Environment, HOMME) of the Energy Exascale Earth System Model (E3SM). The original Fortran implementation is highly performant and scalable on conventional architectures using the Message Passing Interface (MPI) and Open MultiProcessor (OpenMP) programming models. We rewrite the model in C++ and use the Kokkos library to express on-node parallelism in a largely architecture-independent implementation. Kokkos provides an abstraction of a compute node or device, layout-polymorphic multidimensional arrays, and parallel execution constructs. The new implementation achieves the same or better performance on conventional multicore computers and is portable to GPUs. We present performance data for the original and new implementations on multiple platforms, on up to 5400 compute nodes, and study several aspects of the single- and multi-node performance characteristics of the new implementation on conventional CPU (e.g., Intel Xeon), many core CPU (e.g., Intel Xeon Phi Knights Landing), and Nvidia V100 GPU.

Download Full-text