Counting networks with arbitrary fan-out

DOI10.1007/BF02242734zbMath1448.68058MaRDI QIDQ5136991

Eran Aharonson, Hagit Attiya

Publication date: 30 November 2020

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

zbMATH Keywords

load balancingsmoothing networksproducer/consumer

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (3)

Impossibility results for weak threshold networks ⋮ An efficient counting network ⋮ Threshold counters with increments and decrements

Cites Work

• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• The periodic balanced sorting network
• Counting networks
• A combinatorial treatment of balancing networks

This page was built for publication: Counting networks with arbitrary fan-out