An approach for exploring combinatorial properties of R-path omega Interconnection networks
Files (Excerpt)
Publisher
item.page.dcterms.publisher
Issued Date
2010
Copyright Date
Genre
Series
Edition
Language
eng
File Type
application/pdf
No. of Pages/File Size
ISBN
ISSN
eISSN
DOI
item.page.dc.identifier
Access Rights
Access Status
Call number
Other identifier(s)
Copyright date
Physical location
Citation
AU Journal of Technology 13, 3 (January 2010), 143-150
Title
An approach for exploring combinatorial properties of R-path omega Interconnection networks
Other title(s)
Author(s)
Editor(s)
Advisor(s)
item.page.ithesis.email.advisor
item.page.dc.contributor
Other Contributor(s)
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.
item.page.dcterms.description
Links
Sponsorship
Spatial coverage
item.page.dc.relation.ispartof
Degree Name
Degree Level
Degree Department
Degree Discipline
Degree Grantor(s)
item.page.dc.subject.classification
item.page.dc.subject.lcc
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.