An approach for exploring combinatorial properties of R-path omega Interconnection networks

au.identifier.bibno 0021-2037 [Full Text] ( Veselovsky, Gennady
dc.contributor.other Assumption University. Vincent Mary School of Science and Technology 2015-07-03T07:17:25Z 2015-07-03T07:17:25Z 2010
dc.description In English ; only abstract in English.
dc.description.abstract Multiple path multistage interconnection networks as compared to their parental one path cube-type networks provide better permutation capability and offer such important property as fault-tolerance. In this paper an approach for investigation permuting ability of R-path Omega networks is proposed. The analysis as concerned to arbitrary permutations is done with the help of number theory methods. As to BPC (bit-permute-complement) permutations admissibility check to the aforementioned type of networks, the modified window method is proposed. The aforementioned method reduces drastically the time complexity of admissibility check. The results of computational experiments with applying the technique to some permutations of BPC class are given.
dc.format.mimetype application/pdf
dc.identifier.citation AU Journal of Technology 13, 3 (January 2010), 143-150
dc.language.iso eng
dc.publisher Assumption University
dc.rights This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.
dc.subject AU Journal of Technology
dc.subject AU Journal of Technology -- 2010
dc.subject Interconnection networks
dc.subject R-path Omega network
dc.subject BPC permutations
dc.subject Window method
dc.subject.other Assumption University -- Periodicals
dc.subject.other Computer networks
dc.subject.other Omega network
dc.title An approach for exploring combinatorial properties of R-path omega Interconnection networks en_US
dc.type Text
mods.genre Journal Article
Excerpt bundle
Now showing 1 - 1 of 1
Thumbnail Image
397.6 KB
Adobe Portable Document Format