On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks (Q3583331)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5775377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks |
scientific article; zbMATH DE number 5775377 |
Statements
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks (English)
0 references
27 August 2010
0 references
network design and communication
0 references
communication networks
0 references
permutation networks
0 references
switching networks
0 references
parallel algorithms
0 references
0.9770922660827636
0 references
0.7686779499053955
0 references
0.7579691410064697
0 references
0.7413709759712219
0 references
