An efficient counting network

DOI10.1016/J.TCS.2010.04.023zbMATH Open1196.68019OpenAlexW2097796542MaRDI QIDQ986532FDOQ986532

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

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

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)

Cites Work

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

Cited In (12)

• Read-modify-write networks
• Title not available (Why is that?)
• Counting networks
• Sequentially consistent versus linearizable counting networks
• Counting networks with arbitrary fan-out
• Sorting and counting networks of arbitrary width and small depth
• Design and implementation of counting networks
• Public data structures: counters as a special case.
• Title not available (Why is that?)
• The impact of randomization in smoothing networks
• Solo-valency and the cost of coordination
• Supporting increment and decrement operations in balancing networks

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)