Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Al Dubai, A.Y.; Ould-Khaoua, M.; Mackenzie, L.M. (2010)
Publisher: IEEE
Languages: English
Types: Article
Subjects: QA75

Classified by OpenAIRE into

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 widely reported in the literature, most of them handle the multicast communication within limited performance metrics, i.e., either delay/latency or throughput. In contrast, this study investigates the multicast communication within a group of QoS constrains, namely latency, jitter, throughput, and additional traffic caused. In this paper, we present the Qualified Groups (QGs) as a novel path-based multicast algorithm for interconnection networks. To the best of our knowledge, the QG is the first multicast algorithm that considers the multicast latency at both the network and node levels across different traffic scenarios in interconnection networks. Our analysis shows that the proposed multicast algorithm exhibits superior performance characteristics over other well-known path-based multicast algorithms under different operating conditions. In addition, our results show that the QG can significantly improve the parallelism of the multicast communication.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] 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.
    • [2] 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.
    • [3] J. Duato, C. Yalamanchili, and L. Ni, Interconnection Networks: An Engineering Approach. Elsevier Science, 2003.
    • [4] 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.
    • [5] 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.
    • [6] 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.
    • [7] CSIM: Internet: http://www.mesquite.com/, 2009.
    • [8] E. Fleury and P. Fraigniaud, “Strategies for Path-Based Multicasting in Wormhole-Routed Meshes,” J. Parallel and Distributed Computing, vol. 60, pp. 26-62, 1998.
    • [9] D. Xiang, Y. Zhang, and Y. Pan, “Practical Deadlock-Free FaultTolerant Routing in Meshes Based on the Planar Network Fault Model,” IEEE Trans. Computers, vol. 58, no. 5, pp. 620-633, May 2009.
    • [10] X. Lin, P. McKinley, and L.M. Ni, “Deadlock-Free Multicast Wormhole Routing in 2D-Mesh Multicomputers,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 793-804, Aug. 1994.
    • [11] S. Cang and J. Wu, “Time-Step Optimal Broadcasting in 3-D Meshes with Minimal Total Communication Distance,” J. Parallel and Distributed Computing, vol. 60, pp. 966-997, 2000.
    • [12] D.F. Robinson, P.K. McKinley, and C. Cheng, “Path Based Multicast Communication in Wormhole Routed Unidirectional Torus Networks,” J. Parallel Distributed Computing, vol. 45, pp. 104- 121, 1997.
    • [13] A. Agarwal, “Limits on Interconnection Network Performance,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398- 412, Oct. 1991.
    • [14] P. Mohapatra and V. Varavithya, “A Hardware Multicast Routing Algorithm for Two Dimensional Meshes,” Proc. Eighth IEEE Symp. Parallel and Distributed Processing, pp. 198-205, Oct. 1996.
    • [15] R.V. Boppana, S. Chalasani, and C.S. Raghavendra, “Resource Deadlock and Performance of Wormhole Multicast Routing Algorithms,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 6, pp. 535-549, June 1998.
    • [16] S. Wang, Y. Tseng, C. Shiu, and J. Sheu, “Balancing Traffic Load for Multi-Node Multicast in a Wormhole 2D Torus/Mesh,” The Computer J., vol. 44, no. 5, pp. 354-367, 2001.
    • [17] Z. Lu, “Design and Analysis of On-Chip Communication for Network-on-Chip Platforms,” PhD thesis, Royal Inst. of Technology, Sweden, Mar. 2007.
    • [18] D. Panda, S. Singal, and R. Kesavan, “Multidestination Message Passing in Wormhole k-Ary n-Cube Networks with Base Routing Conformed Paths,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 1, pp. 76-96, Jan. 1999.
    • [19] K.-P. Fan and C.-T. King, “Turn Grouping for Multicast in Wormhole-Routed Mesh Networks Supporting the Turn Model,” The J. Supercomputing, vol. 16, no. 3, pp. 237-260, Jul. 2000.
    • [20] X. Zhuang and V. Liberatore, “A Recursion-Based Broadcast Paradigm in Wormhole Routed Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 11, pp. 1034-1052, Nov. 2005.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article