371 Hits in 3.1 sec

Linearizable Implementations Do Not Suffice for Randomized Distributed Computation [article]

Wojciech Golab and Lisa Higham and Philipp Woelfel
2011 arXiv   pre-print
We show that linearizability does not suffice for this purpose when processes can exploit randomization, and we discuss the existence of alternative correctness conditions.  ...  Linearizability is the gold standard among algorithm designers for deducing the correctness of a distributed algorithm using implemented shared objects from the correctness of the corresponding algorithm  ...  Acknowledgments We are grateful to the anonymous referees of STOC 2011 for their comments. Thanks also to Faith Ellen for her detailed feedback.  ... 
arXiv:1103.4690v2 fatcat:egxfpumjijbm3oviippzrokb7e

Intermediate Value Linearizability: A Quantitative Correctness Criterion

Arik Rinberg, Idit Keidar, Hagit Attiya
2020 International Symposium on Distributed Computing  
To illustrate the power of this result, we give a straightforward and efficient concurrent implementation of an (ε, δ)-bounded CountMin sketch, which is IVL (albeit not linearizable).  ...  This paper focuses on correctness criteria for concurrent implementations of such objects.  ...  Acknowledgements We thank Hagit Attiya and Gadi Taubenfeld for their insightful comments, and the anonymous reviewers for their detailed feedback.  ... 
doi:10.4230/lipics.disc.2020.2 dblp:conf/wdag/RinbergK20 fatcat:nu3fhf25hjgopd3qd6nrajnuma

Intermediate Value Linearizability: A Quantitative Correctness Criterion [article]

Arik Rinberg, Idit Keidar
2020 arXiv   pre-print
Finally, we show that IVL allows for inherently cheaper implementations than linearizable ones.  ...  To illustrate the power of this result, we give a straightforward and efficient concurrent implementation of an (e, d)-bounded CountMin sketch, which is IVL (albeit not linearizable).  ...  Note that since we require a common linearization under all coin flip vectors, we do not need to strengthen IVL for randomized settings in the manner that strong linearizability strengthens linearizability  ... 
arXiv:2006.12889v1 fatcat:2cgepdrmrneezdhogq2lx6t5ja

Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations [article]

Hagit Attiya, Constantin Enea, Jennifer L. Welch
2022 arXiv   pre-print
We show that a wide class of linearizable implementations, including well-known ones for registers and snapshots, can be modified to approximate the probabilistic guarantees of randomized programs when  ...  However linearizability does not preserve hyper-properties, which include probabilistic guarantees of randomized programs: an adversary can greatly amplify the probability of a bad outcome.  ...  a step that samples a random value (the scheduling decisions of a strong adversary do not depend on future randomized choices).  ... 
arXiv:2106.15554v2 fatcat:3pyt5jnb2jeoppn2e6dzboilke

Quasi-Linearizability: Relaxed Consistency for Improved Concurrency [chapter]

Yehuda Afek, Guy Korland, Eitan Yanovsky
2010 Lecture Notes in Computer Science  
Yet, these implementations are often employed in an environment where a more relaxed linearizability condition suffices, where strict linearizability is not a must.  ...  Roughly speaking an implementation of an object is quasi linearizable if each run of the implementation is at a bounded "distance" away from some linear run of the object.  ...  We would like to thank Adam Morrison, Nir Shavit and Maria Natanzon for very productive and helpful discussions.  ... 
doi:10.1007/978-3-642-17653-1_29 fatcat:rgs36hkqlzgs3ehaporzcen52m

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  
Concurrent data structures have found increasingly widespread use in both multicore and distributed computing environments, thereby escalating the priority for verifying their correctness.  ...  Quasi linearizability is a quantitative relaxation of linearizability to allow more implementation freedom for performance optimization.  ...  Introduction Concurrent programming has engulfed the broad horizon of both the multi-core and distributed computing environments.  ... 
doi:10.1007/978-3-642-39176-7_3 fatcat:2uzstfpnsrefrifog3pe6hcrga

Distributed queues in shared memory

Andreas Haas, Michael Lippautz, Thomas A. Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, Ali Sezgin
2013 Proceedings of the ACM International Conference on Computing Frontiers - CF '13  
We present distributed queues (DQ), a new family of relaxed concurrent queue implementations.  ...  DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior.  ...  With LB, MS, FC, and WF elements do not overtake each other as these implementations are linearizable with respect to strict FIFO queue semantics.  ... 
doi:10.1145/2482767.2482789 dblp:conf/cf/HaasLHPSKS13 fatcat:w524ibkngffwfb5yurwlfwqtjm

Round-Up: Runtime Verification of Quasi Linearizability for Concurrent Data Structures

Lu Zhang, Arijit Chattopadhyay, Chao Wang
2015 IEEE Transactions on Software Engineering  
We propose a new method for runtime checking of a relaxed consistency property called quasi linearizability for concurrent data structures.  ...  Quasi linearizability generalizes the standard notion of linearizability by introducing nondeterminism into the parallel computations quantitatively and then exploiting such nondeterminism to improve the  ...  Furthermore, existing tools for detecting serializability and atomicity violations do not check for quantitative properties. VIII.  ... 
doi:10.1109/tse.2015.2467371 fatcat:hgu4i5pdlfculeehmfiuil6cs4

Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects

Hagit Attiya, Constantin Enea, Michael Wagner
2019 International Symposium on Distributed Computing  
It has been observed that linearizability, the prevalent consistency condition for implementing concurrent objects, does not preserve some probability distributions.  ...  For situations where strongly linearizable implementations do not exist (or are less efficient), we argue that reasoning about hyperproperties of programs can be simplified by strong observational refinement  ...  distributed randomized program.  ... 
doi:10.4230/lipics.disc.2019.2 dblp:conf/wdag/AttiyaE19 fatcat:k5d3zlkoprf37aencbteayehjy

Combining funnels

Nir Shavit, Asaph Zemach
1998 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98  
These layers use randomization instead of a rigid tree structure to allow processors to find partners for combining.  ...  Elimination trees, which are not linearizable, prove to be 10% faster than funnels under highest load, but as load drops combining funnels adapt their size, giving them a 34% lead in latency.  ...  For this reason we do not display these results in our graphs, concentrating on other methods instead.  ... 
doi:10.1145/277697.277707 dblp:conf/podc/ShavitZ98 fatcat:w6irrnn72zadppkmyxdzwsej7e

Local Linearizability [article]

Andreas Haas, Thomas A. Henzinger, Andreas Holzer, Christoph M. Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, Helmut Veith
2016 arXiv   pre-print
Nevertheless, for applications that do not require all guarantees offered by linearizability, recent research has focused on improving performance and scalability of concurrent data structures by relaxing  ...  We present a generic implementation method for locally linearizable data structures that uses existing linearizable data structures as building blocks.  ...  A queue concurrent history h is locally linearizable wrt the queue sequential specification S Q if and only if  ... 
arXiv:1502.07118v4 fatcat:bfao5vbib5ah5kvmihu7m5uq64

A lock-free algorithm for concurrent bags

Håkan Sundell, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas
2011 Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11  
Therefore, the algorithm exploits a distributed design combined with novel techniques for handling concurrent modifications of linked lists using double marks, detection of total emptiness, and efficient  ...  To handle concurrency efficiently, the algorithm was designed to thrive for disjoint-access-parallelism for the supported semantics.  ...  Moreover, we implemented the ED-tree based lock-free (although not linearizable) pool by Afek et al. [11] .  ... 
doi:10.1145/1989493.1989550 dblp:conf/spaa/SundellGPT11 fatcat:fpssyzxsyralpiudxy53fjmy3e

Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution [article]

Sergio Rajsbaum, Michel Raynal
2018 arXiv   pre-print
Concurrency, the art of doing many things at the same time is slowly becoming a science.  ...  It is very difficult to master, yet it arises all over modern computing systems, both when the communication medium is shared memory and when it is by message passing.  ...  Figure 2 : 2 Structure of the consensus-based implementation of TO-broadcast do at least all the processes that do not crash.  ... 
arXiv:1812.06011v1 fatcat:56rajh2lgngu3e5rlm42gdtjhe

Don't Trust the Cloud, Verify: Integrity and Consistency for Cloud Object Stores [article]

Marcus Brandenburger, Christian Cachin, Nikola Knežević
2016 arXiv   pre-print
VICOS enforces the consistency notion of fork-linearizability, supports wait-free client semantics for most operations, and reduces the computation and communication overhead compared to previous protocols  ...  Cloud services have turned remote computation into a commodity and enable convenient online collaboration.  ...  Acknowledgments We thank Rüdiger Kapitza, Dieter Sommer and Sören Bleikertz for helpful discussions and the anonymous reviewers of SYSTOR 2015 for valuable comments.  ... 
arXiv:1502.04496v2 fatcat:eqmsapd5ynakhfjejmu7y45tle

Ballerina: Automatic generation and clustering of efficient random unit tests for multithreaded code

Adrian Nistor, Qingzhou Luo, Michael Pradel, Thomas R. Gross, Darko Marinov
2012 2012 34th International Conference on Software Engineering (ICSE)  
Such unit tests can be generated at random, but basic random generation produces tests that are either slow or do not trigger concurrency bugs.  ...  We present BALLERINA, a novel technique for automated random generation of efficient multithreaded tests that effectively trigger concurrency bugs.  ...  Thus, using a random string like "Hi!" does not suffice, and Randoop does not randomly generate strings like "x.level=FINE".  ... 
doi:10.1109/icse.2012.6227145 dblp:conf/icse/NistorLPGM12 fatcat:5sry4mpi2bckznaoq4hnmdl44e
« Previous Showing results 1 — 15 out of 371 results