| タイトル | Shuffle-exchanges on augmented meshes |
| 本文（外部サイト） | http://hdl.handle.net/2060/19850003279 |
| 著者（英） | Bokhari, S. H. |
| 著者所属（英） | NASA Langley Research Center |
| 発行日 | 1984-10-01 |
| 言語 | eng |
| 内容記述 | A mesh connected array of size N = two to the Kth power, K an integer, can be augmented by adding at most one edge per node such that it can perform a shuffle-exchange of size N/2 in constant time. A shuffle-exchange of size N is performed on this augmented array in constant time. This is done by combining the available perfect shuffle of size N/2 with the existing nearest neighbor connections of the mesh. By carefully scheduling the different permutations that are composed in order to achieve the shuffle, the time required is reduced to 5 steps, which is optimal for this network. |
| NASA分類 | COMPUTER SYSTEMS |
| レポートNO | 85N11587
ICASE-84-54
NASA-CR-172476
NAS 1.26:172476 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/157933 |
