Optimal deployment of eventually-serializable data services

L. Michel, A. Shvartsman, E. Sonderegger, P. van Hentenryck

Research output: Contribution to journalArticlepeer-review

Abstract

Providing consistent and fault-tolerant distributed object services is among the fundamental problems in distributed computing. To achieve fault-tolerance and to increase throughput, objects are replicated at different networked nodes. However, replication induces significant communication costs to maintain replica consistency. Eventually-Serializable Data Service (ESDS) has been proposed to reduce these costs and enable fast operations on data, while still providing guarantees that the replicated data will eventually be consistent. This paper reconsiders the deployment phase of ESDS, in which a particular implementation of communicating software components must be mapped onto a physical architecture. This deployment aims at minimizing the overall communication costs, while satisfying the constraints imposed by the protocol. Both MIP (Mixed Integer Programming) and CP (Constraint Programming) models are presented and applied to realistic ESDS instances. The experimental results indicate that both models can find optimal solutions and prove optimality. The CP model, however, provides orders of magnitude improvements in efficiency. The limitations of the MIP model and the critical aspects of the CP model are discussed. Symmetry breaking and parallel computing are also shown to bring significant benefits.

Original languageEnglish (US)
Pages (from-to)273-294
Number of pages22
JournalAnnals of Operations Research
Volume184
Issue number1
DOIs
StatePublished - Apr 2011
Externally publishedYes

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'Optimal deployment of eventually-serializable data services'. Together they form a unique fingerprint.

Cite this