Please use this identifier to cite or link to this item:
Title: Quorums over codes
Authors: Datta, Anwitaman 
Oggier, Frédérique 
Keywords: Engineering::Computer science and engineering
Issue Date: 2022
Source: Datta, A. & Oggier, F. (2022). Quorums over codes. Journal of Parallel and Distributed Computing, 161, 1-19.
Project: 2018- T1-002-076 
Journal: Journal of Parallel and Distributed Computing 
Abstract: We consider the design and analysis of quorum systems over erasure coded warm data (with low frequency of writes and accesses in general) to guarantee sequential consistency under a fail-stop model while supporting atomic read-modify-write operations by multiple clients. We propose a definition of asymmetric quorum systems that suit the framework of coded data by explicitly exploiting the structural properties of code and instantiate it over distinct families of coding strategies: maximum distance separable (MDS) codes and codes with locality, and we indicate a mechanism for synchronizing stale nodes using differential updates, which again exploits the code structures. The proposed quorum system’s behavior is analyzed theoretically, exploring several aspects: viability of quorums under node unavailability; contention of resources between read and write operations; and quorum load. We complement these theoretical exploration with simulation based experiments to quantify the behavior of the proposed mechanism. The overall study demonstrates the feasibility and practicality of quorums over codes under practicable assumptions for achieving a stringent form of consistency, specifically, sequential consistency, while the stored data is being mutated by potentially multiple processes that might read and then modify the existing data. We achieve this in-place, without having to resort to store multiple versions of the data.
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2021.11.002
Schools: School of Computer Science and Engineering 
School of Physical and Mathematical Sciences 
Rights: © 2021 Elsevier Inc. All rights reserved. This paper was published in Journal of Parallel and Distributed Computing and is made available with permission of Elsevier Inc.
Fulltext Permission: embargo_20240407
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Journal Articles
SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
  Until 2024-04-07
Accepted version1.26 MBAdobe PDFUnder embargo until Apr 07, 2024

Citations 50

Updated on Aug 28, 2023

Page view(s)

Updated on Sep 23, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.