Rearrangeability of the tandem cascade of banyan-type networks
Refereed conference paper presented and published in conference proceedings


Full Text

Times Cited
Web of Science1WOS source URL (as at 01/08/2020) Click here for the latest count

Other information
AbstractThe cascade of two 2(n) x 2(n) baseline networks in tandem and the cascade of two omega networks through a special interconnection pattern are known to be rearrangeable These belong to the general problem: for what two banyan-type networks (i.e., bitpermuting unique-routing network) are their tandem cascade a rearrangeable network? We relate the problem to the trace and guide of banyan-type networks. When the guide of one 2(n) x 2(n) banyan-type network and the trace of the other are represented by the permutations gamma and tau on integers 1 to n, respectively, rearrangeability of their tandem cascade is solely determined by which is said to be a tandem rearrangeable permutation when the tandem cascade is indeed rearrangeable. We identify a few tandem rearrangeable permutations, each implying the rearrangeabilily of the tandem cascade of a wide class of banyan-type networks.
All Author(s) ListTan XS, Li SYR, Shen YX
Name of Conference6th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005)
Start Date of Conference05/12/2005
End Date of Conference08/12/2005
Place of ConferenceDalian
Country/Region of ConferenceChina
Year2005
Month1
Day1
PublisherIEEE COMPUTER SOC
Pages11 - 15
ISBN0-7695-2405-2
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science; Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Computer Science, Theory & Methods; Imaging Science & Photographic Technology

Last updated on 2020-02-08 at 03:14