Zobrazeno 1 - 10
of 181
pro vyhledávání: '"Mostefaoui, Achour"'
In classical asynchronous distributed systems composed of a fixed number n of processes where some proportion may fail by crashing, many objects do not have a wait-free linearizable implementation (e.g. stacks, queues, etc.). It has been proved that
Externí odkaz:
http://arxiv.org/abs/1908.02063
Many distributed protocols and applications rely on causal broadcast to ensure consistency criteria. However, none of causality tracking state-of-the-art approaches scale in large and dynamic systems. This paper presents a new non-blocking causal bro
Externí odkaz:
http://arxiv.org/abs/1805.05201
This paper presents a simple generalization of causal consistency suited to any object defined by a sequential specification. As causality is captured by a partial order on the set of operations issued by the processes on shared objects (concurrent o
Externí odkaz:
http://arxiv.org/abs/1802.00706
This paper presents a simple generalization of the basic atomic read/write register object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This object, whose de
Externí odkaz:
http://arxiv.org/abs/1802.00678
This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an appropriate abstraction level when they have to implement objects or distributed tasks in an a
Externí odkaz:
http://arxiv.org/abs/1706.05267
It is well-known that consensus (one-set agreement) and total order broadcast are equivalent in asynchronous systems prone to process crash failures. Considering wait-free systems, this article addresses and answers the following question: which is t
Externí odkaz:
http://arxiv.org/abs/1705.04835
" Yet another paper on " the implementation of read/write registers in crash-prone asynchronous message-passing systems! Yes..., but, differently from its predecessors, this paper looks for a communication abstraction which captures the essence of su
Externí odkaz:
http://arxiv.org/abs/1702.08176
To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations. Waiting only for one of them suffices for
Externí odkaz:
http://arxiv.org/abs/1607.06258
It has been proved that to implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time proportional to the uncertainty in the latency of the network for both read and write operations, while waitin
Externí odkaz:
http://arxiv.org/abs/1607.05596
In distributed systems where strong consistency is costly when not impossible, causal consistency provides a valuable abstraction to represent program executions as partial orders. In addition to the sequential program order of each computing entity,
Externí odkaz:
http://arxiv.org/abs/1603.04199