Parallel distributive partitioned sorting methods

DOI10.1080/00207168408803412MaRDI QIDQ3318123zbMATH OpenOpenAlexFDO

Authors Nadia Y. Yousif, D. J. Evans

Publication date 1984

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168408803412

zbMATH Keywords

distributive partitioned sortingMIMD systemsparallel algorithmsparallel computerparallel Quicksort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Parallelism in tape-sorting
• An efficient parallel sorting algorithm for shared memory multiprocessors
• Parallel sorting by regular sampling
• Parallel sorting revisited
• Partitioned parallel radix sort

Cites work

• Expected time bounds for selection
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Sorting by distributive partitioning
• The analysis of Quicksort programs
• The design and analysis of a new hybrid sorting algorithm
• Usort: An efficient hybrid of distributive partitioning sorting

Cited in

(9)

• Analyzing a class of distributive partitioning sort algorithms
• Parallel methods for solving fundamental file rearrangement problems
• Parallel algorithms for partitioning sorted sets and related problems
• Parallel database sorting
• scientific article; zbMATH DE number 5997265 (Why is no real title available?)
• Parallel partitioning for distributed systems using sequential assignment
• scientific article; zbMATH DE number 4043263 (Why is no real title available?)
• Optimal Parallel Sorting Scheme by Order Statistics
• Partitioned parallel radix sort

This page was built for publication: Parallel distributive partitioned sorting methods

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