Multidestination message passing is attractiue in multicast communication because it reduces software overheads at processor nodes effectively. Combining the best features of two existing approaches: tree-based multicast and multidestination message passing, we propose a novel tree-based multidestination multicast scheme named TBM, which employs a new efficient multidestination message format. The TBM scheme reduces the overheads by allowing a message to be concurrently copied into one destination node while it is being forwarded to the next destination. More-over, many multidestionation messages can be trans-ferred concurrently based on the tree-based commu-nication paradigm, which reduces the communication steps. In order to support TBM, the message format provides efficient multi-address encoding to be easily implemented at routers. By detailed analysis and sim-ulation, the results show that TBM is more preferable than traditional Umesh(1), Hamiltonian Path(2) and BRCPL-HL(C,R)(3) multicast schemes, which indicates that current and fulure massively parallel systems can take advantage of this scheme to implement fast and scalable cllective communication operations.
展开▼
