The dance party problem and its application to collective communication in computer networks

DOI10.1016/S0167-8191(97)00041-0zbMATH Open0904.68014MaRDI QIDQ1391210

D. Massart

Publication date: 22 July 1998

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

zbMATH Keywords

optimal schedulecollective communicationdivide-and-conquermessage-passingworkstation clusterIBM SP2SUN SPARC-10

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

The congenial talking philosophers problem in computer networks

This page was built for publication: The dance party problem and its application to collective communication in computer networks

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