Time-step optimal broadcasting in 3-D meshes with minimum total communication distance

DOI10.1006/JPDC.2000.1642zbMATH Open0962.68006OpenAlexW2038562059MaRDI QIDQ1581283FDOQ1581283

Authors: Songluan Cang, Jie Wu 

Publication date: 13 June 2001

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2000.1642

Recommendations

• Optimal broadcast for fully connected processor-node networks
• Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing
• Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
• Broadcasting in wraparound meshes with parallel monodirectional links
• 3-D Minimum Energy Broadcasting

zbMATH Keywords

total communication distance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer system organization (68M99)

Cited In (2)

• Towards scalable collective communication for multicomputer interconnection networks
• Communication algorithms for isotropic tasks in hypercubes and wraparound meshes

This page was built for publication: Time-step optimal broadcasting in 3-D meshes with minimum total communication distance

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