Long-lived Rambo: Trading knowledge for communication

  • Authors:

  • Chryssis Georgiou;Peter M. Musial;Alexander A. Shvartsman

  • Affiliations:

  • Department of Computer Science, University of Cyprus, 1678 Nicosia, Cyprus;Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06278, USA;Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06278, USA and Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, ...

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2007

Quantified Score

Hi-index 5.23

Visualization

Abstract

Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with efficiency in practical algorithms is difficult. A reconfigurable linearizable data service, called Rambo, was developed by Lynch and Shvartsman. This service guarantees consistency under dynamic conditions involving asynchrony, message loss, node crashes, and new node arrivals. The specification of the original algorithm is given at an abstract level aimed at concise presentation and formal reasoning about correctness. The algorithm propagates information by means of gossip messages. If the service is in use for a long time, the size and the number of gossip messages may grow without bound. This paper presents a consistent data service for long-lived objects that improves on Rambo in two ways: it includes an incremental communication protocol and a leave service. The new protocol takes advantage of the local knowledge, and carefully manages the size of messages by removing redundant information, while the leave service allows the nodes to leave the system gracefully. The new algorithm is formally proved correct by forward simulation using levels of abstraction. An experimental implementation of the system was developed for networks-of-workstations. The paper also includes selected analytical and preliminary empirical results that illustrate the advantages of the new algorithm.