Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services

  • Laurent Michel
  • Pascal Van Hentenryck
  • Elaine Sonderegger
  • Alexander Shvartsman
  • Martijn Moraal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5547)

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 revisits ESDS instances where bandwidth constraints are imposed on segments of the network interconnect. This class of problems was shown to be extremely challenging for both Mixed Integer Programming (MIP) and for Constraint Programming (CP), some instances requiring hours of computation time. The paper presents an improved constraint programming model, a constraint-based local search model that can obtain high-quality solutions quickly and a local search/constraint programming hybrid. The experimental results indicate that the resulting models significantly improve the state of the art.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bastarrica, M., Demurjian, S., Shvartsman, A.: Software architectural specification for optimal object distribution. In: SCCC 1998: Proc. of the XVIII Int-l Conf. of the Chilean Computer Science Society, Washington, DC, USA (1998)Google Scholar
  2. 2.
    Bastarrica, M.C.: Architectural specification and optimal deployment of distributed systems. PhD thesis, University of Connecticut (2000)Google Scholar
  3. 3.
    Behrmann, G., David, A., Larsen, K., Möller, O., Pettersson, P., Yi, W.: UPPAAL - present and future. In: Proceedings of the 40th IEEE Conference on Decision and Control (CDC 2001), pp. 2881–2886 (2001)Google Scholar
  4. 4.
    Cheiner, O., Shvartsman, A.: Implementing an eventually-serializable data service as a distributed system building block. Networks in Distributed Computing 45, 43–71 (1999)CrossRefMATHGoogle Scholar
  5. 5.
    Fekete, A., Gupta, D., Luchangco, V., Lynch, N.A., Shvartsman, A.A.: Eventually-serializable data services. Theor. Comput. Sci. 220(1), 113–156 (1999)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    IETF. Domain name system, rfc 1034 and rfc 1035 (1990)Google Scholar
  7. 7.
    Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: The Theory of Timed I/O Automata. Synthesis Lectures in Computer Science. Morgan & Claypool Publishers (2006)Google Scholar
  8. 8.
    Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2), 134–152 (1997)CrossRefMATHGoogle Scholar
  9. 9.
    Lynch, N., Tuttle, M.: An introduction to Input/Output Automata. CWI-Quarterly 2(3), 219–246 (1989)MathSciNetMATHGoogle Scholar
  10. 10.
    Lynch, N.A., Garland, S., Kaynar, D., Michel, L., Shvartsman, A.: The Tempo Language User Guide and Reference Manual. VeroModo Inc. (December 2007), http://www.veromodo.com
  11. 11.
    Michel, L., Shvartsman, A.A., Sonderegger, E.L., Hentenryck, P.V.: Optimal deployment of eventually-serializable data services. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 188–202. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Michel, L., Shvartsman, A.A., Sonderegger, E.L., Hentenryck, P.V.: Optimal deployment of eventually-serializable data services. CPAIOR (2008); extended version of the CPAIOR 2008 paper (submitted) Google Scholar
  13. 13.
    Owre, S., Rajan, S., Rushby, J.M., Shankar, N., Srivas, M.K.: PVS: Combining specification, proof checking, and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 411–414. Springer, Heidelberg (1996)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Laurent Michel
    • 2
  • Pascal Van Hentenryck
    • 1
  • Elaine Sonderegger
    • 2
  • Alexander Shvartsman
    • 2
  • Martijn Moraal
    • 2
  1. 1.Brown UniversityProvidenceUSA
  2. 2.University of ConnecticutStorrsUSA

Personalised recommendations