Simulation of modern parallel systems: a CSIM-based approach
Proceedings of the 29th conference on Winter simulation
Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Collective communications compose a significant portion of the communications in many high performance applications. The multidestination message passing mechanism has been proposed recently for efficient implementation of collective operations by using a fewer number of communication phases. However, this mechanism has been only employed for improving the performance of non-personalized collective operations such as multicast. In this paper, we investigate whether multidestination message passing can also help personalized communications such as one-to-all scatter. We propose a new scheme, called Sequential Multidestination Tree-based (SMT) scheme, which takes advantage of the multidestination message passing mechanism and provide a better performance. For a range of system sizes and parameters, it is shown that the SMT scheme outperforms other known schemes for a wide range of message lengths.