Identity assignment in uniform synchronous rings

DOI10.1016/0020-0190(94)90064-7MaRDI QIDQ1318752zbMATH OpenOpenAlexWikidataFDO

Authors Lih-Chyau Wuu, Shing-Tsaan Huang

Publication date 5 April 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)90064-7

zbMATH Keywords

distributed algorithmdistributed computingfault toleranceidentity assignmentself-stabilization

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 871956
• The concurrent assignment representation of synchronous systems
• scientific article; zbMATH DE number 3997157
• scientific article; zbMATH DE number 1094165
• Identities of regular semigroup rings
• Idempotents in exchange rings
• Idempotent identities in \(f\)-rings
• scientific article; zbMATH DE number 3978422
• Idempotent rings which are equivalent to rings with identity
• Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings

Cites work

• Self-stabilizing systems in spite of distributed control
• Space efficient processor identity protocol
• The processor identity problem

Cited in

(2)

• Space efficient processor identity protocol
• The processor identity problem

This page was built for publication: Identity assignment in uniform synchronous rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318752)