Abstract
Supporting multicast at hardware level is a future trend of interconnection networks, and the latency of hardware-based multicast is sensitive to network conflict. In this paper, we study the method to forecast and reduce the conflict between unicast and multicast traffic on k-ary n-trees. We first derive a switch grouping method to describe the relationship among switches being passed through by a unicast routing path or a multicast tree. Then we analyze the sufficient condition for conflict-free routing. Based on these observations, a look-ahead adaptive routing strategy for unicast packet is proposed. The simulation results indicate that the proposed strategy can lower the multicast latency and the unicast latency simultaneously.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Petrini, F., Vanneschi, M.: k-ary n-trees: High Performance Networks for Massively Parallel Architecture. In: International Parallel Processing Symposium, Geneva, Switzerland, pp. 87–93 (April 1997)
Petrini, F., Feng, W.c., Hoisie, A., Coll, S., Frachtenberg, E.: The Quadrics Network: High Performance Clustering Technology. IEEE Micro 22(1), 46–57 (2002)
Panda, D.K.: Issues in Designing Efficient and Practical Algorithms for Collective Communication in Wormhole Routed Systems. In: 1995 WorkShop on Challenges for Parallel Processing, pp. 8–15 (1995)
Ni, L.M.: Should Scalable Parallel Computer support Efficient Hardware Multicast? In: Proceeding of the ICPP Workshop on Challenges for Parallel Processing, pp. 2–7 (1995)
http://www.supercomp.de/isc2005/index.php?s=tutorial&unterseite=overview
Panda, D.K., Sivaram, R.: Fast Broadcast and Multicast in Wormhole Mutistage Networks with Multidestination worms. Tech. Rep. OSU-CISRC-04/95-TR21, Department of Computer and Information Science, Ohio State University (1995)
Varavithya, V., Mohapatra, P.: Tree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks. In: Proceedings of the International Conference on Parallel Processing (1997)
Kumar, S.: Optimizing Communication for Massively Parallel Processing, PhD thesis, department of computer science, university of Illinois at Urbana-Champaign (May 2005)
Sun, Q., Zhang, M., Xiao, L.: Hardware-Based Multicast with Global Load Balance on k-ary n-trees, in Proceedings of the International Conference on Parallel Processing (2007)
Aydogan, Y.: Adaptive Source Routing and Route Generation for Multicomputers, Master thesis, department of computer engineering and information science. Bilkent University
Lin, X., Ni, L.M.: Deadlock-free Multicast Wormhole Routing in Multicomputer Networks. In: Proceedings of the International Symposium on Computer Architecture, pp. 116–124 (1991)
http://www.cosc.canterbury.ac.nz/research/RG/net_sim/simulation_group/akaroa/
Mhamdi, L., Vassiliadis, S.: Integrating Uni- and Multicast Scheduling in Buffered Crossbar Switches. In: Workshop on High Performance Switching and Routing (2006)
Prabhakar, B., Mckeown, N., Ahuja, R.: Multicast Scheduling for Input-Queued Switches. IEEE Journal of Selected Arears Communication 15(5), 855–866 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, Q., Xiao, L., Zhang, M. (2007). Look-Ahead Adaptive Routing on k-Ary n-Trees. In: Xu, M., Zhan, Y., Cao, J., Liu, Y. (eds) Advanced Parallel Processing Technologies. APPT 2007. Lecture Notes in Computer Science, vol 4847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76837-1_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-76837-1_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76836-4
Online ISBN: 978-3-540-76837-1
eBook Packages: Computer ScienceComputer Science (R0)