Y.-C. Tseng, M.-H. Yang, and T.-Y. Juang. An euler-path-based multicasting model for wormhole-routed networks with multi-destination capability. In Int'l Conf. on Parallel Processing, pages 366-373, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of backtracking in turn is a necessary condition for minimal routing, where the destination is reached through a minimal path from the source. A fault tolerant minimal routing algorithm for 2 D meshes has been developed in [9] using the faulty block model. There are several studies ( 2] and [8]) on fault tolerant routing that can handle non rectangular fault regions, such as H shape, L shape, T shape, U shape, and shape fault regions. Despite all the desirable features of the faulty block model, a major problem is that a faulty block may include many nonfaulty nodes treated as faulty ....

Y. C. Tseng, M. H. Yang, and T. Y. Juang. An Euler-pathbased multicasting model for wormhole-routed networks with multi-destination capability. Proc. of the

No context found.

Y.-C. Tseng, M.-H. Yang, and T.-Y. Juang. An euler-path-based multicasting model for wormhole-routed networks with multi-destination capability. In Int'l Conf. on Parallel Processing, pages 366-373, 1998.

....Fig. 3(a) and (b) are simple, while that in Fig. 3(c) is nonsimple. In the following discussion, we only consider faulty clusters that are simple (the reason will be discussed later) We deal with single faulty cluster first, and then multiple faulty clusters. 3. 1 Single Faulty Cluster Lemma 2 [19] The length of the perimeter of any simple faulty cluster is even. A node on a perimeter is called a corner node if it falls on a position of the perimeter where a 90 degree turn is made; otherwise it is a non corner node. For instances, nodes a and b in Fig. 3(a) are corner nodes. Lemma 3 On ....

....of the perimeter where a 90 degree turn is made; otherwise it is a non corner node. For instances, nodes a and b in Fig. 3(a) are corner nodes. Lemma 3 On the perimeter of a simple faulty cluster, every corner node has an even degree, while every non corner node has an odd degree. Lemma 4 [19] On the perimeter of a simple faulty cluster, there must be an even number of corner nodes and an even number of non corner nodes. In the following, suppose there is only one simple faulty cluster C in the network. We discuss how to construct the link set E 2 in two stages. 3.1.1 Stage 1: Making ....

[Article contains additional citation context not shown here]

Y.-C. Tseng, M.-H. Yang, and T.-Y. Juang. An Euler-path-based multicasting model for wormhole-routed networks with multi-destination capability. Technical report, Dept. of Comp. Sci. and Info. Engr., Nat'l Central Univ., 1997.

.... easier to be satisfied than requiring the network being Hamiltonian or pseudoHamiltonian (as in [13, 12] The model does not rely on the existence of virtual channels and thus is more hardwareefficient than [18] One major emphasis of this paper is to extend the previous version of this paper [10] by demonstrating the potential of our model when applied to the torus mesh topology of any dimension with faults. Many schemes have been proposed for fault tolerant routing on mehs torus like networks [1, 2, 4, 5, 9] However, most results can only tolerate a limited number of faults, usually ....

T.-Y. Juang, Y.-C. Tseng, and M.-H. Yang. An euler-path-based multicasting model for wormhole-routed networks: Its applications to damaged 2d tori and meshes. In Int'l Performance, Computing, and Communications Conf., pages 444--450, 1997.

....type of networks and does not require the support of virtual channels. It is the first multicasting model known to us in the literature with such strong fault tolerant capability. The result has significantly improved over the result in the earlier version of this paper by the same authors in [16]. Simulations have also been conducted to study the performance behavior of our model when applied to 2D tori from several aspects, such as communication parameters of the networks, nature of traffic, distribution of source and destination nodes, numbers of faults, and resilience of our model. ....

T.-Y. Juang, Y.-C. Tseng, and M.-H. Yang. An euler-path-based multicasting model for wormhole-routed networks: Its applications to damaged 2d tori and meshes. In Int'l Performance, Computing, and Communications Conf., pages 444--450, 1997. 39

....dimensionordered routing is followed. Coster et al. 5] further generalize the above idea and show that the Fibonacci trees, 1 which are generated based on the Fibonacci numbers, would be more appropriate for multicasting on meshes. References for fault tolerant multicasting are also available in [15, 14]. In contradiction to [5, 7, 10, 13] which uses only one multicast tree, in this paper we use multiple DDNs and DCNs, which may not be trees. Even the numbers of DDNs and DCNs are adjustable parameters, which can be used to optimize the communication latency. In addition, a DDN DCN may not be a ....

Y.-C. Tseng, T.-Y. Juang, and M.-H. Yang. A Euler-pathbased multicasting model for wormhole-routed networks: Its applications to damaged 2D tori and meshes. Technical report, Dept. of Comp. Sci. and Info. Eng., Nat'l Central Univ., 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC