Filters








807 Hits in 4.6 sec

Improved Time Bounds for Linearizable Implementations of Abstract Data Types

Jiaqi Wang, Edward Talmage, Hyunyoung Lee, Jennifer L. Welch
2014 2014 IEEE 28th International Parallel and Distributed Processing Symposium  
We focus on the problem of implementing linearizable objects of arbitrary data types in message-passing systems with bounded, but uncertain, message delay and bounded, but non-zero, clock skew.  ...  Linearizability is a well-known consistency condition for shared objects in concurrent systems.  ...  Our goal is to find optimally fast implementations for linearizable shared objects of abstract data types. Background and our contributions.  ... 
doi:10.1109/ipdps.2014.77 dblp:conf/ipps/WangTLW14 fatcat:ugdqcethirclfibkpm53jf2htu

Sound, complete, and tractable linearizability monitoring for concurrent collections

Michael Emmi, Constantin Enea
2017 Proceedings of the ACM on Programming Languages  
In this work we identify a class of collection abstract data types which admit polynomial-time linearizability monitors.  ...  Given an implementation of an arbitrary abstract data type, checking whether the operations invoked in one single concurrent execution are linearizable, i.e., indistinguishable from an execution where  ...  COLLECTION TYPES In this section we identify a class of collection abstract data types which admit polynomial-time linearizability monitors.  ... 
doi:10.1145/3158113 dblp:journals/pacmpl/EmmiE18 fatcat:quxm3qgdgrh3zmqxeam77d5tgm

Sequential consistency versus linearizability

Hagit Attiya, Jennifer L. Welch
1994 ACM Transactions on Computer Systems  
For each of the three object types, we first prove lower bounds on the worst-case response time for sequentially consistent implementations.  ...  Again, there is one subsection for each of the three object types; each subsection consists of the lower bound(s) for sequential consistency followed by the upper bound(s) for linearizability  ... 
doi:10.1145/176575.176576 fatcat:a6wuqskvkrbetage6xumf6z3i4

Global-Local View: Scalable Consistency for Concurrent Data Types [article]

Deepthi Devaki Akkoorath, José Brandão, Annette Bieniusa, Carlos Baquero
2017 arXiv   pre-print
We show that it is possible to maintain thread-local views and to perform merge efficiently for several data types and evaluate their performance and scalability compared to linearizable implementations  ...  Further, we discuss the consistency semantics of the data types and the associated programming model.  ...  This gives flexibility for the data type semantics and the implementation of the underlying data structure.  ... 
arXiv:1705.03704v1 fatcat:kxghwrwrpbdufbfq6fyucjvivy

Global-Local View: Scalable Consistency for Concurrent Data Types [chapter]

Deepthi Akkoorath, José Brandão, Annette Bieniusa, Carlos Baquero
2018 Lecture Notes in Computer Science  
We show that it is possible to maintain thread-local views and to perform merge efficiently for several data types and evaluate their performance and scalability compared to linearizable implementations  ...  Further, we discuss the consistency semantics of the data types and the associated programming model.  ...  This gives flexibility for the data type semantics and the implementation of the underlying data structure.  ... 
doi:10.1007/978-3-319-96983-1_35 fatcat:au7x6iucfrgk7b4h7gp6ndcbjy

Consistency in Non-Transactional Distributed Storage Systems [article]

Paolo Viotti, Marko Vukolić
2016 arXiv   pre-print
" has been at the same time both weakened and blurred.  ...  While in the '80s "consistency" typically meant strong consistency, later defined also as linearizability, in recent years, with the advent of highly available and scalable systems, the notion of "consistency  ...  Acknowledgement We would like to thank Alysson Bessani, Christian Cachin, Marc Shapiro, and the anonymous reviewers for their helpful comments on this work.  ... 
arXiv:1512.00168v4 fatcat:nv7qzsrkmje6dpbxhztrmso2iu

Constant-Time Snapshots with Applications to Concurrent Data Structures [article]

Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun
2020 arXiv   pre-print
Our fast, flexible snapshots yield simple, efficient implementations of atomic multi-point queries on concurrent data structures built from CAS objects.  ...  We present an approach for efficiently taking snapshots of the state of a collection of CAS objects.  ...  abstract state of the abstract data type being implemented.  ... 
arXiv:2007.02372v3 fatcat:slcsbgtlxnc4vih53w42hdshsy

Verifying Linearizability of Intel® Software Guard Extensions [chapter]

Rebekah Leslie-Hurd, Dror Caspi, Matthew Fernandez
2015 Lecture Notes in Computer Science  
We show that this approach to verifying linearizability works well for validating SGX and that the compiler provides improved usability over encoding the problem in a model checker directly.  ...  The compiler determines an appropriate linearization point for each instruction, computes the required linearizability assertions, and supports experimentation with a variety of model configurations across  ...  -An abstract representation of "the other" EPCM entries on the machine. Accesses to EPCM entries by SGX instructions are symmetric, so we employ this abstraction for improved performance.  ... 
doi:10.1007/978-3-319-21668-3_9 fatcat:4z4rvqndrbfubchzxiup65vnny

Reconfigurable Lattice Agreement and Applications

Petr Kuznetsov, Thibault Rieutord, Sara Tucci-Piergiovanni, Michael Wagner
2020 International Conference on Principles of Distributed Systems  
Abstract data types. An abstract data type (ADT) is a tuple T = (A, B, Z, z 0 , τ, δ). Here A and B are countable sets called the inputs and outputs.  ...  Let us consider an abstract data type T = (A, B, Z, z 0 , τ, δ).  ...  Take, for example, the totally ordered lattice of a max-register. In this case, processes can directly return the state stored in LearnLB in line 11.  ... 
doi:10.4230/lipics.opodis.2019.31 dblp:conf/opodis/KuznetsovRP19 fatcat:4sflycd5ircaxfjvhqadgcy4om

Of Concurrent Data Structures and Iterations [chapter]

Yiannis Nikolakopoulos, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas
2015 Lecture Notes in Computer Science  
challenges in concurrent algorithmic data structure implementations, with respect to consistency and efficiency.  ...  In the sequential setting iterations are easy to design on top of an algorithmic construction of a data structure and is not considered as a challenge.  ...  The model allows to provide concurrent implementations of a container abstract data type (ADT) that represents a collection of items, including a set of update operations that modify the collection according  ... 
doi:10.1007/978-3-319-24024-4_20 fatcat:nzf73bgst5bf7hgoemw7yahcfy

Violat: Generating Tests of Observational Refinement for Concurrent Objects [chapter]

Michael Emmi, Constantin Enea
2019 Lecture Notes in Computer Science  
High-performance multithreaded software often relies on optimized implementations of common abstract data types (ADTs) like counters, key-value stores, and queues, i.e., concurrent objects.  ...  ., substitutability of a given ADT with a given implementation.  ...  ., optimized thread-safe implementations of common abstract data types (ADTs) like counters, key-value stores, and queues.  ... 
doi:10.1007/978-3-030-25543-5_30 fatcat:4apmejjvmbhxlpv6ok4j24xczy

Tractable Refinement Checking for Concurrent Objects

Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza
2015 Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15  
High-performance multithreaded software often relies on optimized implementations of common abstract data types (ADTs) like counters, key-value stores, and queues, i.e., concurrent objects.  ...  ., substitutability of a given ADT with a given implementation.  ...  ., optimized thread-safe implementations of common abstract data types (ADTs) like counters, key-value stores, and queues.  ... 
doi:10.1145/2676726.2677002 dblp:conf/popl/BouajjaniEEH15 fatcat:33rvcyg3sncupdgm3ta6yo5qqi

Verifying Linearizability via Optimized Refinement Checking

Yang Liu, Wei Chen, Yanhong A. Liu, Jun Sun, Shao Jie Zhang, Jin Song Dong
2013 IEEE Transactions on Software Engineering  
Linearizability is an important correctness criterion for implementations of concurrent objects.  ...  In this work, we describe a method to automatically check linearizability based on refinement relations from abstract specifications to concrete implementations.  ...  They prove that linearizability is decidable for a bounded number of operations.  ... 
doi:10.1109/tse.2012.82 fatcat:geuh3bdm6narpcpdy4tfjogmbm

Round-up: Runtime checking quasi linearizability of concurrent data structures

Lu Zhang, Arijit Chattopadhyay, Chao Wang
2013 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)  
We propose a new method for runtime checking of a relaxed consistency property called quasi linearizability for concurrent data structures.  ...  Our method is the first fully automated method for checking quasi linearizability in the unmodified C/C++ code of concurrent data structures.  ...  ACKNOWLEDGMENT The authors would like to thank Christoph Kirsch and Michael Lippautz of University of Salzburg for making the Scal benchmarks available and for promptly answering our questions.  ... 
doi:10.1109/ase.2013.6693061 dblp:conf/kbse/ZhangCW13 fatcat:3l4qqb534nhnbdh7akor45y7nq

Verifying a Quantitative Relaxation of Linearizability via Refinement [chapter]

Kiran Adhikari, James Street, Chao Wang, Yang Liu, ShaoJie Zhang
2013 Lecture Notes in Computer Science  
We propose the first method for formally verifying quasi linearizability of the implementation model of a concurrent data structure.  ...  Quasi linearizability is a quantitative relaxation of linearizability to allow more implementation freedom for performance optimization.  ...  We use the standard FIFO queue and two versions of quasi linearizable queues as examples. The construction needs to be tailored case by case for the different types of data structures.  ... 
doi:10.1007/978-3-642-39176-7_3 fatcat:2uzstfpnsrefrifog3pe6hcrga
« Previous Showing results 1 — 15 out of 807 results