The parallel odd-even merge algorithm (Q3802635): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: David J. Evans / rank | |||
| Property / author | |||
| Property / author: David J. Evans / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207168608803494 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005401000 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Sorting Algorithms for Parallel Computers / rank | |||
Normal rank | |||
Latest revision as of 19:11, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parallel odd-even merge algorithm |
scientific article |
Statements
The parallel odd-even merge algorithm (English)
0 references
1986
0 references
neighbour sort
0 references
sorted subsets
0 references
parallel paths
0 references
static/dynamic performance overheads
0 references
odd-even merge
0 references
MIMD
0 references
computational complexity
0 references
