Filters








5,087 Hits in 4.1 sec

Scalable Hardware-Based Multicast Trees

Salvador Coll, Duato Duato, Fabrizio Petrini, Francisco J. Mora
2003 Proceedings of the 2003 ACM/IEEE conference on Supercomputing - SC '03  
Finally, our experimental results show the good performance and scalability of the proposed multicast tree in comparison to the traditional unicast-based multicast trees.  ...  Section 4 presents the hardware-based multicast trees developed by us and Section 5 proposes two algorithm implementations to obtain multicast trees.  ...  These results show that hardware-based multicast trees provide a scalable and fault-tolerant alternative to software-based multicast trees, while overcoming the limitations of the hardware support for  ... 
doi:10.1145/1048935.1050205 dblp:conf/sc/CollDPM03 fatcat:drgoiw7objfphng2o4ppvk3pju

Collective Communication Patterns on the Quadrics Network [chapter]

Salvador Coll, José Duato, Francisco J. Mora, Fabrizio Petrini, Adolfy Hoisie
2004 Performance Analysis and Grid Computing  
Both of them are implemented in two different ways, either using the hardware support, when nodes are contiguous, or a balanced tree and unicast messaging, otherwise.  ...  The Quadrics interconnect (QsNET), which is being used in some of the largest machines in the world, provides hardware support for multicast.  ...  Hardware-Based Multicast Hardware-based broadcasts are propagated into the network by sending a packet to the top of the tree and then forwarding the packet to more than one switch output as the packet  ... 
doi:10.1007/978-1-4615-0361-3_6 fatcat:gkugifwaungkxexmcxftsnvlzu

LRUM

Hoang-Vu Dang, Brian Smith, Richard Graham, Gilad Shainer
2018 Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region - HPC Asia 2018  
These are based on using the InfiniBand unreliable datagram (UD) hardware multicast capabilities, with a latency which is very close to that of the MPI ping-pong point-topoint latency between the root  ...  To support this switch hardware capability, a multicast tree spanning the multicast group is defined.  ...  RELATED WORK Broadcast algorithms based on Mellanox's hardware multicast capabilities have been developed before. Liu et al.  ... 
doi:10.1145/3149457.3149467 dblp:conf/hpcasia/DangSGS18 fatcat:euwgtfzkl5hrxiatdhplyefdre

Virtual Circuit Tree Multicasting: A Case for On-Chip Hardware Multicast Support

Natalie Enright Jerger, Li-Shiuan Peh, Mikko Lipasti
2008 2008 International Symposium on Computer Architecture  
In this paper, we characterize a wide array of on-chip communication scenarios that benefit from hardware multicast support.  ...  We propose Virtual Circuit Tree Multicasting (VCTM) and present a detailed multicast router design that improves network performance by up to 90% while reducing network activity (hence power) by up to  ...  We further evaluate VCTM using path-based multicast routing rather than tree-based multicasting.  ... 
doi:10.1109/isca.2008.12 dblp:conf/isca/JergerPL08 fatcat:6rrykoxoc5ernmqreqw4sxuoha

A Novel Approach to Support Scalable Multicast Routing in Wireless Ad Hoc Networks

Mohammad M. Qabajeh
2022 International Journal of Interactive Mobile Technologies  
However, they do not consider scalability issue. This paper introduces a a novel Scalable Geographic Multicast Routing Protocol (SGMRP).  ...  The main objective of this protocol is to design a lightweight scalable multicast routing scheme irrespective of the number of multicast members and network size.  ...  Conclusion The current paper proposes a tree-based multicast protocol called Scalable Geographic Multicast Routing Protocol (SGMRP) to solve scalability issue.  ... 
doi:10.3991/ijim.v16i07.29195 fatcat:lfyml4hsmzbshbrci7ulz4h3xe

A Unified Unicast and Multicast Routing and Forwarding Algorithm for Software-Defined Datacenter Networks

Wen-Kang Jia, Li-Chun Wang
2013 IEEE Journal on Selected Areas in Communications  
In this article, we consider a scalability problem associated with software-defined datacenter, of which the unicast/multicast routing states is proven to be NP-complete.  ...  The result is then used to make a forwarding decision within few cycles through a hardware accelerator.  ...  tree, while the multicast session is in progress.  ... 
doi:10.1109/jsac.2013.131206 fatcat:5awcbwkxq5eg7ilwq5cvydnm54

Ernie: Scalable Load-Balanced Multicast Source Routing for Cloud Data Centers

Jarallah Alqahtani, Bechir Hamdaoui, Rami Langar
2021 IEEE Access  
This paper proposes Ernie, a scalable load-balanced multicast source routing for large-scale DCs.  ...  Unfortunately, recent approaches adopting IP multicast routing suffer from scalability and load balancing issues, and do not scale well with the number of supported multicast groups when used for cloud  ...  This shows the scalability obstacle of switch-based multicast schemes in today's public clouds. In Elmo, switch memory cost depends on the placement strategies and the number of multicast groups.  ... 
doi:10.1109/access.2021.3136816 fatcat:4zjrknrffvbspez4wkwms36eky

Self-Healing Network for Scalable Fault Tolerant Runtime Environments [chapter]

Thara Angskun, Graham E. Fagg, George Bosilca, Jelena Pješivac-Grbović, Jack J. Dongarra
2007 Distributed and Parallel Systems  
Scalable and fault tolerant runtime environments are needed to support and adapt to the underlying libraries and hardware which require a high degree of scalability in dynamic large-scale environments.  ...  The experimental results show that both the latest multicast and broadcast routing algorithms used in SHN are faster than the original SFTP routing algorithms.  ...  The scalable and fault-tolerant protocol (SFTP) [1] was introduced to support parallel runtime environments. The protocol is based on a k-ary sibling tree.  ... 
doi:10.1007/978-0-387-69858-8_8 fatcat:xlev6tjxgjc2zkptwyyuwnhhle

Self-healing network for scalable fault-tolerant runtime environments

Thara Angskun, Graham Fagg, George Bosilca, Jelena Pješivac-Grbović, Jack Dongarra
2010 Future generations computer systems  
Scalable and fault tolerant runtime environments are needed to support and adapt to the underlying libraries and hardware which require a high degree of scalability in dynamic large-scale environments.  ...  The experimental results show that both the latest multicast and broadcast routing algorithms used in SHN are faster than the original SFTP routing algorithms.  ...  The scalable and fault-tolerant protocol (SFTP) [1] was introduced to support parallel runtime environments. The protocol is based on a k-ary sibling tree.  ... 
doi:10.1016/j.future.2009.04.001 fatcat:ptfjhnu3hvektfdgqqrkijib44

Scalable multicast forwarding

Björn Grönvall
2002 Computer communication review  
Thus, leak probabifity decays exponentially as we travel down (or up) the tree. Also, hosts configure their network adaptors to filter out unwanted multicasts.  ...  The suggested probabilisfic-forwardin g algorithm has an efficient implementation based on Bloom filters.  ...  Thus, leak probabifity decays exponentially as we travel down (or up) the tree. Also, hosts configure their network adaptors to filter out unwanted multicasts.  ... 
doi:10.1145/510726.510742 fatcat:zi3gn3hvurhdraaeeuqhax7w4m

isBF

Ilya Nikolaevskiy, Andrey Lukyanenko, Tatiana Polishchuk, Valentin Polishchuk, Andrei Gurtov
2013 Proceedings of the 28th Annual ACM Symposium on Applied Computing - SAC '13  
Bloom-filter (BF) based forwarding was proposed recently in several protocol alternatives to IP multicast.  ...  Some of these protocols avoid the state in intermediate routers and leave the burden of scalability management to the multicast source and end-hosts.  ...  The Topology-based tree splitting algorithm produces BFs corresponding to each active node.  ... 
doi:10.1145/2480362.2480484 dblp:conf/sac/NikolaevskiyLPPG13 fatcat:3y6kniw2c5cjtnl3lt47mt7dpy

Enabling Content Dissemination Using Efficient and Scalable Multicast

T. W. Cho, M. Rabinovich, K. K. Ramakrishnan, D. Srivastava, Y. Zhang
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
MAD can scalably support a vast number of multicast groups, with varying activity over time, based on two key novel ideas: (i) decouple group membership from forwarding information, and (ii) apply an adaptive  ...  These requirements raise scalability challenges that are not met by today's multicast techniques.  ...  Aggregated Multicast [13] aggregates multiple base multicast groups into a single tree to achieve better scalability (at the expense of sending irrelevant content to a subset of the members).  ... 
doi:10.1109/infcom.2009.5062120 dblp:conf/infocom/ChoRRSZ09 fatcat:qjlumm6nqjfnzomz2gepafdxri

Scaling Bloom filter-based multicast via filter switching

Christos Tsilopoulos, George Xylomenos
2013 2013 IEEE Symposium on Computers and Communications (ISCC)  
Stateless multicast forwarding with in-packet Bloom filters (iBF) has recently been proposed as a highly scalable way for supporting a large number of multicast groups.  ...  Hence, even though the system is no more fully stateless, it remains far more scalable than other approaches. Index Terms-in-packet Bloom filters, multicast packet forwarding, switched-iBFs  ...  The forwarding logic is based on simple bitwise operations and can be easily implemented in hardware [2] . On the other hand, iBF multicast scales poorly with respect to multicast group size.  ... 
doi:10.1109/iscc.2013.6755003 dblp:conf/iscc/TsilopoulosX13 fatcat:usoanlw4cnaenk6evykca5wliy

PortLand

Radhika Niranjan Mysore, Andreas Pamboris, Nathan Farrington, Nelson Huang, Pardis Miri, Sivasankar Radhakrishnan, Vikram Subramanya, Amin Vahdat
2009 Proceedings of the ACM SIGCOMM 2009 conference on Data communication - SIGCOMM '09  
This paper considers the requirements for a scalable, easily manageable, fault-tolerant, and efficient data center network fabric.  ...  We leverage this observation in the design and implementation of PortLand, a scalable, fault tolerant layer 2 routing and forwarding protocol for data center environments.  ...  Two recent proposals [14, 6] suggest topologies based on fat trees [18] .  ... 
doi:10.1145/1592568.1592575 dblp:conf/sigcomm/MysorePFHMRSV09 fatcat:joc3qarcwrdkpjefhfjbwgs4tu

A practically constant-time MPI Broadcast Algorithm for large-scale InfiniBand Clusters with Multicast

Torsten Hoefler, Christian Siebert, Wolfgang Rehm
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
The hardware multicast operation seems to be applicable to switch-based InfiniBand cluster systems.  ...  We implemented our algorithm as a collective component for the Open MPI framework using native InfiniBand multicast and we show its scalability on a cluster with 116 compute nodes, where it saves up to  ...  The Multicast-Based Broadcast Algorithm Several multicast-based broadcast algorithms have been proposed in the past.  ... 
doi:10.1109/ipdps.2007.370475 dblp:conf/ipps/HoeflerSR07 fatcat:bpf57bn5b5a6tm37o2ewvsglhq
« Previous Showing results 1 — 15 out of 5,087 results