Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention (Q912634)
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 parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention |
scientific article; zbMATH DE number 4145349
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention |
scientific article; zbMATH DE number 4145349 |
Statements
Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention (English)
0 references
1990
0 references
shared-memory multiprocessor
0 references
complexity analysis
0 references
multi-way parallel merging algorithm
0 references
multi-way parallel sorting algorithm
0 references
0.9158731
0 references
0.9095012
0 references
0.8968792
0 references
0.89617556
0 references
0.89338636
0 references
0.88364416
0 references
0.88319874
0 references
