• Aucun résultat trouvé

The Renaming Problem in Shared Memory Systems: an Introduction

N/A
N/A
Protected

Academic year: 2021

Partager "The Renaming Problem in Shared Memory Systems: an Introduction"

Copied!
30
0
0

Texte intégral

Loading

Figure

Figure 1: Uncertainties for 2 processes after one communication exchange
Figure 3: A wait-free implementation of a splitter object (code for p i ) [38, 42]
Figure 4: A simple read/write wait-free adaptive (2p − 1) -renaming (code for p i ) [10]
Figure 5: Recursive adaptive renaming algorithm (code for p i ) [48]
+7

Références

Documents relatifs

Given that there is a unique solution for the GAP, it is still im- possible to develop a correct message passing algorithm which can terminate in pseudo-polynomial number of

Actually, the main idea behind the snap-stabilization is the following: the protocol is seen as a function and the function ensures two properties despites the arbitrary

We also prove that the class of generators of L ∞ -type pseudo-resolvents generalizes the class of infinitesimal generators of C o -equicontinuous semi- groups acting on

The dynamics of reaction time on performing the probe-task in parallel solution of the main thinking problem (insight / algorithmic) in provisional experimental

If activating one of the blue robots, it does not reach the position occupied by the red one, activate all blue robots If activating the red robot, it does not reach the position

It is possible to design an adversary that lets the robots occupy two distinct positions on the plane in a finite number of cycles….. MulHplicity  DetecHon

Unite´ de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unite´ de recherche INRIA Rhoˆne-Alpes, 46 avenue Fe´lix Viallet, 38031 GRENOBLE Cedex

I n this section we shall give some results on the growth of powers of elements in Mp, which are modifications and localizations of results proved e.g. The main