Identity assignment in uniform synchronous rings (Q1318752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Identity assignment in uniform synchronous rings |
scientific article; zbMATH DE number 540894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identity assignment in uniform synchronous rings |
scientific article; zbMATH DE number 540894 |
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
0.8263983
0 references
0 references
0 references
0 references
0.8130958
0 references
