Parallel prefix computation on extended multi-mesh network. (Q1853159)
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 1856491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel prefix computation on extended multi-mesh network. |
scientific article; zbMATH DE number 1856491 |
Statements
Parallel prefix computation on extended multi-mesh network. (English)
0 references
21 January 2003
0 references
A parallel algorithm for prefix computation of \(N=n^{4}\) elements on an \(n\times n\) extended multi-mesh network is presented. The network is a modified version of an earlier multi-mesh network with a 4-regular structure. The algorithm takes \(O(N^{1/4})\) time on \(N\) processors (\(13N^{1/4}-5\) communication steps and \(\log N+4\) arithmetic/logic steps).
0 references
Prefix computation
0 references
Multi-mesh network
0 references
Parallel algorithm
0 references
Time complexity
0 references
Associative binary operation
0 references
0.9231268763542176
0 references
0.8082919716835022
0 references
0.765035092830658
0 references
