Characterizing bit permutation networks
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
167 | en_US |
dc.citation.spage |
157 | en_US |
dc.citation.volume |
42 | en_US |
dc.contributor.author |
Chang, GJ | en_US |
dc.contributor.author |
Hwang, FK | en_US |
dc.contributor.author |
Tong, LD | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:27:13Z | |
dc.date.available |
2014-12-08T15:27:13Z | |
dc.date.issued |
1998 | en_US |
dc.description.abstract |
In recent years, many multistage interconnection networks using 2 x 2 switching elements have been proposed for parallel architectures. Typical examples are baseline networks, banyan networks, shuffle-exchange networks and their inverses. As these networks are blocking, such networks with extra stages have also been studied extensively. These include Benes networks and Delta + Delta' networks. Recently, Hwang, Liaw and Yeh studied k-extra-stage networks which is a generalization of the above networks. They also investigated the equivalence issue among some of these networks. In this paper, we study a more general class of networks, which we call (m + 1)-stage d-nary bit permutation networks. We characterize the equivalence of such networks by sequence of positive integers. | en_US |
dc.identifier.isbn |
0-8218-0831-1 | en_US |
dc.identifier.journal |
ADVANCES IN SWITCHING NETWORKS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/19439 | |
dc.identifier.wosnumber |
WOS:000078897300010 | |
dc.language.iso |
en_US | en_US |
dc.subject |
multistage interconnection network | en_US |
dc.subject |
switching network | en_US |
dc.subject |
permutation routing | en_US |
dc.subject |
sterling number | en_US |
dc.subject |
rearrangeable nonblocking | en_US |
dc.title |
Characterizing bit permutation networks | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文