| タイトル | NASF transposition network: A computing network for unscrambling p-ordered vectors |
| 本文（外部サイト） | http://hdl.handle.net/2060/19790013651 |
| 著者（英） | Lim, R. S. |
| 著者所属（英） | NASA Ames Research Center |
| 発行日 | 1979-04-01 |
| 言語 | eng |
| 内容記述 | The viewpoints of design, programming, and application of the transportation network (TN) is presented. The TN is a programmable combinational logic network that connects 521 memory modules to 512 processors. The unscrambling of p-ordered vectors to 1-ordered vectors in one cycle is described. The TN design is based upon the concept of cyclic groups from abstract algebra and primitive roots and indices from number theory. The programming of the TN is very simple, requiring only 20 bits: 10 bits for offset control and 10 bits for barrel switch shift control. This simple control is executed by the control unit (CU), not the processors. Any memory access by a processor must be coordinated with the CU and wait for all other processors to come to a synchronization point. These wait and synchronization events can be a degradation in performance to a computation. The TN application is for multidimensional data manipulation, matrix processing, and data sorting, and can also perform a perfect shuffle. Unlike other more complicated and powerful permutation networks, the TN cannot, if possible at all, unscramble non-p-ordered vectors in one cycle. |
| NASA分類 | COMPUTER SYSTEMS |
| レポートNO | 79N21822
A-7645
NASA-TP-1426 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/175833 |
|
