Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204)
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: Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy |
scientific article; zbMATH DE number 3883600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy |
scientific article; zbMATH DE number 3883600 |
Statements
Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (English)
0 references
1984
0 references
We discuss how to design parallel algorithms based upon the divide-and- conquer strategy. We show that if we do not split the data too thoroughly, we may obtain a more cost-effective parallel algorithm. A theoretical result about how much we should split the data is also presented.
0 references
design of parallel algorithms
0 references
0.90526134
0 references
0.9022838
0 references
0.9008603
0 references
0.8876314
0 references
0.8871136
0 references
0.8846127
0 references
0.8842509
0 references
