The increasing number of collective communication-based services with a mass interest and the parallel increasing demand for service quality are paving the way toward end-to-end QoS guarantees. Although many multicast algorithms in interconnection networks have been wid... View more
 N.-C. Wang, C.-P. Yen, and C.-P. Chu, “Multicast Communication in Wormhole-Routed Symmetric Networks with Hamiltonian Cycle Model,” J. Systems Architecture, vol. 51, no. 3, pp. 165-183, Mar. 2005.
 A. Al-Dubai, M. Ould-Khaoua, and L. Mackenzie, “An Efficient Path-Based Multicast Algorithm for Mesh Networks,” Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS), p. 283, 2003.
 J. Duato, C. Yalamanchili, and L. Ni, Interconnection Networks: An Engineering Approach. Elsevier Science, 2003.
 A. Touzene, “Optimal All-Ports Collective Communication Algorithms for the k-Ary n-Cube Interconnection Networks,” J. Systems Architecture, vol. 50, no. 4, pp. 169-236, 2004.
 C. Busch, M. Magdon-Ismail, and J. Xi, “Optimal Oblivious Path Selection on the Mesh,” IEEE Trans. Computers, vol. 57, no. 5, pp. 660-671, May 2008.
 P.K. McKinley and C. Trefftz, “MultiSim: A Simulation Tool for the Study of Large-Scale Multiprocessors,” Proc. Int'l Symp. Modeling, Analysis and Simulation of Computer and Telecomm. Systems (MASCOTS '93), pp. 57-62, 1993.