Balanced computation of two-dimensional transforms on a tree machine (Q2277820)
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 4197385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Balanced computation of two-dimensional transforms on a tree machine |
scientific article; zbMATH DE number 4197385 |
Statements
Balanced computation of two-dimensional transforms on a tree machine (English)
0 references
1990
0 references
This paper describes the idea of a balanced parallel algorithm, and then applies it to the design and analysis of 2D transforms on a tree- structured parallel computer. A balanced algorithm is one that is written as a sequence of separate computation and communication stages, which is furthermore sized so that these stages require equal time.
0 references
balanced parallel algorithm
0 references
tree-structured parallel computer
0 references
0.7532762885093689
0 references
0.7529790997505188
0 references
0.7506489753723145
0 references
0.7438218593597412
0 references
