Year: 2017
Type: article
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 in which 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.
Authors: Yanhong A. Liu, Scott D. Stoller, Bo Lin
Institution: Stony Brook University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Awards: G1305027696, SHF: Medium:Performance Analysis and Optimization for Logic Rule Engines, Clarity and Efficiency in Design, From Clarity to Efficiency for Distributed Algorithms, CT-T: Proactive Techniques for Preserving System Integrity: A Basis for Robust Defense Against Malware, G6441118252, EAGER: From Clarity to Efficiency for Distributed Algorithms
OpenAlex ID: W2617632007