An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links (Q1206196)
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 148537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links |
scientific article; zbMATH DE number 148537 |
Statements
An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links (English)
0 references
1 April 1993
0 references
routing messages
0 references
multiprocessor system
0 references
\(n\)-dimensional hypercube
0 references
0.796000599861145
0 references
0.795933187007904
0 references
0.7919930219650269
0 references
0.780646562576294
0 references
0.778473436832428
0 references
