Sciweavers

1623 search results - page 3 / 325
» No Sorting
Sort
View
ICPP
1992
IEEE
15 years 4 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
ISHPC
2000
Springer
15 years 4 months ago
Partitioned Parallel Radix Sort
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
93
Voted
JDCTA
2010
92views more  JDCTA 2010»
14 years 7 months ago
Several Incomplete Sort Algorithms for Getting the Median Value
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
Fuguo Dong
109
Voted
IPPS
2005
IEEE
15 years 6 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
15 years 6 months ago
On Adaptive Integer Sorting
This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically equivalent to multisorting groups of at most q keys...
Anna Pagh, Rasmus Pagh, Mikkel Thorup