Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
2013
2013
In this chapter, we look at the various types of memory available on the GPU. You will learn about the optimal use of registers… Expand
Is this relevant?
2010
2010
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially… Expand
Is this relevant?
1999
1999
The performance of parallel sorting is not well understood on hardware cache-coherent shared address space (CC-SAS… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1999
1999
We present work-preserving emulations with small slowdown between LogP and two other parallel models: BSP and QSM. In conjunction… Expand
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 8
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Previous schemes for sorting on general-purpose parallel machines have had to choose between poor load balancing and irregular… Expand
Is this relevant?
1998
1998
We introduce a new deterministic parallel sorting algorithm for distributed memory machines based on the regular sampling… Expand
Is this relevant?
1996
1996
Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of… Expand
  • figure 1
Is this relevant?
1995
1995
Sorting on interconnection networks has been solved ‘optimally’. However, the ‘lower-order’ terms are so large that they dominate… Expand
Is this relevant?
Highly Cited
1970
Highly Cited
1970
The methods currently in use and previously proposed for the choice of a root in minimal storage tree sorting are in reality… Expand
  • figure 1
  • table I
Is this relevant?