Self-stabilization of dynamic systems assuming only read/write atomicity

From MaRDI portal
Publication:1310562

DOI10.1007/BF02278851zbMath1282.68084WikidataQ105838170 ScholiaQ105838170MaRDI QIDQ1310562

Shlomo Moran, Shlomi Dolev, Amos Israeli

Publication date: 22 November 1995

Published in: Distributed Computing (Search for Journal in Brave)




Related Items (55)

Error-detecting codes and fault-containing self-stabilizationRandomized uniform self-stabilizing mutual exclusionOn self-stabilizing wait-free clock synchronizationDistributed edge coloration for bipartite networksProof labeling schemesGreedy distributed optimization of multi-commodity flowsThe local detection paradigm and its applications to self-stabilizationOn the computational power of self-stabilizing systemsA self-stabilizing algorithm for the st-order problemFault tolerant network constructorsA uniform self-stabilizing minimum diameter spanning tree algorithmSelf-stabilizing systems in spite of high dynamicsA self-stabilizing algorithm for the median problem in partial rectangular grids and their relativesStabilizing data-link over non-FIFO channels with optimal fault-resilienceSelf-stabilizing minimum degree spanning tree within one from the optimal degreeAnalysis of a memory-efficient self-stabilizing BFS spanning tree constructionAn efficient fault-containing self-stabilizing algorithm for the shortest path problemSnap-stabilization and PIF in tree networksParallel composition for time-to-fault adaptive stabilizationTransient fault detectorsRandomized self-stabilizing and space optimal leader election under arbitrary scheduler on ringsWhen consensus meets self-stabilizationEfficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphsSelf-stabilizing multi-token ringsA self-stabilizing algorithm for the maximum flow problemSelf-stabilizing token circulation in uniform networksSelf-stabilizing depth-first token circulation in arbitrary rooted networksSelf-stabilization with r-operatorsTorus orientationA self-stabilizing quorum-based protocol for maxima computingSelf-stabilization of wait-free shared memory objectsA survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphsMaximum metric spanning tree made Byzantine tolerantFast and compact self-stabilizing verification, computation, and fault detection of an MSTSELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKSRANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREESSelf-stabilizing silent disjunction in an anonymous networkImproved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networksA self-stabilizing algorithm for the shortest path problem assuming read/write atomicityA fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networksTimer-based composition of fault-containing self-stabilizing protocolsA self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicitySnap-Stabilizing Waves in Anonymous NetworksSelf-stabilizing \(\ell\)-exclusionShort correctness proofs for two self-stabilizing algorithms under the distributed daemon modelSelf-stabilizing ring orientation using constant spaceA transformation of self-stabilizing serial model programs for asynchronous parallel computing environmentsQuasi-self-stabilization of a distributed system assuming read/write atomicityA New Polynomial Silent Stabilizing Spanning-Tree Construction AlgorithmStabilizing time-adaptive protocolsSelf-stabilizing depth-first token circulation on networksNew Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating SetsSELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEMA self-stabilizing algorithm for the shortest path problem assuming the distributed demonSelf-stabilization with path algebra



Cites Work


This page was built for publication: Self-stabilization of dynamic systems assuming only read/write atomicity