Skip to search formSkip to main contentSkip to account menu

Samplesort

Known as: Sample sort 
Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Bulk synchronous parallelConnection MachineDistributed computingFlashsort

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
D S ] 3 1 M ay 2 01 6 A How Good is Multi-Pivot Quicksort ?
Multi-Pivot Quicksort refers to variants of classical quicksort where in the partitioning step k pivots are used to split the… 
2017
2017
Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort
MPI uses the concept of communicators to connect groups of processes. It provides nonblocking collective operations on… 
2016
2016
A Load-Balanced Parallel and Distributed Sorting Algorithm Implemented with PGX.D
Sorting has been one of the most challenging studied problems in different scientific researches. Although many techniques and… 
2013
2013
Memory Handling with CUDA
2012
2012
Efficient Algorithms for Sorting on GPUs
Efficient Algorithms for Sorting on GPUs Seema Mahesh Munavalli Major Advisor: Dr. Sanguthevar Rajasekaran Sorting is an… 
2012
2012
Chapter 14 – Sample Sort
2012
2012
Parallel Shellsort Algorithm for Many-Core GPUs with CUDA
Sorting is a classic algorithmic problem and its importance has led to the design and implementation of various sorting… 
2002
2002
Parallel Quicksort Seems to Outperform Sample Sort on Cache-coherent Shared Memory Multiprocessors : An Evaluation on SUN ENTERPRISE 10000 ∗
We have implemented sample sort and a parallel version of Quicksort on a cache-coherent shared address space multiprocessor: the… 
1999
1999
Parallel Sorting on Cache-coherent DSM Multiprocessors
The performance of parallel sorting is not well understood on hardware cache-coherent shared address space (CC-SAS… 
1997
1997
Integer sorting algorithms for coarse-grained parallel machines
  • K. AlsabtiS. Ranka
  • Proceedings Fourth International Conference on…
  • 1997
  • Corpus ID: 1175844
Integer sorting is a subclass of the sorting problem where the elements have integer values and the largest element is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)