The parallel neighbour sort and 2-way merge algorithm (Q1068553)
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: The parallel neighbour sort and 2-way merge algorithm |
scientific article; zbMATH DE number 3932404
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parallel neighbour sort and 2-way merge algorithm |
scientific article; zbMATH DE number 3932404 |
Statements
The parallel neighbour sort and 2-way merge algorithm (English)
0 references
1986
0 references
This paper briefly describes the implementation of the neighbour sort and 2-way merge algorithms on a parallel MIMD computer and analyses their computational complexity.
0 references
sorting
0 references
merging
0 references
parallel algorithms
0 references
parallel MIMD computer
0 references
0.9013479
0 references
0.88662755
0 references
0 references
0.8831518
0 references
0.8752384
0 references
0.87434924
0 references
