Self-stabilizing silent disjunction in an anonymous network

DOI10.1016/J.TCS.2016.12.012zbMATH Open1356.68262OpenAlexW2565624112MaRDI QIDQ507596FDOQ507596

Authors: Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore 

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.012

Recommendations

• Self-stabilizing silent disjunction in an anonymous network
• An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
• Self-stabilization with r-Operators Revisited
• Self-stabilizing leader election in polynomial steps
• Self-stabilizing weak leader election in anonymous trees using constant memory per edge

zbMATH Keywords

self-stabilizationdisjunctionanonymous networksilenceunfair daemon

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• A self-stabilizing algorithm for constructing breadth-first trees
• Competitive self-stabilizing \(k\)-clustering
• Self-stabilization
• Self-stabilizing systems in spite of distributed control
• Title not available (Why is that?)
• Title not available (Why is that?)
• Time optimal self-stabilizing synchronization
• An \(O(n)\)-time self-stabilizing leader election algorithm
• A self-stabilizing \(k\)-clustering algorithm for weighted graphs
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Memory requirements for silent stabilization
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• Distributed reset
• Self-stabilizing depth-first search
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• A self-stabilizing algorithm for constructing spanning trees
• Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
• The first fully polynomial stabilizing algorithm for BFS tree construction
• Self-stabilizing leader election in polynomial steps
• Self-stabilizing silent disjunction in an anonymous network

Cited In (3)

• Title not available (Why is that?)
• Snap-stabilizing tasks in anonymous networks
• Self-stabilizing silent disjunction in an anonymous network

This page was built for publication: Self-stabilizing silent disjunction in an anonymous network

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