Reducing complexity in tree-like computer interconnection networks (Q991077)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reducing complexity in tree-like computer interconnection networks |
scientific article; zbMATH DE number 5777715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing complexity in tree-like computer interconnection networks |
scientific article; zbMATH DE number 5777715 |
Statements
Reducing complexity in tree-like computer interconnection networks (English)
0 references
2 September 2010
0 references
\(k\)-ary \(n\)-tree topology
0 references
traffic characterization
0 references
simulation
0 references
performance evaluation
0 references
0.7376797199249268
0 references
0.7325674891471863
0 references
0.7209934592247009
0 references
