Counting networks with arbitrary fan-out

DOI10.1007/BF02242734zbMATH Open1448.68058MaRDI QIDQ5136991FDOQ5136991

Authors: Eran Aharonson, Hagit Attiya 

Publication date: 30 November 2020

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

Recommendations

• scientific article; zbMATH DE number 742955
• Design and implementation of counting networks
• A combinatorial treatment of balancing networks
• Supporting increment and decrement operations in balancing networks
• An efficient counting network

zbMATH Keywords

load balancingproducer/consumersmoothing networks

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Counting networks
• Sorting in \(c \log n\) parallel steps
• The periodic balanced sorting network
• A combinatorial treatment of balancing networks

Cited In (4)

• Title not available (Why is that?)
• An efficient counting network
• Impossibility results for weak threshold networks
• Threshold counters with increments and decrements

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

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