TY - JOUR
T1 - Architecture-dependent tuning of the parameterized communication model for optimal multicasting
AU - Nupairoj, Natawut
AU - Ni, Lionel M.
AU - Park, Ju Young L.
AU - Choi, Hyeong Ah
PY - 1997
Y1 - 1997
N2 - A key issue in designing software multicast algorithms is to consider the trade-off between performance and portability. Portable software multicast algorithms which base on generic communication models cannot capture some architecture-specific features. Without considering the underlying network architecture, these multicast algorithms may not achieve the truly optimal performance when implemented in real networks. The objective of this research is to investigate architecture-dependent tuning on performance of multicast algorithms developed based on architecture-independent models. Specifically, we intend to optimize the multicast algorithm based on the parameterized communication model. We propose two multicast algorithms, OPT-mesh and OPT-min which are the optimized versions of the parameterized multicast algorithm for wormhole-switched mesh networks and BMIN networks, respectively. Using our flit-level simulator, the performance of both algorithms are compared with the architecture-independent version of the parameterized multicast algorithm and two other well-known network-dependent algorithms based on the binomial tree.
AB - A key issue in designing software multicast algorithms is to consider the trade-off between performance and portability. Portable software multicast algorithms which base on generic communication models cannot capture some architecture-specific features. Without considering the underlying network architecture, these multicast algorithms may not achieve the truly optimal performance when implemented in real networks. The objective of this research is to investigate architecture-dependent tuning on performance of multicast algorithms developed based on architecture-independent models. Specifically, we intend to optimize the multicast algorithm based on the parameterized communication model. We propose two multicast algorithms, OPT-mesh and OPT-min which are the optimized versions of the parameterized multicast algorithm for wormhole-switched mesh networks and BMIN networks, respectively. Using our flit-level simulator, the performance of both algorithms are compared with the architecture-independent version of the parameterized multicast algorithm and two other well-known network-dependent algorithms based on the binomial tree.
UR - http://www.scopus.com/inward/record.url?scp=0030694973&partnerID=8YFLogxK
U2 - 10.1109/IPPS.1997.580959
DO - 10.1109/IPPS.1997.580959
M3 - Conference article published in journal
AN - SCOPUS:0030694973
SN - 1063-7133
SP - 578
EP - 582
JO - Proceedings of the International Parallel Processing Symposium, IPPS
JF - Proceedings of the International Parallel Processing Symposium, IPPS
T2 - Proceedings of the 1997 11th International Parallel Processing Symposium, IPPS 97
Y2 - 1 April 1997 through 5 April 1997
ER -