We present efficient algorithms for designing optimal collective communication primitives for
cluster-based heterogeneous computing across ATM networks. Specifically, we consider the
following four collective communication problems that occur frequently in parallel computing:
one-to-all broadcast, all-to-all broadcast, one-to-all scatter and one-to-all scatter. We
formulate these problems as combinatorial optimization problems for finding a system of
virtual path routes in the network, with the objectives of minimizing the path lengths, the link …

We present efficient algorithms for designing optimal collective communication primitives for
cluster-based heterogeneous computing across Asynchronous Transfer Mode (ATM)
networks. The virtual path (VP) concept is known to be a powerful transport mechanism for
ATM networks. In many parallel processing applications, the potential communication
pattern is known in advance. We then seek to find an optimal set of virtual paths to realize
the communication pattern, such that the communication overhead of the parallel processing …