A method for exploiting communication/computation overlap in hypercubes

DOI10.1016/S0167-8191(98)00005-2MaRDI QIDQ1128823zbMATH OpenOpenAlexFDO

Authors S. H. Smith, Luis Díaz de Cerio, M. Valero-García, Antonio González

Publication date 13 August 1998

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(98)00005-2

zbMATH Keywords

communication pipeliningcommunication/computation overlapFFThypercubeperformance modelingvector add

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Recommendations

• Communication-efficient matrix multiplication on hypercubes
• A MULTICAST ALGORITHM FOR HYPERCUBE MULTIPROCESSORS
• Hypercube matrix multiplication
• Routing multiple paths in hypercubes
• scientific article; zbMATH DE number 1196808

Cited in

(5)

• On the communication structures of hyper-ring and hypercube multicomputers
• scientific article; zbMATH DE number 1196808 (Why is no real title available?)
• scientific article; zbMATH DE number 1830926 (Why is no real title available?)
• Optimizing remote method invocation with communication–computation overlap
• Communication efficient matrix multiplication on hypercubes

This page was built for publication: A method for exploiting communication/computation overlap in hypercubes

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