Identity assignment in uniform synchronous rings (Q1318752): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127174136, #quickstatements; #temporary_batch_1722203565125 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127174136 / rank | |||
Normal rank | |||
Latest revision as of 22:55, 28 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Identity assignment in uniform synchronous rings |
scientific article |
Statements
Identity assignment in uniform synchronous rings (English)
0 references
5 April 1994
0 references
A self-stabilizing algorithm is proposed for assigning distinct and ordered identities to the processors on synchronous rings of prime size. Since there is no deterministic algorithm that can break symmetry, the proposed algorithm is a randomized one. It is shown that with probability one, the randomized algorithm makes each processor in the system have a unique identity.
0 references
distributed algorithm
0 references
distributed computing
0 references
fault tolerance
0 references
identity assignment
0 references
self-stabilization
0 references
