Resource Bounds for Self-Stabilizing Message-Driven Protocols
From MaRDI portal
Publication:4337445
DOI10.1137/S0097539792235074zbMath0868.68006MaRDI QIDQ4337445
Amos Israeli, Shlomo Moran, Shlomi Dolev
Publication date: 3 August 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792235074
68M10: Network design and communication in computer systems
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68W10: Parallel algorithms in computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks, Universal dynamic synchronous self-stabilization, Self-stabilizing systems in spite of high dynamics, A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs, Randomization adaptive self-stabilization, Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative, Self-stabilization with path algebra, Stabilizing data-link over non-FIFO channels with optimal fault-resilience, When consensus meets self-stabilization, Practically stabilizing SWMR atomic memory in message-passing systems, SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
