Self-stabilizing smoothing and balancing networks

DOI10.1007/s00446-005-0130-yzbMath1266.68056OpenAlexW2096567392WikidataQ60148607 ScholiaQ60148607MaRDI QIDQ2375300

Srikanta Tirthapura, Maurice P. Herlihy

Publication date: 13 June 2013

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

Full work available at URL: https://doi.org/10.1007/s00446-005-0130-y

zbMATH Keywords

self-stabilizationsmoothing networkscounting networks

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (5)

Quantized consensus ⋮ Quantized consensus in Hamiltonian graphs ⋮ An efficient counting network ⋮ Smoothed analysis of balancing networks ⋮ Sequentially consistent versus linearizable counting networks

Cites Work

• Unnamed Item
• Sorting and counting networks of arbitrary width and small depth
• Randomized smoothing networks
• The periodic balanced sorting network
• Self-stabilizing systems in spite of distributed control
• Counting networks
• Coins, weights and contention in balancing networks

This page was built for publication: Self-stabilizing smoothing and balancing networks