Filters








181,939 Hits in 3.8 sec

A Wait-Free Universal Construct for Large Objects [article]

Andreia Correia, Pedro Ramalhete, Pascal Felber
2019 arXiv   pre-print
Wait-free universal constructs are attractive as they can turn a sequential implementation of any object into an equivalent, yet concurrent and wait-free, implementation.  ...  To overcome this limitation, we have designed CX, a multi-instance-based wait-free universal construct that substantially reduces the amount of copy operations.  ...  Authors' addresses: Andreia Correia, University of Neuchatel, andreia.veiga@unine.ch; Pedro Ramalhete, Cisco Systems, pramalhe@gmail.com; Pascal Felber, University of Neuchatel, pascal.felber@unine.ch.  ... 
arXiv:1911.01676v1 fatcat:y6cfg4do3vhijmwiddteolhy2e

Universal constructions for large objects

J.H. Anderson, M. Moir
1999 IEEE Transactions on Parallel and Distributed Systems  
We present l o c k-free and wait-free universal constructions for implementing large shared objects.  ...  Most previous universal constructions require processes to copy t h e entire object state, which is impractical for large objects.  ...  Acknowledgement: We would like to thank Lars Nyland for his help with the performance studies in Section 3.3.  ... 
doi:10.1109/71.819952 fatcat:i44lzhicr5dotenmal6pky22u4

Universal constructions for large objects [chapter]

James H. Anderson, Mark Moir
1995 Lecture Notes in Computer Science  
We present l o c k-free and wait-free universal constructions for implementing large shared objects.  ...  Most previous universal constructions require processes to copy t h e entire object state, which is impractical for large objects.  ...  Acknowledgement: We would like to thank Lars Nyland for his help with the performance studies in Section 3.3.  ... 
doi:10.1007/bfb0022146 fatcat:avqow5ovgna5rkv7nukbvna5du

A Thrifty Universal Construction [chapter]

Wang Cheng, Rachid Guerraoui
2015 Lecture Notes in Computer Science  
A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and wait-free manner.  ...  In this paper, we present the first universal construction that (a) uses exactly one compare-and-swap object and (b) has time complexity (number of accesses to low-level shared objects) and memory complexity  ...  The landmark paper of Herlihy [9] showed a generic mechanism to obtain wait-free objects by introducing the idea of universal construction.  ... 
doi:10.1007/978-3-319-26850-7_30 fatcat:l2ldz6akdrgmxppsnp35bwmt54

A methodology for implementing highly concurrent data structures

M. Herlihy
1990 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming - PPOPP '90  
A con.curren.t object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on criticaI sections:  ...  Acknowledgments I am grateful to Bill Weihl for pointing out a bug in an earlier version of this paper.  ...  This paper proposes a new methodology for constructing non-blocking aud wait-free implementations of concurrent objects.  ... 
doi:10.1145/99163.99185 dblp:conf/ppopp/Herlihy90 fatcat:rqcq4cz4cnc77asdslk5i655ny

A methodology for implementing highly concurrent data structures

M. Herlihy
1990 SIGPLAN notices  
A con.curren.t object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on criticaI sections:  ...  Acknowledgments I am grateful to Bill Weihl for pointing out a bug in an earlier version of this paper.  ...  This paper proposes a new methodology for constructing non-blocking aud wait-free implementations of concurrent objects.  ... 
doi:10.1145/99164.99185 fatcat:uaah2x4lxzaufok7lx5tymxui4

Benign failure models for shared memory [chapter]

Yehuda Afek, Michael Merritt, Gadi Taubenfeld
1993 Lecture Notes in Computer Science  
That is, for any integer k, any shared object may be constructed from shared registers and consensus objects, so that: (1) if no more than k of the components suffer crash-omission failures, the constructed  ...  Unlike the crash model, crash-omission is shown to have universal, gracefully-degrading constructions.  ...  -A list X of object types is n-GD-universal for fault type F if every n-process object has a wait-free implementation from X that is Gracefully Degrading for F .  ... 
doi:10.1007/3-540-57271-6_28 fatcat:hstirnmb7nhtxjhrw4ksvmgmme

An Efficient Universal Construction for Large Objects [article]

Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou
2020 arXiv   pre-print
This paper presents L-UC, a universal construction that efficiently implements dynamic objects of large state in a wait-free manner.  ...  It improves upon previous universal constructions either by efficiently handling objects whose state is large and can change dynamically, or by achieving better step complexity.  ...  In [6] , Felber et al. present CX, a wait-free universal construction, suitable for simulating large objects. This universal construction keeps up to 2n instances of the object state.  ... 
arXiv:2001.03457v1 fatcat:7x7s3e7bp5cwrjxhuhzh2i4y4e

Eventual Wait-Free Synchronization [article]

Tong Che
2015 arXiv   pre-print
We prove that the n-process eventually linearizable fetch-and-cons (n-FAC) object is universal and can be used to classify the eventually linearizable objects.  ...  Thus we got a complete hierarchy of eventually linearizable objects, as a perfect analogy of the consensus hierarchy.  ...  Proof We consider the following universal construction for any object of abstract data type T : Algorithm : Universal Construction For FAC Require: O local , a local copy of object of Type T .  ... 
arXiv:1512.08258v1 fatcat:p73byhww3fbu7ecymqffhhybpu

What Can be Computed in a Distributed System? [chapter]

Michel Raynal
2014 Lecture Notes in Computer Science  
Hence, a fundamental question is the following one: What can be computed in a distributed system?  ...  This paper is a short introduction to this kind of issues. It first presents a few of elements related to distributed computability, and then briefly addresses distributed complexity issues.  ...  He wants also to thank François Taïani for constructive comments.  ... 
doi:10.1007/978-3-642-54848-2_14 fatcat:clpsh3kdv5hh5cvlklobiodh3a

An Efficient Universal Construction for Large Objects

Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou, Michael Wagner
2020 International Conference on Principles of Distributed Systems  
This paper presents L-UC, a universal construction that efficiently implements dynamic objects of large state in a wait-free manner.  ...  It improves upon previous universal constructions either by efficiently handling objects whose state is large and can change dynamically, or by achieving better step complexity.  ...  In [6] , Felber et al. present CX, a wait-free universal construction, suitable for simulating large objects. This universal construction keeps up to 2n instances of the object state.  ... 
doi:10.4230/lipics.opodis.2019.18 dblp:conf/opodis/FatourouKK19 fatcat:wdw5u5a5v5b3ffz5j5ikmodo2m

Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces

A.N. Bessani, M. Correia, J. da Silva Fraga, Lau Cheuk Lung
2009 IEEE Transactions on Parallel and Distributed Systems  
We also prove that PEATS objects are universal, i.e., that they can be used to implement any other shared memory object, and present lock-free and wait-free universal constructions.  ...  Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recent algorithms for the coordination of processes subject to Byzantine failures  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their helpful comments that improved this paper.  ... 
doi:10.1109/tpds.2008.96 fatcat:r3dwbbet4bfuppb76um6ssesdu

Universal constructions that ensure disjoint-access parallelism and wait-freedom

Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
2012 Proceedings of the 2012 ACM symposium on Principles of distributed computing - PODC '12  
A universal construction provides a general mechanism for obtaining a concurrent implementation of any object from its sequential code.  ...  We identify a natural property of universal constructions and prove that there is no universal construction (with this property) that ensures both disjointaccess parallelism and wait-freedom.  ...  They employ their k-word CAS implementation to get a universal construction that produces wait-free implementations of multi-object operations.  ... 
doi:10.1145/2332432.2332457 dblp:conf/podc/EllenFKMT12 fatcat:wdf7fqgorjd6xbbzw2vvumfoha

Universal constructions that ensure disjoint-access parallelism and wait-freedom

Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
2016 Distributed computing  
A universal construction provides a general mechanism for obtaining a concurrent implementation of any object from its sequential code.  ...  We identify a natural property of universal constructions and prove that there is no universal construction (with this property) that ensures both disjointaccess parallelism and wait-freedom.  ...  They employ their k-word CAS implementation to get a universal construction that produces wait-free implementations of multi-object operations.  ... 
doi:10.1007/s00446-015-0261-8 fatcat:r376vyhrsza2vefvlfnx5nqtpa

A universal construction for wait-free transaction friendly data structures

Phong Chuong, Faith Ellen, Vijaya Ramachandran
2010 Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10  
Our universal construction is transaction friendly, allowing a process to gracefully exit from an operation that it wanted to perform, and it is cache-efficient in a multicore setting where the processes  ...  registers and CAS objects.  ...  A UNIVERSAL CONSTRUCTION In this section, we present a universal construction that creates a wait-free, linearizable implementation of an object from a deterministic sequential implementation.  ... 
doi:10.1145/1810479.1810538 dblp:conf/spaa/ChuongER10 fatcat:l5qelfa5ffd63bvl7myppn7wqq
« Previous Showing results 1 — 15 out of 181,939 results