Optimally routing LC permutations on k-extra-stage cube-type networks
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 97-103 |
| Journal / Publication | IEEE Transactions on Computers |
| Volume | 45 |
| Issue number | 1 |
| Publication status | Published - 1996 |
| Externally published | Yes |
Link(s)
Abstract
It is difficult to partition an arbitrary permutation into a minimum number of groups such that conflict-free paths for all source-destination pairs in each group can be established on an omega network. Based on linear algebra theory, this paper presents an optimal algorithm which solves this problem for the LC class of permutations on a large class of multi-stage networks. This algorithm extends the previous result which deals with the BPC class of permutations on the omega network. ©1996 IEEE.
Research Area(s)
- k-extra-stage cube-type networks, LC permutations, Multistage interconnection networks, Optimization problems, Permutation realization
Bibliographic Note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to lbscholars@cityu.edu.hk.
Citation Format(s)
Optimally routing LC permutations on k-extra-stage cube-type networks. / Hu, Qing; Shen, Xiaojun; Liang, Weifa.
In: IEEE Transactions on Computers, Vol. 45, No. 1, 1996, p. 97-103.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
