Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers (Q1187201)
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: Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers |
scientific article; zbMATH DE number 38892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers |
scientific article; zbMATH DE number 38892 |
Statements
Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers (English)
0 references
28 June 1992
0 references
parallel algorithms
0 references
SIMD computers
0 references
hypercubes
0 references
routing
0 references
multiple-prefix problem
0 references
data-dependent parallel-prefix problem
0 references
image-component-labeling problem
0 references
closest-pair problem
0 references
parallel computer
0 references
divide-and-conquer algorithm
0 references
0 references
0.7876294255256653
0 references
0.7484246492385864
0 references
