Parallel sorting by regular sampling
From MaRDI portal
Recommendations
- On the versatility of parallel sorting by regular sampling
- scientific article; zbMATH DE number 4064478
- An efficient parallel sorting algorithm for shared memory multiprocessors
- A parallel sorting-merging algorithm for tightly coupled multiprocessors
- A benchmark parallel sort for shared memory multiprocessors
Cited in
(45)- On the scalability of PSRS algorithm
- A parallel computing framework for big data
- Partitioned parallel radix sort
- An efficient parallel sorting compatible with the standard qsort
- A framework for simple sorting algorithms on parallel disk systems
- Faster deterministic sorting through better sampling.
- Resource oblivious sorting on multicores
- On the versatility of parallel sorting by regular sampling
- Sorting algorithms on transputer arrays
- Parallel sorting for GPUs
- A randomized sorting algorithm on the BSP model
- Advanced Model of Parallel Sorting Algorithm with Ranking
- A bridging model for multi-core computing
- Optimal Parallel Sorting Scheme by Order Statistics
- scientific article; zbMATH DE number 4064478 (Why is no real title available?)
- An efficient general in-place parallel sorting scheme
- The multilevel principle applied to sorting
- A parallel sorting-merging algorithm for tightly coupled multiprocessors
- Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome
- scientific article; zbMATH DE number 3938577 (Why is no real title available?)
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Parallel string sample sort
- Robust massively parallel sorting
- scientific article; zbMATH DE number 1760033 (Why is no real title available?)
- A time-space optimal parallel sorting on a hypercube
- An efficient parallel sorting algorithm
- Parallel bimonotonic sorting
- Parallel distributive partitioned sorting methods
- Fast sort of floating-point data for data engineering
- Overlapping computations, communications and I/O in parallel sorting
- In-place parallel super scalar samplesort (\(\mathrm{IPS}^4\mathrm{o}\))
- Algorithms – ESA 2004
- Partial order aware concurrency sampling
- Sieve sorting algorithm
- Parallel merge sort with load balancing
- A wait-free sorting algorithm
- Scalable Parallel Suffix Array Construction
- scientific article; zbMATH DE number 1919436 (Why is no real title available?)
- A new parallel sorting algorithm based upon min-mid-max operations
- Irredundant intervals
- A benchmark parallel sort for shared memory multiprocessors
- The bulk-synchronous parallel random access machine
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
- Power balance and apportionment algorithms for the United States Congress
- Efficient algorithms for parallel sorting on mesh multicomputers
This page was built for publication: Parallel sorting by regular sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200122)
