Следене
Damien Imbs
Damien Imbs
Aix-Marseille University, France
Потвърден имейл адрес: lis-lab.fr
Заглавие
Позовавания
Позовавания
Година
Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations)
D Imbs, M Raynal
Theoretical Computer Science, 2012
562012
Help when needed, but no more: efficient read/write partial snapshot
D Imbs, M Raynal
Journal of Parallel and Distributed Computing 72 (1), 1-12, 2012
402012
Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast
D Imbs, M Raynal
Parallel Processing Letters 26 (04), 1650017, 2016
392016
Failure detectors in homonymous distributed systems (with an application to consensus)
S Arévalo, AF Anta, D Imbs, E Jiménez, M Raynal
Journal of Parallel and Distributed Computing 83, 83-95, 2015
332015
Brief announcement: virtual world consistency: a new condition for stm systems
D Imbs, JR de Mendivil, M Raynal
Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009
322009
On asymmetric progress conditions
D Imbs, M Raynal, G Taubenfeld
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010
312010
The universe of symmetry breaking tasks
D Imbs, S Rajsbaum, M Raynal
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011
272011
Visiting gafni’s reduction land: From the bg simulation to the extended bg simulation
D Imbs, M Raynal
Stabilization, Safety, and Security of Distributed Systems: 11th …, 2009
262009
The multiplicative power of consensus numbers
D Imbs, M Raynal
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010
242010
A lock-based STM protocol that satisfies opacity and progressiveness
D Imbs, M Raynal
Principles of Distributed Systems, 226-245, 2008
242008
Towards a universal construction for transaction-based multiprocess programs
T Crain, D Imbs, M Raynal
Theoretical Computer Science 496, 154-169, 2013
232013
Renaming is weaker than set agreement but for perfect renaming: A map of sub-consensus tasks
A Castañeda, D Imbs, S Rajsbaum, M Raynal
LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa …, 2012
202012
Set-constrained delivery broadcast: Definition, abstraction power, and computability limits
D Imbs, A Mostéfaoui, M Perrin, M Raynal
Proceedings of the 19th International Conference on Distributed Computing …, 2018
182018
Optimal memory-anonymous symmetric deadlock-free mutual exclusion
Z Aghazadeh, D Imbs, M Raynal, G Taubenfeld, P Woelfel
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
172019
Generalized symmetry breaking tasks and nondeterminism in concurrent objects
A Castañeda, D Imbs, S Rajsbaum, M Raynal
SIAM Journal on Computing 45 (2), 379-414, 2016
172016
On the consistency conditions of transactional memories
D Imbs, JRG de Mendivil Moreno, M Raynal
172008
Read invisibility, virtual world consistency and probabilistic permissiveness are compatible
T Crain, D Imbs, M Raynal
Algorithms and Architectures for Parallel Processing, 244-257, 2011
162011
A versatile STM protocol with invisible read operations that satisfies the virtual world consistency condition
D Imbs, M Raynal
Structural Information and Communication Complexity: 16th International …, 2010
162010
Read/write shared memory abstraction on top of asynchronous byzantine message-passing systems
D Imbs, S Rajsbaum, M Raynal, J Stainer
Journal of Parallel and Distributed Computing 93, 1-9, 2016
152016
Simple and efficient reliable broadcast in the presence of byzantine processes
D Imbs, M Raynal
arXiv preprint arXiv:1510.06882, 2015
152015
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20