A lower bound for communication on the crossbar

DOI10.1016/0020-0190(95)00195-6MaRDI QIDQ672740zbMATH OpenOpenAlexFDO

Authors 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

CrossbarLower boundsParallel processing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites work

• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Distributed near-optimal matching
• Fast randomized algorithms for distributed edge coloring (extended abstract)
• scientific article; zbMATH DE number 3711961 (Why is no real title available?)
• scientific article; zbMATH DE number 1142307 (Why is no real title available?)
• On contention resolution protocols and associated probabilistic phenomena

Cited in

(2)

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

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

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