Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge (Q1123621)
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: Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge |
scientific article; zbMATH DE number 4110119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge |
scientific article; zbMATH DE number 4110119 |
Statements
Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge (English)
0 references
1989
0 references
parallel algorithm
0 references
sorting
0 references
hypercube multicomputer
0 references
