A liveness condition for concurrent objects: <i>x</i>‐wait‐freedom

Imbs, Damien; Raynal, Michel

doi:10.1002/cpe.1741

Cited by 11 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reader interested in dissymetric progress conditions will consult [48,51,88]. A tutorial on the notion of universality in crash-prone asynchronous message-passing systems is presented in [78].…”

Section: Further Readingsmentioning

confidence: 99%

Distributed Computability

Raynal

2021

SIGACT News

Self Cite

View full text Add to dashboard Cite

As today Computer Science is more and more (driven) consumed by its applications, it becomes more and more important to know what is and what is not computable. For a long time now, this has been relatively well understood in sequential computing. But today the computing world becomes more and more distributed, and consequently more and more applications are distributed. As a result, it becomes important, or even crucial, to understand what is distributed computing and which are its power and its limits. This article is a step in this direction from an agreement-oriented and fault-tolerance perspective.

show abstract

Section: Further Readingsmentioning

confidence: 99%

Distributed Computability

Raynal

2021

SIGACT News

Self Cite

View full text Add to dashboard Cite

show abstract

“…4.1 Safe agreement object in CAMP n,t [t < n/2]: definition This object type (or variants of it), briefly sketched in the Introduction, is at the core of both the BG simulation [6,7,14,22], and the liveness guarantees of concurrent objects [23,24]. It is a one-shot object that solves consensus in failure-free scenarios, and allows processes to agree with a weak termination guarantee in the presence of failures.…”

Section: Bg(mpc): Bg In the Crash-prone Asynchronous Message-passing ...mentioning

confidence: 99%

“…It is easy to see that a safe agreement object is a consensus object whose termination condition is failuredependent. Algorithms implementing safe agreement objects (or variants of it) can be found in [6,7,24].…”

Section: Bg(mpc): Bg In the Crash-prone Asynchronous Message-passing ...mentioning

confidence: 99%

From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach

Imbs¹,

Raynal²,

Stainer³

2015

Preprint

Self Cite

View full text Add to dashboard Cite

The BG-simulation is a powerful reduction algorithm designed for asynchronous read/write crashprone systems. It allows a set of (t + 1) asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up to t of them) an arbitrary number n of processes under the assumption that at most t of them may crash. The BG simulation shows that, in read/write systems, the crucial parameter is not the number n of processes, but the upper bound t on the number of process crashes.The paper extends the concept of BG simulation to asynchronous message-passing systems prone to Byzantine failures. Byzantine failures are the most general type of failure: a faulty process can exhibit any arbitrary behavior. Because of this, they are also the most difficult to analyze and to handle algorithmically. The main contribution of the paper is a signature-free reduction of Byzantine failures to crash failures. Assuming t < min(n , n/3), the paper presents an algorithm that simulates a system of n processes where up to t may crash, on top of a basic system of n processes where up to t may be Byzantine. While topological techniques have been used to relate the computability of Byzantine failure-prone systems to that of crash failure-prone ones, this simulation is the first, to our knowledge, that establishes this relation directly, in an algorithmic way.In addition to extending the basic BG simulation to message-passing systems and failures more severe than process crashes, being modular and direct, this simulation provides us with a deeper insight in the nature and understanding of crash and Byzantine failures in the context of asynchronous message-passing systems. Moreover, it also allows crash-tolerant algorithms, designed for asynchronous read/write systems, to be executed on top of asynchronous message-passing systems prone to Byzantine failures.

show abstract

“…The strongest progress condition is known as wait‐freedom, in asynchronous read/write systems with n processes also termed more precisely as n ‐wait‐freedom. In the paper A liveness condition for concurrent objects: x‐wait‐freedom , Damien Imbs and Michel Raynal relax the requirement of wait‐freedom to a subset of x processes ( x ≤ n ), which are considered particularly important. This progress condition reflects many practical scenarios more accurately.…”

mentioning

confidence: 99%

Special Issue: Euro‐Par 2010

Bougé

Lengauer

2011

Concurrency and Computation

View full text Add to dashboard Cite

This special issue of Concurrency and Computation: Practice and Experience contains revised and extended versions of selected papers presented at the Euro-Par 2010 conference.Euro-Par-the European Conference on Parallel Computing-is an annual series of international conferences dedicated to the promotion and the advancement of all aspects of parallel and distributed computing. Euro-Par covers a wide spectrum of topics from algorithms and theory to software technology and hardware-related issues, with application areas ranging from scientific to mobile and cloud computing. The main audience of Euro-Par are the researchers in academic institutions, government laboratories, and industrial organizations.Euro-Par 2010, the 16th conference in the Euro-Par series, was organized by the Institute for High Performance Computing and Networking of the Italian National Research Council and was held at the Hotel Continental Terme on the Italian island of Ischia, in the Naples Bay.Fourteen broad topics were defined and advertised, covering a large variety of aspects of parallel and distributed computing. The call for papers attracted a total of 256 submissions. The submitted papers were reviewed at least three and, in many cases, four times. A total of 90 papers were finally accepted for publication. This makes a global acceptance rate of 35%. The authors of the accepted papers come from 24 countries, with the four main contributing countries-USA, France, Spain, and Germany-accounting for about 55% of the authors. The distribution of authors followed the pattern typical for a Euro-Par conference: of the 10 authors, this year, six have been academic researchers, three PhD students, and one from industry.The topical distribution of the papers in the proceedings of Euro-Par 2010 reflects the current trends in the field of parallel and distributed computing: 18 of 90 papers are devoted to the relatively new topic Multicore and Manycore Programming. This figure was 11 in 2009 and was even lower in 2008 when the subject was part of the topic High-Performance Architectures and Compilers. On the other hand, the well-established Euro-Par topics such as Support Tools and Environments or Scheduling and Load-Balancing, for instance, have remained quite stable throughout the years. These figures demonstrate that the topic structure of Euro-Par has the flexibility to adapt to current trends in a wide spectrum of research areas.With its topic structure, Euro-Par has been filling two complementary rôles: as a regular meeting place for established communities and as a place to develop new communities. In recent years, the latter rôle has been strengthened by the introduction of satellite workshops, at which researchers can meet initially and form a new community that later settles and flourishes in other fora. In 2010, the number of satellite workshops was higher than ever before, 11, and we strive to have it grow further, maintaining the Euro-Par claim of being the wide-spectrum conference on parallelism in Europe.Returning to the spread of p...

show abstract

A liveness condition for concurrent objects: x‐wait‐freedom

Cited by 11 publications

References 19 publications

Distributed Computability

Distributed Computability

From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach

Special Issue: Euro‐Par 2010

Contact Info

Product

Resources

About