Parallel merging sorting using comparison matrices. I

DOI10.1007/BF02367744MaRDI QIDQ1905191zbMATH OpenOpenAlexFDO

Authors Ya. E. Romm

Publication date 11 April 1996

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

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

zbMATH Keywords

comparison matricessorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• Parallel merge sort using comparison matrices. II
• A benchmark parallel sort for shared memory multiprocessors
• A parallel sorting-merging algorithm for tightly coupled multiprocessors
• Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
• scientific article; zbMATH DE number 4070343

Cites work

• Deterministic organization of index-based numerical parallel processing
• scientific article; zbMATH DE number 3153481 (Why is no real title available?)
• scientific article; zbMATH DE number 3527787 (Why is no real title available?)
• scientific article; zbMATH DE number 3802822 (Why is no real title available?)
• Optimal Sorting Algorithms for Parallel Computers

Cited in

(4)

• Parallel merge sort using comparison matrices. II
• Sorting-based localization and stable computation of zeros of a polynomial. I.
• Identification of the domain, ranges, and values of complex roots of a polynomial with complex coefficients based on stable address sorting
• Numerical sorting-based optimization as applied to general differential and nonlinear equations

This page was built for publication: Parallel merging sorting using comparison matrices. I

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