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

香港中文大學研究人員

全文

引用次數

其它資訊
摘要The 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.
著者Tan XS, Li SYR, Shen YX
會議名稱6th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005)
會議開始日05.12.2005
會議完結日08.12.2005
會議地點Dalian
會議國家/地區中國
出版年份2005
月份1
日期1
出版社IEEE COMPUTER SOC
頁次11 - 15
國際標準書號0-7695-2405-2
語言英式英語
Web of Science 學科類別Computer Science; Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Computer Science, Theory & Methods; Imaging Science & Photographic Technology

上次更新時間 2021-11-05 於 01:10