-
...recently, wormhole routers with multi-destination capability have been proposed to support fast multicast in a multi-computer network. in this paper, we develop a new multicasting model for such networks based on the concept of euler path/circuit in graph theory. the...
-
...we develop a new multicasting model for wormhole-routed networks based on the concept of euler path in graph theory. the model...demonstrate the power of this model by showing its fault-tolerant capability in supporting multicasting in a damaged 2-d torus/meshes with regular fault patterns (such as...
-
...paper, we develop a new multicasting model for wormhole-routed networksbased on the concept of euler path in graph theory. the model can support multiplemulticasts freely from...by showing its fault-tolerant capability in supporting multicasting in a damaged 2-dtorus or mesh with regular fault patterns (such as...
Published in 1996.
-
...be propagated along any valid path in a wormhole- routed network conforming to the underlying base routing scheme. the multicast on the path-based routing model is highly dependent on the...propose two proximity grouping schemes for eacient multicast in wormhole-routed mesh networks with multidestination capability by exploiting the spatial locality...
-
...a perfor- mance analysis on wormhole-rout ed networks shows that our routing algorithm outperforms existing multi- casting procedures. 1 introduction multicasting is an important communication pat- tern where...al.(lo) have shown that path based multicasting is suitable for wormhole routed networks. in path-based multicasting a path is found which originates at...
-
...shown their efficiency on interconnection networks. among these schemes, path based multicast has been proven to be...this paper, therefore, focuses on path based scheme, examining some well-known path-based algorithms. many experiments have been...
-
...recently, wormhole routers with multi-destination capability have been proposedto support fast multicast in a multi-computer network. to avoid communicationdeadlock, existing results have proposed to construct a hamilton path, eulerpath, trip, or their variants, in the network, perhaps with some degree of supportof virtual...
-
...will address a dual-tree-based routing model and propose an efficient dual-tree- based multicasting algorithm with three destination-switch partition strategies on irregular switch-based networks. the dual-tree-based routing scheme supports adaptive, distributed, and deadlock-free multi- cast on switch-based networks with double channels. we first describe...
-
...paper, we present a multipath-based multicast routing model for wormholerouted star graph networks, propose two efficient multipath routing schemes, and contrast the performance...free. the first scheme, simplemultipath routing, uses multiple independent paths for concurrent multicasting. the second scheme, two-phase multipath routing, includes two phases: source-to...
-
multicasting is an important issue for numerous applications in parallel and distributed computing. in multicasting, the same message is delivered...efficient and deadlock-free tree-based multi-cast routing scheme for wormhole-routed star graph networks with hamiltonian path. in our proposed routing scheme, the router is with...