Architectures and message-passing algorithms for cluster computing: Design and performance

DOI10.1016/S0167-8191(99)00107-6MaRDI QIDQ1978547zbMATH OpenFDO

Authors Yanyan Li

Publication date 4 June 2000

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

efficiencyscalabilityspeedupmessage-passingoptimum sizeall-gathercluster topology

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1729266
• Understanding performance of SMP clusters running MPI programs
• scientific article; zbMATH DE number 2089192
• scientific article; zbMATH DE number 2090659
• Factors involved in the performance of computations on Beowulf clusters

Cited in

(4)

• Efficient communication using message prediction for clusters of multiprocessors
• scientific article; zbMATH DE number 1919451 (Why is no real title available?)
• scientific article; zbMATH DE number 1729266 (Why is no real title available?)
• Message-passing on PCI-SCI network interfaces

This page was built for publication: Architectures and message-passing algorithms for cluster computing: Design and performance

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