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

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

D. Massart

Publication date: 22 July 1998

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

zbMATH Keywords

optimal schedule; collective communication; divide-and-conquer; message-passing; workstation cluster; IBM SP2; SUN SPARC-10

Mathematics Subject Classification ID

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