Embedding large complete binary trees in hypercubes with load balancing (Q1923393)
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: Embedding large complete binary trees in hypercubes with load balancing |
scientific article; zbMATH DE number 932242
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding large complete binary trees in hypercubes with load balancing |
scientific article; zbMATH DE number 932242 |
Statements
Embedding large complete binary trees in hypercubes with load balancing (English)
0 references
25 November 1996
0 references
fixed size hypercubes
0 references
massively parallel computing
0 references
0.8610213398933411
0 references
0.8392585515975952
0 references
0.8391558527946472
0 references
0.8304915428161621
0 references