| dc.contributor.author | Peyravi, Mohammad Hassan, | en_US |
| dc.date.accessioned | 2013-08-16T12:29:22Z | |
| dc.date.available | 2013-08-16T12:29:22Z | |
| dc.date.issued | 1985 | en_US |
| dc.identifier.uri | https://hdl.handle.net/11244/5346 | |
| dc.description.abstract | A multi-stage N x N interconnection network is said to be universal if it realizes the set of all permutations on N objects. A new bound on the number of stages required for the universality of shuffle-exchange network as well as the analysis of the combinational power for the block-structured networks are given. Finally, the complexity of the verification of a new sufficient condition for rearrangeability due to Benes B5 is analyzed. | en_US |
| dc.format.extent | xii, 144 leaves : | en_US |
| dc.subject | Computer Science. | en_US |
| dc.subject | Parallel processing (Electronic computers) | en_US |
| dc.title | Study of interconnection networks / | en_US |
| dc.type | Thesis | en_US |
| dc.thesis.degree | Ph.D. | en_US |
| dc.thesis.degreeDiscipline | School of Electrical and Computer Engineering | en_US |
| dc.note | Source: Dissertation Abstracts International, Volume: 46-08, Section: B, page: 2727. | en_US |
| ou.identifier | (UMI)AAI8523095 | en_US |
| ou.group | College of Engineering::School of Electrical and Computer Engineering | |
