Abortable fork-linearizable storage

Matthias Majuntke, Dan Dobre, Marco Serafini, Neeraj Suri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

We address the problem of emulating a shared read/write memory in a message passing system using a storage server prone to Byzantine failures. Although cryptography can be used to ensure confidentiality and integrity of the data, nothing can prevent a malicious server from returning obsolete data. Fork-linearizability [1] guarantees that if a malicious server hides an update of some client from another client, then these two clients will never see each others' updates again. Fork-linearizability is arguably the strongest consistency property attainable in the presence of a malicious server. Recent work [2] has shown that there is no fork-linearizable shared memory emulation that supports wait-free operations. On the positive side, it has been shown that lock-based emulations exist [1,2]. Lock-based protocols are fragile because they are blocking if clients may crash. In this paper we present for the first time lock-free emulations of fork-linearizable shared memory. We have developed two protocols, Linear and Concur. With a correct server, both protocols guarantee linearizability and that every operation successfully completes in the absence of step contention, while interfering operations terminate by aborting. The Concur algorithm additionally ensures that concurrent operations invoked on different registers complete successfully.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages255-269
Number of pages15
Volume5923 LNCS
DOIs
Publication statusPublished - 31 Dec 2009
Externally publishedYes
Event13th International Conference on Principles of Distributed Systems, OPODIS 2009 - Nimes, France
Duration: 15 Dec 200918 Dec 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5923 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other13th International Conference on Principles of Distributed Systems, OPODIS 2009
CountryFrance
CityNimes
Period15/12/0918/12/09

Fingerprint

Linearizability
Servers
Server
Emulation
Shared Memory
Network protocols
Data storage equipment
Update
Wait-free
Strong Consistency
Confidentiality
Message passing
Crash
Terminate
Message Passing
Contention
Cryptography
Integrity
Concurrent
Computer systems

Keywords

  • Abortable objects
  • Fork-linearizability
  • Lock-freedom
  • Online collaboration
  • Shared memory

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Majuntke, M., Dobre, D., Serafini, M., & Suri, N. (2009). Abortable fork-linearizable storage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5923 LNCS, pp. 255-269). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5923 LNCS). https://doi.org/10.1007/978-3-642-10877-8_21

Abortable fork-linearizable storage. / Majuntke, Matthias; Dobre, Dan; Serafini, Marco; Suri, Neeraj.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5923 LNCS 2009. p. 255-269 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5923 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Majuntke, M, Dobre, D, Serafini, M & Suri, N 2009, Abortable fork-linearizable storage. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5923 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5923 LNCS, pp. 255-269, 13th International Conference on Principles of Distributed Systems, OPODIS 2009, Nimes, France, 15/12/09. https://doi.org/10.1007/978-3-642-10877-8_21
Majuntke M, Dobre D, Serafini M, Suri N. Abortable fork-linearizable storage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5923 LNCS. 2009. p. 255-269. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-10877-8_21
Majuntke, Matthias ; Dobre, Dan ; Serafini, Marco ; Suri, Neeraj. / Abortable fork-linearizable storage. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5923 LNCS 2009. pp. 255-269 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c624f15566b64228adcb0044571c5638,
title = "Abortable fork-linearizable storage",
abstract = "We address the problem of emulating a shared read/write memory in a message passing system using a storage server prone to Byzantine failures. Although cryptography can be used to ensure confidentiality and integrity of the data, nothing can prevent a malicious server from returning obsolete data. Fork-linearizability [1] guarantees that if a malicious server hides an update of some client from another client, then these two clients will never see each others' updates again. Fork-linearizability is arguably the strongest consistency property attainable in the presence of a malicious server. Recent work [2] has shown that there is no fork-linearizable shared memory emulation that supports wait-free operations. On the positive side, it has been shown that lock-based emulations exist [1,2]. Lock-based protocols are fragile because they are blocking if clients may crash. In this paper we present for the first time lock-free emulations of fork-linearizable shared memory. We have developed two protocols, Linear and Concur. With a correct server, both protocols guarantee linearizability and that every operation successfully completes in the absence of step contention, while interfering operations terminate by aborting. The Concur algorithm additionally ensures that concurrent operations invoked on different registers complete successfully.",
keywords = "Abortable objects, Fork-linearizability, Lock-freedom, Online collaboration, Shared memory",
author = "Matthias Majuntke and Dan Dobre and Marco Serafini and Neeraj Suri",
year = "2009",
month = "12",
day = "31",
doi = "10.1007/978-3-642-10877-8_21",
language = "English",
isbn = "3642108768",
volume = "5923 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "255--269",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Abortable fork-linearizable storage

AU - Majuntke, Matthias

AU - Dobre, Dan

AU - Serafini, Marco

AU - Suri, Neeraj

PY - 2009/12/31

Y1 - 2009/12/31

N2 - We address the problem of emulating a shared read/write memory in a message passing system using a storage server prone to Byzantine failures. Although cryptography can be used to ensure confidentiality and integrity of the data, nothing can prevent a malicious server from returning obsolete data. Fork-linearizability [1] guarantees that if a malicious server hides an update of some client from another client, then these two clients will never see each others' updates again. Fork-linearizability is arguably the strongest consistency property attainable in the presence of a malicious server. Recent work [2] has shown that there is no fork-linearizable shared memory emulation that supports wait-free operations. On the positive side, it has been shown that lock-based emulations exist [1,2]. Lock-based protocols are fragile because they are blocking if clients may crash. In this paper we present for the first time lock-free emulations of fork-linearizable shared memory. We have developed two protocols, Linear and Concur. With a correct server, both protocols guarantee linearizability and that every operation successfully completes in the absence of step contention, while interfering operations terminate by aborting. The Concur algorithm additionally ensures that concurrent operations invoked on different registers complete successfully.

AB - We address the problem of emulating a shared read/write memory in a message passing system using a storage server prone to Byzantine failures. Although cryptography can be used to ensure confidentiality and integrity of the data, nothing can prevent a malicious server from returning obsolete data. Fork-linearizability [1] guarantees that if a malicious server hides an update of some client from another client, then these two clients will never see each others' updates again. Fork-linearizability is arguably the strongest consistency property attainable in the presence of a malicious server. Recent work [2] has shown that there is no fork-linearizable shared memory emulation that supports wait-free operations. On the positive side, it has been shown that lock-based emulations exist [1,2]. Lock-based protocols are fragile because they are blocking if clients may crash. In this paper we present for the first time lock-free emulations of fork-linearizable shared memory. We have developed two protocols, Linear and Concur. With a correct server, both protocols guarantee linearizability and that every operation successfully completes in the absence of step contention, while interfering operations terminate by aborting. The Concur algorithm additionally ensures that concurrent operations invoked on different registers complete successfully.

KW - Abortable objects

KW - Fork-linearizability

KW - Lock-freedom

KW - Online collaboration

KW - Shared memory

UR - http://www.scopus.com/inward/record.url?scp=72749095250&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72749095250&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10877-8_21

DO - 10.1007/978-3-642-10877-8_21

M3 - Conference contribution

SN - 3642108768

SN - 9783642108761

VL - 5923 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 255

EP - 269

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -