A Creativity Survey of Parallel Sorting Algorithm

02/17/2022
by   Tianyi Yu, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2018

An O(N) Sorting Algorithm: Machine Learning Sorting

We propose an O(N) sorting algorithm based on Machine Learning method, w...
research
02/01/2019

An efficient sorting algorithm - Ultimate Heapsort(UHS)

Motivated by the development of computer theory, the sorting algorithm i...
research
08/29/2018

A study of integer sorting on multicores

Integer sorting on multicores and GPUs can be realized by a variety of a...
research
11/23/2020

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

The proliferation of number of processing elements (PEs) in parallel com...
research
07/20/2019

NNS: The Case For Neural Network-based Sorting

CPU-SIMD/GPU/TPUs will be increasingly powerful. The algorithm using neu...
research
12/17/2020

Sorting in Memristive Memory

Sorting is needed in many application domains. The data is read from mem...
research
09/03/2021

Comparative Analysis for Quick Sort Algorithm under four Different Modes of Execution

This work presents a comparison for the performance of sequential sortin...

Please sign up or login with your details

Forgot password? Click here to reset