Abstract
Random network topologies have been proposed for building a low-latency network for parallel-computing systems. However, collective communication algorithms are not well considered on random network topologies. In this context, we investigate the performance impact of existing topologyagnostic collective communication algorithms on random network topologies. Evaluation results using discrete event simulation showed that (1) the Chain Concatenation Order (CCO) algorithm improved up to 10% of broadcast operations compared to Random Order algorithm, and (2) the performance of the CCO broadcast operations on random topology was better than that of a conventional broadcast operation on 3dtorus.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
