Filters








92 Hits in 2.1 sec

Simple Optimal Wait-free Multireader Registers [article]

Paul Vitanyi
2005 arXiv   pre-print
We propose a surprisingly simple and natural scheme to obtain several wait-free constructions of bounded 1-writer multireader registers from atomic 1-writer 1-reader registers, that is easier to prove  ...  Multireader shared registers are basic objects used as communication medium in asynchronous concurrent computation.  ...  This work: We give a surprisingly simple and elegant wait-free construction of an atomic multireader shared variable from atomic 1-reader 1-writer shared variables.  ... 
arXiv:cs/0202003v3 fatcat:udi7o2to5jdsjlexxobw4v7sy4

Using vector interfaces to deliver millions of IOPS from a networked key-value storage server

Vijay Vasudevan, Michael Kaminsky, David G. Andersen
2012 Proceedings of the Third ACM Symposium on Cloud Computing - SoCC '12  
Multiread improves networked key-value retrieval by roughly 2x by reducing the storage interrupt load, freeing the CPU for the costly network and RPC processing.  ...  For low multiget widths, it is advisable to keep the multiread parameter low. Waiting for the multiread queue to fill at low load creates long queuing delays.  ... 
doi:10.1145/2391229.2391237 dblp:conf/cloud/VasudevanKA12 fatcat:3odzssqbb5dejik7jhoaq4yvdy

Page 2804 of Mathematical Reviews Vol. , Issue 91E [page]

1991 Mathematical Reviews  
We give a survey of the most important recent results concerning such wait-free implementations of atomic multiwriter, multireader shared registers.  ...  The dependency basis for sets of functional and join dependencies can be obtained in a simple way using the property above. Several algorithms for the solution of various problems are developed.  ... 

Wait-free synchronization

Maurice Herlihy
1991 ACM Transactions on Programming Languages and Systems  
no two-process consensus protocol using multireader/multiwriter atomic registers.  ...  In the first part of this paper, we propose a simple new technique for proving statements of the form "there is no wait-free implementation of X by Y."  ... 
doi:10.1145/114005.102808 fatcat:rhorzhnvsvg63ewfnwbsyhgqlm

Wait-Free Synchronization [chapter]

2005 Concurrent and Distributed Computing in Java  
no two-process consensus protocol using multireader/multiwriter atomic registers.  ...  In the first part of this paper, we propose a simple new technique for proving statements of the form "there is no wait-free implementation of X by Y."  ... 
doi:10.1002/0471721271.ch5 fatcat:gika5yggazfyraezjblhrnpoi4

Atomic Snapshots in O (n log n) Operations

Hagit Attiya, Ophir Rachman
1998 SIAM journal on computing (Print)  
Therefore, snapshot objects greatly simplify the design and verification of many wait-free algorithms.  ...  Wait-free algorithms for shared-memory systems have attracted considerable attention during the past few years.  ...  The algorithm is simple and requires O(n log m) operations on single-writer multireader atomic registers.  ... 
doi:10.1137/s0097539795279463 fatcat:ktsuqlp5rbgqvpcwoalkwnnwxa

Atomic snapshots in O(n log n) operations

Hagit Attiya, Ophir Rachman
1993 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93  
Therefore, snapshot objects greatly simplify the design and verification of many wait-free algorithms.  ...  Wait-free algorithms for shared-memory systems have attracted considerable attention during the past few years.  ...  The algorithm is simple and requires O(n log m) operations on single-writer multireader atomic registers.  ... 
doi:10.1145/164051.164055 dblp:conf/podc/AttiyaR92 fatcat:a2uw5a7uofch7gwu5dpfwc7ooa

Page 7326 of Mathematical Reviews Vol. , Issue 2000j [page]

2000 Mathematical Reviews  
Summary: “A simulation of a wait-free, atomic, single-writer mul- tireader register in an asynchronous message passing system is presented.  ...  The new simulation improves the complexity of algorithms for the following problems in the message-passing model in the presence of processor failures: multiwriter multireader registers, concurrent time-stamp  ... 

On the use of registers in achieving wait-free consensus

Rida A. Bazzi, Gil Neiger, Gary L. Peterson
1997 Distributed computing  
Herlihy showed that such power may be measured by examining the type's ability to implement wait-free consensus.  ...  These results significantly impact upon the study of the wait-free hierarchies of concurrent data types.  ...  Since atomic registers are stronger than regular registers, it follows from all these results that there is a wait-free implementation of multireader, multi-writer, atomic, multi-value registers from single-reader  ... 
doi:10.1007/s004460050029 fatcat:wq7s7m5t4zfyhi7qxytvtuzghy

On the use of registers in achieving wait-free consensus

Rida A. Bazzi, Gil Neiger, Gary L. Peterson
1994 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94  
Herlihy showed that such power may be measured by examining the type's ability to implement wait-free consensus.  ...  These results significantly impact upon the study of the wait-free hierarchies of concurrent data types.  ...  Since atomic registers are stronger than regular registers, it follows from all these results that there is a wait-free implementation of multireader, multi-writer, atomic, multi-value registers from single-reader  ... 
doi:10.1145/197917.198124 dblp:conf/podc/BazziP94a fatcat:e2topb7odrcqlnn5ly42sbd4ki

Max registers, counters, and monotone circuits

James Aspnes, Hagit Attiya, Keren Censor
2009 Proceedings of the 28th ACM symposium on Principles of distributed computing - PODC '09  
As an application, we obtain a simple, linearizable, wait-free counter implementation with a cost of O(min(log n log v, n)) to perform an increment and O(min(log v, n)) to perform a read, where v is the  ...  For fixed m, an m-valued max register can be constructed from one-bit multi-writer multireader registers at a cost of at most lg m atomic register operations per write or read.  ...  The resulting counter is wait-free and linearizable.  ... 
doi:10.1145/1582716.1582728 dblp:conf/podc/AspnesAC09 fatcat:3tzjn75xszh4dddaop524e67ru

Simple atomic snapshots: A linear complexity solution with unbounded time-stamps

Lefteris M. Kirousis, Paul Spirakis, Philippas Tsigas
1996 Information Processing Letters  
Let X 1 : : : X c be variables which together constitute a composite register. These variables are shared by a n umber of processes which operate in a totally asynchronous and wait-free manner.  ...  All processes are assumed to operate totally asynchronously, while all operations (i.e. either writes to a component o r m ulti-reads) are required to be executed in a wait-free manner.  ...  The problem which w e study in this paper is the wait-free implementation of a single-reader, c-component, 1-writer per component, b-bit per component composite register using one component registers.  ... 
doi:10.1016/0020-0190(95)00198-0 fatcat:sle7o2lforhjvbjibopbrkmgjy

Simple atomic snapshots a linear complexity solution with unbounded time-stamps [chapter]

Lefteris M. Kirousis, Paul Spirakis, Philippas Tsigas
1991 Lecture Notes in Computer Science  
Let X 1 : : : X c be variables which together constitute a composite register. These variables are shared by a n umber of processes which operate in a totally asynchronous and wait-free manner.  ...  All processes are assumed to operate totally asynchronously, while all operations (i.e. either writes to a component o r m ulti-reads) are required to be executed in a wait-free manner.  ...  The problem which w e study in this paper is the wait-free implementation of a single-reader, c-component, 1-writer per component, b-bit per component composite register using one component registers.  ... 
doi:10.1007/3-540-54029-6_207 fatcat:j3ifdqybjnf6rkzusgok2ij5su

Bounded Concurrent Time-Stamping

Danny Dolev, Nir Shavit
1997 SIAM journal on computing (Print)  
In sections 4.3 and 4.4, the bounded wait-free CTSS implementation is described.  ...  Wait-free algorithms are highly suited for fault-tolerant and real-time applications (see Herlihy [Her91]).  ...  Wait-free constructions of SWMR atomic registers from weaker primitives have been shown in [BP87, IL93, Lam86d, SAG94, New87] .  ... 
doi:10.1137/s0097539790192647 fatcat:ujaxy52l7bem3j3ybqysd2a7se

Randomized naming using wait-free shared variables

Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul Vitányi
1998 Distributed computing  
We construct a randomized wait-free naming protocol using wait-free atomic read/write registers (shared variables) as process intercommunication primitives.  ...  The protocol is based on the wait-free implementation of a novel α-Test&SetOnce object that randomly and fast selects a winner from a set of q contenders with probability at least α in the face of the  ...  In [3] the notion of "composite register" or "snapshot object" is constructed from multi-user wait-free atomic read/write registers.  ... 
doi:10.1007/s004460050045 fatcat:fag3ow5xm5hi5ow4cpsqj2sqv4
« Previous Showing results 1 — 15 out of 92 results