An optimal parallel algorithm for solvingthe prefix-sums problem in the postal model (Q4250741)
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 1304056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal parallel algorithm for solvingthe prefix-sums problem in the postal model |
scientific article; zbMATH DE number 1304056 |
Statements
17 June 1999
0 references
distributed-memory parallel computers
0 references
high-speed communication networks
0 references
0.8366439342498779
0 references
0.827424168586731
0 references
0.8143970966339111
0 references
0.8117356896400452
0 references
0.7998868823051453
0 references
An optimal parallel algorithm for solvingthe prefix-sums problem in the postal model (English)
0 references
