Parallel merge sort using comparison matrices. II

DOI10.1007/BF02366405zbMATH Open0849.68022OpenAlexW1971963428MaRDI QIDQ1918756FDOQ1918756

Authors: Ya. E. Romm 

Publication date: 25 August 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02366405

Recommendations

• Parallel merging sorting using comparison matrices. I
• Parallel Merge Sort
• Space-efficient parallel merging
• A benchmark parallel sort for shared memory multiprocessors
• A parallel sorting-merging algorithm for tightly coupled multiprocessors

zbMATH Keywords

multiway mergingmerge techniques

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Parallel merging sorting using comparison matrices. I
• Title not available (Why is that?)

Cited In (5)

• A Pictorial Description of Cole’s Parallel Merge Sort
• Numerical sorting-based optimization as applied to general differential and nonlinear equations
• Parallel merging sorting using comparison matrices. I
• The parallel neighbour sort and 2-way merge algorithm
• Sorting-based localization and stable computation of zeros of a polynomial. I.

This page was built for publication: Parallel merge sort using comparison matrices. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918756)