Strict nonblockingness of reduced shuffle-exchange networks
| dc.citation.epage | 8 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 4 | en_US |
| dc.citation.volume | 45 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | Hwang, FK | en_US |
| dc.contributor.author | Zhang, BW | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:36:17Z | |
| dc.date.available | 2014-12-08T15:36:17Z | |
| dc.date.issued | 2005-01-01 | en_US |
| dc.description.abstract | The shuffle-exchange network is one of the most well-studied multistage interconnection networks. Whether a (2n - 1)-stage shuffle-exchange network is rearrangeable has been a challenging conjecture for some 30 years, and only recently a proof was claimed. In this article, we use the analysis method developed for EGSN networks to show that the shuffle-exchange network can be strictly nonblocking by deleting some inputs and outputs. (C) 2004 Wiley Periodicals, Inc. | en_US |
| dc.identifier.doi | 10.1002/net.20043 | en_US |
| dc.identifier.issn | 0028-3045 | en_US |
| dc.identifier.journal | NETWORKS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1002/net.20043 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/24613 | |
| dc.identifier.wosnumber | WOS:000226130000002 | |
| dc.language.iso | en_US | en_US |
| dc.subject | shuffle-exchange network | en_US |
| dc.subject | strictly nonblocking | en_US |
| dc.subject | EGSN network | en_US |
| dc.title | Strict nonblockingness of reduced shuffle-exchange networks | en_US |
| dc.type | Article | en_US |