From Clarity to Efficiency for Distributed Algorithms

TL;DR

This paper introduces a high-level language for describing distributed algorithms with complex synchronization, along with novel optimizations that enable efficient implementation by incremental updates, demonstrated through a prototype compiler.

Contribution

It presents the first general method for efficient implementation of logic quantifications in high-level distributed algorithm descriptions.

Findings

Successfully implemented a prototype compiler and optimizations.

Applied the language to various important distributed algorithms.

Achieved efficient execution through incremental updates of synchronization conditions.

Abstract

This article describes a very high-level language for clear description of distributed algorithms and optimizations necessary for generating efficient implementations. The language supports high-level control flows where complex synchronization conditions can be expressed using high-level queries, especially logic quantifications, over message history sequences. Unfortunately, the programs would be extremely inefficient, including consuming unbounded memory, if executed straightforwardly. We present new optimizations that automatically transform complex synchronization conditions into incremental updates of necessary auxiliary values as messages are sent and received. The core of the optimizations is the first general method for efficient implementation of logic quantifications. We have developed an operational semantics of the language, implemented a prototype of the compiler and the optimizations, and successfully used the language and implementation on a variety of important distributed algorithms.