Search Results

Documents authored by Shapiro, Marc

Document
DOI: 10.4230/DagRep.8.2.101
Data Consistency in Distributed Systems: Algorithms, Programs, and Databases (Dagstuhl Seminar 18091)

Authors: Annette Bieniusa, Alexey Gotsman, Bettina Kemme, and Marc Shapiro

Published in: Dagstuhl Reports, Volume 8, Issue 2 (2018)

Abstract
For decades distributed computing has been mainly an academic subject. Today, it has become mainstream: our connected world demands applications that are inherently distributed, and the usage of shared, distributed, peer-to-peer or cloud-computing infrastructures are increasingly common. However, writing distributed applications that are both correct and well distributed (e.g., highly available) is extremely challenging. In fact, there exists a fundamental trade-off between data consistency, availability, and the ability to tolerate failures. This trade-off has implications on the design of the entire distributed computing infrastructure, including storage systems, compilers and runtimes, application development frameworks and programming languages. Unfortunately, this also has significant implications on the programming model exposed to the designers and developers of applications. We need to enable programmers who are not experts in these subtle aspects to build distributed applications that remain correct in the presence of concurrency, failures, churn, replication, dynamically-changing and partial information, high load, absence of a single line of time, etc. This Dagstuhl Seminar proposes to bring together researchers and practitioners in the areas of distributed systems, programming languages, verifications, and databases. We would like to understand the lessons learnt in building scalable and correct distributed systems, the design patterns that have emerged, and explore opportunities for distilling these into programming methodologies, programming tools, and languages to make distributed computing easier and more accessible. Main issues in discussion: Application writers are constantly making trade-offs between consistency and availability. What kinds of tools and methodologies can we provide to simplify this decision making? How does one understand the implications of a design choice? Available systems are hard to design, test and debug. Do existing testing and debugging tools suffice for identifying and isolating bugs due to weak consistency? How can these problems be identified in production using live monitoring? Can we formalize commonly desired (generic) correctness (or performance) properties? How can we teach programmers about these formalisms and make them accessible to a wide audience? Can we build verification or testing tools to check that systems have these desired correctness properties? How do applications achieve the required properties, while ensuring adequate performance, in practice? What design patterns and idioms work well? To what degree can these properties be guaranteed by the platform (programming language, libraries, and runtime system)? What are the responsibilities of the application developer, and what tools and information does she have?
Cite as

Annette Bieniusa, Alexey Gotsman, Bettina Kemme, and Marc Shapiro. Data Consistency in Distributed Systems: Algorithms, Programs, and Databases (Dagstuhl Seminar 18091). In Dagstuhl Reports, Volume 8, Issue 2, pp. 101-121, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Article{bieniusa_et_al:DagRep.8.2.101,
  author =	{Bieniusa, Annette and Gotsman, Alexey and Kemme, Bettina and Shapiro, Marc},
  title =	{{Data Consistency in Distributed Systems: Algorithms, Programs, and Databases (Dagstuhl Seminar 18091)}},
  pages =	{101--121},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{2},
  editor =	{Bieniusa, Annette and Gotsman, Alexey and Kemme, Bettina and Shapiro, Marc},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.2.101},
  URN =		{urn:nbn:de:0030-drops-92923},
  doi =		{10.4230/DagRep.8.2.101},
  annote =	{Keywords: consistency, CRDTs, Distributed Algorithms, distributed computing, Distributed Systems, partitioning, replication, Strong Consistency, transactions, Weak Consistency}
}
Document
Invited Paper
DOI: 10.4230/LIPIcs.CONCUR.2016.3
Consistency in 3D (Invited Paper)

Authors: Marc Shapiro, Masoud Saeida Ardekani, and Gustavo Petri

Published in: LIPIcs, Volume 59, 27th International Conference on Concurrency Theory (CONCUR 2016)

Abstract
Comparisons of different consistency models often try to place them in a linear strong-to-weak order. However this view is clearly inadequate, since it is well known, for instance, that Snapshot Isolation and Serialisability are incomparable. In the interest of a better understanding, we propose a new classification, along three dimensions, related to: a total order of writes, a causal order of reads, and transactional composition of multiple operations. A model may be stronger than another on one dimension and weaker on another. We believe that this new classification scheme is both scientifically sound and has good explicative value. The current paper presents the three-dimensional design space intuitively.
Cite as

Marc Shapiro, Masoud Saeida Ardekani, and Gustavo Petri. Consistency in 3D (Invited Paper). In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 3:1-3:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{shapiro_et_al:LIPIcs.CONCUR.2016.3,
  author =	{Shapiro, Marc and Ardekani, Masoud Saeida and Petri, Gustavo},
  title =	{{Consistency in 3D}},
  booktitle =	{27th International Conference on Concurrency Theory (CONCUR 2016)},
  pages =	{3:1--3:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-017-0},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{59},
  editor =	{Desharnais, Jos\'{e}e and Jagadeesan, Radha},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.3},
  URN =		{urn:nbn:de:0030-drops-61889},
  doi =		{10.4230/LIPIcs.CONCUR.2016.3},
  annote =	{Keywords: Consistency models, replicated data, structural invariants, correctness of distributed systems}
}
Document
DOI: 10.4230/DagRep.3.2.92
Consistency in Distributed Systems (Dagstuhl Seminar 13081)

Authors: Bettina Kemme, Ganesan Ramalingam, André Schiper, Marc Shapiro, and Kapil Vaswani

Published in: Dagstuhl Reports, Volume 3, Issue 2 (2013)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 13081 "Consistency in Distributed Systems."
Cite as

Bettina Kemme, Ganesan Ramalingam, André Schiper, Marc Shapiro, and Kapil Vaswani. Consistency in Distributed Systems (Dagstuhl Seminar 13081). In Dagstuhl Reports, Volume 3, Issue 2, pp. 92-126, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{kemme_et_al:DagRep.3.2.92,
  author =	{Kemme, Bettina and Ramalingam, Ganesan and Schiper, Andr\'{e} and Shapiro, Marc and Vaswani, Kapil},
  title =	{{Consistency in Distributed Systems (Dagstuhl Seminar 13081)}},
  pages =	{92--126},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{2},
  editor =	{Kemme, Bettina and Ramalingam, Ganesan and Schiper, Andr\'{e} and Shapiro, Marc and Vaswani, Kapil},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.2.92},
  URN =		{urn:nbn:de:0030-drops-40146},
  doi =		{10.4230/DagRep.3.2.92},
  annote =	{Keywords: Replication, Consistency, Strong Consistency, Weak Consistency, Distributed Systems, Distributed Algorithms}
}
Document
DOI: 10.4230/DagRep.2.7.56
Security and Dependability for Federated Cloud Platforms (Dagstuhl Seminar 12281)

Authors: Rüdiger Kapitza, Matthias Schunter, Marc Shapiro, Paulo Verissimo, and Michael Waidner

Published in: Dagstuhl Reports, Volume 2, Issue 7 (2013)

Abstract
From July 8-13, 2012, the Dagstuhl Seminar "Security and Dependability for Federated Cloud Platforms" was held in Schloss Dagstuhl -- Leibniz Center for Informatics. During this seminar, participants presented their current research and discussed open problems in the fields of security and dependability of infrastructure clouds and their federation. The executive summary and abstracts of the talks given during the seminar are put together in this paper.
Cite as

Rüdiger Kapitza, Matthias Schunter, Marc Shapiro, Paulo Verissimo, and Michael Waidner. Security and Dependability for Federated Cloud Platforms (Dagstuhl Seminar 12281). In Dagstuhl Reports, Volume 2, Issue 7, pp. 56-72, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@Article{kapitza_et_al:DagRep.2.7.56,
  author =	{Kapitza, R\"{u}diger and Schunter, Matthias and Shapiro, Marc and Verissimo, Paulo and Waidner, Michael},
  title =	{{Security and Dependability for Federated Cloud Platforms (Dagstuhl Seminar 12281)}},
  pages =	{56--72},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{2},
  number =	{7},
  editor =	{Kapitza, R\"{u}diger and Schunter, Matthias and Shapiro, Marc and Verissimo, Paulo and Waidner, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.7.56},
  URN =		{urn:nbn:de:0030-drops-37352},
  doi =		{10.4230/DagRep.2.7.56},
  annote =	{Keywords: Security, Cloud computing, Virtual systems, Dependability, Grid computing, Systems management}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact