Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention

DOI10.1016/0167-8191(90)90098-TzbMath0698.68062OpenAlexW2061724553MaRDI QIDQ912634

Jau-Hsiung Huang, Leonard Kleinrock

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90098-t

zbMATH Keywords

complexity analysismulti-way parallel merging algorithmmulti-way parallel sorting algorithmshared-memory multiprocessor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of software (68N99)

This page was built for publication: Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention