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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2018
02419702018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
2010
2010
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Traditionally, the field of scientific computing has been dominated by numerical methods. However, modern scientific codes often… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
BSP 181, LogP [2], and QSM [3] are general-purpose parallel models that seek to achieve the right balance of simplicity, accuracy… (More)
  • table 1
Is this relevant?
1998
1998
Previous schemes for sorting on general-purpose parallel machines have had to choose between poor load balancing and irregular… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table IX
Is this relevant?
1998
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
1997
1997
Sorting on interconnection networks has been solved ‘optimally’. However, the ‘lowerorder’ terms are so large that they dominate… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this paper, the LogP model is used to analyze four parallel sorting algorithms (bitonic, column, radix, and sample sort). LogP… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM-2: B atcher’s bitonic sort… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 6
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… (More)
  • figure 1
  • table I
Is this relevant?