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

Published date
2010
Resource type
Publisher
Assumption University
ISBN
ISSN
DOI
Call no.
Other identifier(s)
Edition
Copyrighted date
Language
eng
File type
application/pdf
Extent
Other title(s)
Advisor
Other Contributor(s)
Assumption University. Vincent Mary School of Science and Technology
Citation
AU Journal of Technology 13, 3 (January 2010), 143-150
Degree name
Degree level
Degree discipline
Degree department
Degree grantor
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.
Table of contents
Description
In English ; only abstract in English.
punsarn.dc.description.sponsorship
Spatial Coverage
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.
Access rights
Rights holder(s)
Location
View External Resources