Showing papers by "Seung-Woo Seo published in 1994"
TL;DR: A routing algorithm for a class of multistage interconnection networks which can be applied adaptively according to the structure of the network, i.e., straight, skewed straight, simple butterfly or skewed butterfly as long as the networks are symmetric.
Abstract: This paper presents a routing algorithm for a class of multistage interconnection networks. Specifically, the concatenation of two Omega networks which has 2 log/sub 2/ N stages is treated. It is shown that this kind of asymmetric Omega+Omega network can be converted into a symmetric Omega/sup -1spl times/Omega network or a symmetric Omega/spl times/Omega/sup -1/ network. However, they have butterfly connections between the two center stages. A general algorithm is developed which routes a class of symmetric networks. The algorithm routes the network from center stages to outer stages at both the input and the output sides simultaneously. The algorithm presented is simpler and more flexible than the well-known looping algorithm in that it can be applied adaptively according to the structure of the network. It can be applied to routing the Omega-based networks regardless of the center-stage connection patterns, i.e., straight, skewed straight, simple butterfly or skewed butterfly as long as the networks are symmetric. The sufficient conditions for proper routing are shown and proved. In addition, an example is shown to demonstrate the algorithm. >
46 citations
TL;DR: The modification scheme has been simplified to maintain most of the novel characteristics of the composite Banyan network and it is shown that the modified network has more internal paths that help to improve the network's terminal reliability.
4 citations
04 Jul 1994
TL;DR: A new routing scheme for concatenating two omega networks is presented, which is simpler and more flexible than other algorithms known so far, in that it can be applied adaptively, according to the structure of the network.
Abstract: A new routing scheme for concatenating two omega networks is presented. Routing the 2log2N-stage concatenated network has been an open problem for decades, and no clear solution has yet been proposed. It was shown in [5] that this asymmetric network can be converted into a symmetric network with butterfly connections between the two center stages. The proposed algorithm routes the network from center stages to outer stages at both the input and the output sides, simultaneously. The algorithm presented is simpler and more flexible than other algorithms known so far, in that it can be applied adaptively, according to the structure of the network.
2 citations
15 Aug 1994
TL;DR: A generalized version of the routing algorithm for a class of 2log_2 N-stage networks which are made by concatenating two log-2 Nstage blocking networks is presented and it is shown that the time complexity is in O(N), which is superior to that of the looping algorithm.
Abstract: In this paper, we present a generalized version of the routing algorithm[1] for a class of 2log_2 N-stage networks which are made by concatenating two log_2 Nstage blocking networks. We show that the generalized algorithm can also cover a class of(2log_2 N - 1)-stage networks. It is shown that the inside-out algorithm is a more general algorithm which covers a large class of inherently symmetric rearrangeable networks, including the Benes and its equivalent networks. Moreover, it is shown that the time complexity of the algorithm is in O(N), which is superior to that of the looping algorithm. The algorithm is discussed using a graph representation of the network and its connectivity properties are shown by a graph describing rule. To show that the algorithm covers a class of 2log_2 N-stage networks, we introduce the concept of a base-network. These base-networks satisfy some common connectivity properties, and we show that any concatenation of two base-networks can be routed by our new algorithm.
1 citations