A lower bound for communication on the crossbar

DOI10.1016/0020-0190(95)00195-6zbMath0998.68506OpenAlexW1963752958MaRDI QIDQ672740

Xiaotie Deng

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00195-6

zbMATH Keywords

Parallel processingLower boundsCrossbar

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

The binding number of a graph and its circuits ⋮ The binding number of a graph and its triangle

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed near-optimal matching
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Fast randomized algorithms for distributed edge coloring
• On contention resolution protocols and associated probabilistic phenomena

This page was built for publication: A lower bound for communication on the crossbar