An efficient counting network

DOI10.1016/J.TCS.2010.04.023MaRDI QIDQ986532zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Counting networks
• Design and implementation of counting networks
• scientific article; zbMATH DE number 742955
• Counting networks with arbitrary fan-out
• Linearizable counting networks
• Efficient counting with optimal resilience
• Efficient counting with optimal resilience
• Sequentially consistent versus linearizable counting networks
• scientific article; zbMATH DE number 7204563
• Towards optimal synchronous counting

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A combinatorial treatment of balancing networks
• A steady state analysis of diffracting trees
• Coins, weights and contention in balancing networks
• Contention in shared memory algorithms
• Counting networks
• Counting networks with arbitrary fan-out
• Linearizable counting networks
• On the Number of Stable States in a NOR Network
• Randomized smoothing networks
• Read-modify-write networks
• Self-stabilizing smoothing and balancing networks
• Sorting and counting networks of arbitrary width and small depth
• Sorting in \(c \log n\) parallel steps
• Supporting increment and decrement operations in balancing networks
• The cost of concurrent, low-contention Read \& Modify \& Write
• The impact of randomization in smoothing networks

Cited in

(12)

• Solo-valency and the cost of coordination
• Design and implementation of counting networks
• Sequentially consistent versus linearizable counting networks
• Counting networks with arbitrary fan-out
• Supporting increment and decrement operations in balancing networks
• Read-modify-write networks
• scientific article; zbMATH DE number 742955 (Why is no real title available?)
• scientific article; zbMATH DE number 2006662 (Why is no real title available?)
• The impact of randomization in smoothing networks
• Counting networks
• Public data structures: counters as a special case.
• Sorting and counting networks of arbitrary width and small depth

This page was built for publication: An efficient counting network

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