Filters








363 Hits in 2.2 sec

Sequential consistency versus linearizability

Hagit Attiya, Jennifer L. Welch
1994 ACM Transactions on Computer Systems  
Sequential Conwtency versus Llnearizability . 121  ...  Sequential Consistency versus Linearizability . 95 node application process Call B Response I MCS process send message b receive message network , , Fig. 1.  ... 
doi:10.1145/176575.176576 fatcat:a6wuqskvkrbetage6xumf6z3i4

Sequentially consistent versus linearizable counting networks

Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
2008 Distributed computing  
are to be totally ruled out for speci c applications that rely critically on either sequential consistency or linearizability.  ...  We compare the impact of timing conditions on implementing sequentially consistent and linearizable counters using counting networks in distributed systems.  ...  linearizability from sequential consistency.  ... 
doi:10.1007/s00446-008-0066-0 fatcat:mptziphjabeqbayt423e5xejdq

Sequentially consistent versus linearizable counting networks

Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
1999 Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing - PODC '99  
are to be totally ruled out for speci c applications that rely critically on either sequential consistency or linearizability.  ...  We compare the impact of timing conditions on implementing sequentially consistent and linearizable counters using counting networks in distributed systems.  ...  linearizability from sequential consistency.  ... 
doi:10.1145/301308.301342 dblp:conf/podc/MavronicolasMT99 fatcat:tvundvjllvejjmlzamrx2fnhdm

Monitoring Weak Consistency [chapter]

Michael Emmi, Constantin Enea
2018 Lecture Notes in Computer Science  
consistency criterion of linearizability.  ...  linearizability checking algorithm, which does not enumerate visibilities.  ...  Empirical comparison of (left) standard linearizability checking versus just-intime linearizability checking on concurrent traces of Java data structures; and (right) weak-consistency checking versus standard  ... 
doi:10.1007/978-3-319-96145-3_26 fatcat:hjzthincdzd5fawbdebmejvyoy

Consistency in Non-Transactional Distributed Storage Systems [article]

Paolo Viotti, Marko Vukolić
2016 arXiv   pre-print
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  ...  We overview more than 50 different consistency notions, ranging from linearizability to eventual and weak consistency, defining precisely many of these, in particular where the previous definitions were  ...  Like linearizability, sequential consistency enforces a common global order of operations.  ... 
arXiv:1512.00168v4 fatcat:nv7qzsrkmje6dpbxhztrmso2iu

Line-up

Sebastian Burckhardt, Chris Dern, Madanlal Musuvathi, Roy Tan
2010 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation - PLDI '10  
It is complete, because any reported violation proves that the implementation is not linearizable with respect to any sequential deterministic specification.  ...  The key insight of this paper is that if a component is intended to be deterministic, then it is possible to build an automatic linearizability checker by systematically enumerating the sequential behaviors  ...  [15] , or sequential consistency [16] .  ... 
doi:10.1145/1806596.1806634 dblp:conf/pldi/BurckhardtDMT10 fatcat:cjzsukuekng7lajsha7lg2cnaq

In the Search of Optimal Concurrency [article]

Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi
2016 arXiv   pre-print
Implementing a concurrent data structure typically begins with defining its sequential specification.  ...  A program's concurrency is defined here as its ability to accept concurrent schedules, i.e., interleavings of steps of its sequential implementation.  ...  LS-linearizability versus other criteria LS-linearizability is a two-level consistency criterion which makes it suitable to compare concurrent implementations of a sequential data structure, regardless  ... 
arXiv:1603.01384v1 fatcat:i6bru3syt5eobhloeh4a2zllra

Linearizability: a correctness condition for concurrent objects

Maurice P. Herlihy, Jeannette M. Wing
1990 ACM Transactions on Programming Languages and Systems  
objects, given they are linearizable.  ...  It permits a high degree of concurrency, yet it permits programmers to specify and reason about concurrent objects using known techniques from the sequential domain.  ...  ACKNOWLEDGMENTS The authors thank Jim Horning, Leslie Lamport, Larry Rudolph, and William Weihl for lively verbal and electronic discussions about our notions of linearizability and correctness.  ... 
doi:10.1145/78969.78972 fatcat:nrwykdb3pjcmnf5ye6llcvsvaq

Faster linearizability checking via P-compositionality [article]

Alex Horn, Daniel Kroening
2015 arXiv   pre-print
Linearizability is a well-established consistency and correctness criterion for concurrent data types.  ...  linearizable.  ...  The input to a linearizability checker consists of a sequential specification of a data type and a certain partially ordered set of operations, called a history.  ... 
arXiv:1504.00204v1 fatcat:fx54uy4di5gxfiu6phqhnu2abe

Faster Linearizability Checking via P-Compositionality [chapter]

Alex Horn, Daniel Kroening
2015 Lecture Notes in Computer Science  
Linearizability is a well-established consistency and correctness criterion for concurrent data types.  ...  linearizable.  ...  The input to a linearizability checker consists of a sequential specification of a data type and a certain partially ordered set of operations, called a history.  ... 
doi:10.1007/978-3-319-19195-9_4 fatcat:ytzwtyliobdqbdi7eezy43xzyy

Optimism for Boosting Concurrency [article]

Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi
2015 arXiv   pre-print
In this paper, we compare the level of concurrency one can obtain by converting a sequential program into a concurrent one using optimistic or pessimistic techniques.  ...  LS-linearizability versus other criteria.  ...  We begin by defining a novel consistency criterion, namely locally-serializable linearizability.  ... 
arXiv:1203.4751v8 fatcat:7pf6pognandedj47jwuts5yub4

High performance state-machine replication

Parisa Jalili Marandi, Marco Primi, Fernando Pedone
2011 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN)  
This execution is not linearizable but it is sequentially consistent.  ...  Linearizability can be contrasted with sequential consistency, a weaker form of consistency: An execution is sequentially consistent if there is a way to reorder the commands in a sequence that (i) respects  ... 
doi:10.1109/dsn.2011.5958258 dblp:conf/dsn/MarandiPP11 fatcat:rbdwp5ecafdfpeonlub7dimqoy

Quantifiability: Concurrent Correctness from First Principles [article]

Victor Cook, Christina Peterson, Zachary Painter, Damian Dechev
2019 arXiv   pre-print
worst case verification complexity of generating sequential histories motivate a new approach to concurrent correctness.  ...  Desiderata for a new correctness condition are that it be independent of sequential histories, compositional, flexible as to timing, modular as to semantics and free of inherent locking or waiting.  ...  Sequentially Consistent Not Quantifiable Serializable histories where methods are not conserved Quiescently Consistent Linearizable B.  ... 
arXiv:1905.06421v3 fatcat:577jyhhhgbewxf437mjplb7mj4

Proving Linearizability via Branching Bisimulation [article]

Xiaoxiao Yang and Joost-Pieter Katoen and Huimin Lin and Hao Wu
2016 arXiv   pre-print
Linearizability and progress properties are key correctness notions for concurrent objects.  ...  However, model checking linearizability has suffered from the PSPACE-hardness of the trace inclusion problem.  ...  Acknowledgement We thank the CADP support team for their helps and patience during 13:12 Proving Linearizability via Branching Bisimulation the experiments.  ... 
arXiv:1609.07546v5 fatcat:w4t2kwitanftlijtcy3wdk6l74

PREP-UC

Gaetano C. Coccimiglio, Trevor A. Brown, Srivatsan Ravi
2022 Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures  
In this work we design and implement both a buffered durable linearizable and a durable linearizable PUC based on the node replication UC.  ...  Universal constructions (UCs) which produce a concurrent object given a sequential object, have been studied extensively in the space of volatile shared memory as a means of more easily implementing correct  ...  PREP-UC versus Hand-Crafted Hashtable.  ... 
doi:10.1145/3490148.3538568 fatcat:devqmkh5vvd5tpzysizbfvvoci
« Previous Showing results 1 — 15 out of 363 results