DeepAI AI Chat
Log In Sign Up

A Creativity Survey of Parallel Sorting Algorithm

by   Tianyi Yu, et al.

Sorting is one of the most fundamental problems in the field of computer science. With the rapid development of manycore processors, it shows great importance to design efficient parallel sort algorithm on manycore architecture. This paper studies the parallel memory sorting method on modern hardware, and summarizes its research status and progress. Classify the research problems, research methods and measurement methods of the target papers and references. In the end, we summarize all the researches and list the directions not researched and innovative places. Keywords: Sorting Algorithm, Parallel Algorithm, Parallel Optimization, CPU, GPU, Memory Hierarchy


page 1

page 2

page 3

page 4


An O(N) Sorting Algorithm: Machine Learning Sorting

We propose an O(N) sorting algorithm based on Machine Learning method, w...

Towards Parallel Learned Sorting

We introduce a new sorting algorithm that is the combination of ML-enhan...

A study of integer sorting on multicores

Integer sorting on multicores and GPUs can be realized by a variety of a...

Onesweep: A Faster Least Significant Digit Radix Sort for GPUs

We present Onesweep, a least-significant digit (LSD) radix sorting algor...

Searching and Sorting with O(n^2) processors in O(1) time

The proliferation of number of processing elements (PEs) in parallel com...

NNS: The Case For Neural Network-based Sorting

CPU-SIMD/GPU/TPUs will be increasingly powerful. The algorithm using neu...

An efficient sorting algorithm - Ultimate Heapsort(UHS)

Motivated by the development of computer theory, the sorting algorithm i...