Merging with parallel processors

DOI10.1145/361020.361216zbMATH Open0311.68031OpenAlexW2019964994MaRDI QIDQ4069775FDOQ4069775

Authors: Fanica Gavril 

Publication date: 1975

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361020.361216

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited In (5)

• On the optimality of tape merge of two lists with similar size
• A new parallel sorting algorithm based upon min-mid-max operations
• A parallel search algorithm for directed acyclic graphs
• A parallel merging algorithm
• A parallel sorting scheme whose basic operation sortsN elements

This page was built for publication: Merging with parallel processors

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