International audienceWeighted voting is a conventional approach to improving the performance of replicated systems based on commonly-used majority quorum systems in heterogeneous environments. In long-lived systems, a weight reassignment protocol is required to reassign weights over time in order to accommodate performance variations accordingly. The weight reassignment protocol should be consensus-free in asynchronous failure-prone systems because of the impossibility of solving consensus in such systems. This paper presents an efficient consensus-free weight reassignment protocol for atomic storage systems in heterogeneous, dynamic, and asynchronous messagepassing systems. An experimental evaluation shows that the proposed protocol impro...
Internet-scale applications require more and more resources to satisfy the unpredictable clients nee...
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-wr...
This paper presents a new algorithm for implementing a reconfigurable distributed shared memory in a...
This paper describes a solution to the Atomic Broadcast problem in asynchronous distributed systems ...
A l'ère des données massives, des cryptomonnaies, et de l'internet des objets, les système de stocka...
This paper presents a new atomic commitment protocol that always allows a quorum in the system to ma...
We compare different algorithms for reconfigurable atomic storage in the data-centric model. We pres...
In the era of big data, cryptocurrencies, and the internet of everything, storage systems are demand...
Distributed applications often use quorums in order to guarantee consistency. With emerging world-wi...
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-wr...
Atomic memory is a fundamental building block for classical distributed applications. The new emerge...
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-wr...
Voting protocols guarantee consistency of replicated data in the presence of any scenar io involving...
Distributed applications often use quorums in order to guarantee consistency. With emerging world-wi...
International audienceThis article presents a signature-free distributed algorithm which builds an a...
Internet-scale applications require more and more resources to satisfy the unpredictable clients nee...
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-wr...
This paper presents a new algorithm for implementing a reconfigurable distributed shared memory in a...
This paper describes a solution to the Atomic Broadcast problem in asynchronous distributed systems ...
A l'ère des données massives, des cryptomonnaies, et de l'internet des objets, les système de stocka...
This paper presents a new atomic commitment protocol that always allows a quorum in the system to ma...
We compare different algorithms for reconfigurable atomic storage in the data-centric model. We pres...
In the era of big data, cryptocurrencies, and the internet of everything, storage systems are demand...
Distributed applications often use quorums in order to guarantee consistency. With emerging world-wi...
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-wr...
Atomic memory is a fundamental building block for classical distributed applications. The new emerge...
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-wr...
Voting protocols guarantee consistency of replicated data in the presence of any scenar io involving...
Distributed applications often use quorums in order to guarantee consistency. With emerging world-wi...
International audienceThis article presents a signature-free distributed algorithm which builds an a...
Internet-scale applications require more and more resources to satisfy the unpredictable clients nee...
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-wr...
This paper presents a new algorithm for implementing a reconfigurable distributed shared memory in a...