Next Article in Journal
A Feature-Weighted SVR Method Based on Kernel Space Feature
Next Article in Special Issue
Generalized Paxos Made Byzantine (and Less Complex)
Previous Article in Journal
Vessel Traffic Risk Assessment Based on Uncertainty Analysis in the Risk Matrix
Previous Article in Special Issue
Computing Fault-Containment Times of Self-Stabilizing Algorithms Using Lumped Markov Chains
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(5), 61; https://doi.org/10.3390/a11050061

Relaxed Data Types as Consistency Conditions

Department of Computer Science & Engineering, Texas A&M University, College Station, TX 77843, USA
This paper is an extended version of our paper published in 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS).
These authors contributed equally to this work.
*
Author to whom correspondence should be addressed.
Received: 27 February 2018 / Revised: 25 April 2018 / Accepted: 2 May 2018 / Published: 4 May 2018
Full-Text   |   PDF [293 KB, uploaded 4 May 2018]

Abstract

In the quest for higher-performance shared data structures, weakening consistency conditions and relaxing the sequential specifications of data types are two of the primary tools available in the literature today. In this paper, we show that these two approaches are in many cases different ways to specify the same sets of allowed concurrent behaviors of a given shared data object. This equivalence allows us to use whichever description is clearer, simpler, or easier to achieve equivalent guarantees. Specifically, for three common data type relaxations, we define consistency conditions such that the combination of the new consistency condition and an unrelaxed type allows the same behaviors as Linearizability and the relaxed version of the data type. Conversely, for the consistency condition k-Atomicity, we define a new data type relaxation such that the behaviors allowed by the relaxed version of a data type, combined with Linearizability, are the same as those allowed by k-Atomicity and the original type. As an example of the possibilities opened by our new equivalence, we use standard techniques from the literature on consistency conditions to prove that the three data type relaxations we consider are not comparable to one another or to several similar known conditions. Finally, we show a particular class of data types where one of our newly-defined consistency conditions is comparable to, and stronger than, one of the known consistency conditions we consider. View Full-Text
Keywords: distributed data structures; relaxations; consistency conditions distributed data structures; relaxations; consistency conditions
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Talmage, E.; Welch, J.L. Relaxed Data Types as Consistency Conditions . Algorithms 2018, 11, 61.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top