Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems

Autor: Michel Raynal, Sergio Rajsbaum, Damien Imbs, Julien Stainer

Publikováno v: Journal of Parallel and Distributed Computing. :1-9

This paper is on the construction and use of a shared memory abstraction on top of an asynchronous message-passing system in which up to t processes may commit Byzantine failures. This abstraction consists of arrays of n single-writer/multi-reader at

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::f79bc4ca21574cbf19b6a0cf6d233fa7
https://doi.org/10.1016/j.jpdc.2016.03.012

From wait-free to arbitrary concurrent solo executions in colorless distributed computing

Autor: Julien Stainer, Michel Raynal, Sergio Rajsbaum, Maurice Herlihy

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, 2017, 683, pp.1-21. ⟨10.1016/j.tcs.2017.04.007⟩
Theoretical Computer Science, Elsevier, 2017, 683, pp.1-21. ⟨10.1016/j.tcs.2017.04.007⟩

In an asynchronous distributed system where any number of processes may crash, a process may have to run solo, computing its local output without receiving any information from other processes. In the basic shared memory system where the processes co

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf2e1a0748c6be8ca3a93cbe95ff52a0
https://inria.hal.science/hal-01660566

Sequential Proximity

Autor: Karolos Antoniadis, Julien Stainer, Rachid Guerraoui, Vasileios Trigonakis

Publikováno v: Networked Systems ISBN: 9783319596464
NETYS

Establishing the scalability of a concurrent algorithm a priori, before implementing and evaluating it on a concrete multi-core platform, seems difficult, if not impossible. In the context of search data structures however, according to all practical

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8ca0f970600faa89c7bdaeb84f9d056b
https://doi.org/10.1007/978-3-319-59647-1_30

Distributed Universality

Autor: Julien Stainer, Michel Raynal, Gadi Taubenfeld

Publikováno v: Principles of Distributed SystemsLecture Notes in Computer Science Volume 8878, 2014, pp 469-484
Principles of Distributed Systems
Principles of Distributed Systems, 2014, Cortina d’Ampezzo, Italy. pp.469-484, ⟨10.1007/978-3-319-14472-6_31⟩
Lecture Notes in Computer Science ISBN: 9783319144719

A notion of a universal construction suited to distributed computing has been introduced by Herlihy in his celebrated paper "Wait-free synchronization" (ACM Trans Program Lang Syst 13(1):124---149, 1991). A universal construction is an algorithm that

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa118d1dc268bd8e9c5ca0df7a75e2a2
https://hal.inria.fr/hal-01097410

Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems

Autor: Julien Stainer, Sergio Rajsbaum, Damien Imbs, Michel Raynal

Publikováno v: Structural Information and Communication Complexity ISBN: 9783319096193
SIROCCO
Structural Information and Communication ComplexityLecture Notes in Computer Science Volume 8576, 2014, pp 37-53
Structural Information and Communication Complexity
Structural Information and Communication Complexity, 2014, Hida Takayama, Japan. pp.37-53, ⟨10.1007/978-3-319-09620-9_5⟩

International audience; This paper is on the construction and the use of a shared memory abstraction on top of an asynchronous message-passing system in which up to t processes may commit Byzantine failures. This abstraction consists of arrays of n s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1391f6bd910ef5fd87988bcaf6839bce
https://doi.org/10.1007/978-3-319-09620-9_5