Noisy sort, a memory-intensive sorting algorithm (Q1116704)
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: Noisy sort, a memory-intensive sorting algorithm |
scientific article; zbMATH DE number 4090818
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Noisy sort, a memory-intensive sorting algorithm |
scientific article; zbMATH DE number 4090818 |
Statements
Noisy sort, a memory-intensive sorting algorithm (English)
0 references
1989
0 references
A table-lookup technique for sorting is developed. It is a highly parallel method which develops an approximation to the sort through a single access to an associative memory. A postprocessing step is intended to complete the sort. The scheme is most effective for special for special data classes.
0 references
parallel algorithm
0 references
table-lookup
0 references
sorting
0 references
0.7265446782112122
0 references
0.7197370529174805
0 references
0.7096500992774963
0 references
0.7092261910438538
0 references