An efficient counting network

DOI10.1016/j.tcs.2010.04.023zbMath1196.68019OpenAlexW2097796542MaRDI QIDQ986532

Costas Busch, Marios Mavronicolas

Publication date: 11 August 2010

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

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

zbMATH Keywords

shared memorydistributed data structurecounting networkbalancing networkcontention

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data structures (68P05) Distributed systems (68M14)

Related Items

Solo-valency and the cost of coordination ⋮ Read-modify-write networks ⋮ The impact of randomization in smoothing networks ⋮ Sequentially consistent versus linearizable counting networks ⋮ Public data structures: counters as a special case.

Cites Work

• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• A steady state analysis of diffracting trees
• Sorting and counting networks of arbitrary width and small depth
• The cost of concurrent, low-contention Read \& Modify \& Write
• Self-stabilizing smoothing and balancing networks
• Randomized smoothing networks
• Contention in shared memory algorithms
• Counting networks
• A combinatorial treatment of balancing networks
• Counting networks with arbitrary fan-out
• Linearizable counting networks
• Read-modify-write networks
• Coins, weights and contention in balancing networks
• On the Number of Stable States in a NOR Network
• The impact of randomization in smoothing networks