# THSORT: A Single-Processor Parallel Sorting Algorithm

@article{Yao2003THSORTAS, title={THSORT: A Single-Processor Parallel Sorting Algorithm}, author={Shi Yao}, journal={Journal of Software}, year={2003} }

Sorting is an important operation of transaction processing. It is a relatively mature field, as many algorithms for memory sorting, disk sorting and parallel sorting have come forth in the past decades. In this paper, the sorting algorithm is studied from a thoroughly different standpoint, and the THSORT (Tsinghua SORT), a parallel sorting algorithm on a single computer, is brought forward. THSORT uses several processes to control different components of a computer, which enables the data…

No Paper Link Available

## Topics from this paper

## 4 Citations

External Memory Sort On CGM 1 Clusters

- 2003

External memory sort has been widely accepted as an overall benchmark to evaluate the processing performance of computers. Lots of algorithms have been developed to sort large scalable data in…

An Improved Algorithm of Binary Balanced Tree with Super Large-scale Data Set

- Computer Science
- 2018

This paper analyses an improved algorithm of realizing super large-scale balanced tree efficiently in the concurrent environment and shows no detailed leap variation in time along with the increasing knots.

Adaptive Processing Scheme of Overflowed Buckets for Bucket Sort Algorithm

- Computer ScienceIFSA
- 2007

A more effective bucket sort algorithm, THShort2, which subtly handles the overflowed buckets, and is proofed theoretically and shown to be about triple times of NTSort, and 50% faster than THSort.

Uniformization of Discrete Data

- Computer ScienceISAAC
- 2005

It is demonstrated that the sparsity decides the uniformity of the transformed data, and that could be a good reason to explain both the success of the bucket sort in PennySort 2003 and the failure for the same algorithm with the data modified.

## References

SHOWING 1-8 OF 8 REFERENCES

Sorting in parallel database systems

- Computer ScienceProceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region
- 2000

The authors present a taxonomy for parallel sorting in parallel database systems, which covers five sorting methods: namely parallel merge-all sort, parallel binary-mergesort, parallel redistribution binary-Merge sort, Parallel redistribution merge- all sort, and parallel partitioned sort.

Parallel Sorting by Regular Sampling

- Computer ScienceJ. Parallel Distributed Comput.
- 1992

The algorithm reduces memory and bus contention, which many parallel sorting algorithms suffer from, by using a regular sampling of the data to ensure good pivot selection and is shown to be asymptotically optimal.

High-performance sorting on networks of workstations

- Computer ScienceSIGMOD '97
- 1997

We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sorting on the large-scale…

The External Heapsort

- Computer ScienceIEEE Trans. Software Eng.
- 1989

The authors define the Hillsort model of computation for external random-access sorting, develop the complete algorithm and prove it correct, which is shown that the refined version of the algorithm is on a par with the external merge sort.

Performance / Price Sort and PennySort

- Computer Science
- 1998

This paper documents this and proposes that the PennySort benchmark be revised to Performance/Price sort: a simple GB/$ sort metric based on a two-pass external sort.

Proportion Extend Sort

- Mathematics, Computer ScienceSIAM J. Comput.
- 2001

Empirical results show that the average number of comparisons is close to n log n-O(n) for some p, and this algorithm is yet faster, on average, than PROPORTION SPLIT SORT which is faster than CLEVER QUICKSORT.

The Art of Computer Programming, Volume III: Sorting and Searching

- Computer Science, Mathematics
- 1973