Efficient Scatter Communication in Wormhole k-Ary n-Cubes with Multidestination Message Passing

Abstract

This paper presents efficient ways to implement one-to-all scatter communication on k-ary n-cubes with multidestination message-passing. Earlier researchers have applied multidestination message-passing to support non-personalized communications. In this paper, for the first time in the literature, we demonstrate that multidestination message-passing can also be used to support efficient personalized communication. Current parallel systems use either a sequential tree-based (ST) scheme or a binomial tree-based (BT) scheme with unicast message-passing to implement scatter. First, we show that the ST scheme achieves the lower bound just for a narrow range of message lengths. Next, we show that the BT scheme has a better overall performance compared to ST but, it can never achieve the lower bound. Finally, we propose a sequential multidestination tree-based (SMT) scheme using multidestination messages which minimizes the scatter latency as well as achieves the lower bound. This scheme a..