A Creativity Survey of Parallel Sorting Algorithm
Tianyi Yu, Wei Li

TL;DR
This paper surveys the development and research status of parallel sorting algorithms on modern manycore hardware, highlighting classification, progress, and future research directions in the field.
Contribution
It provides a comprehensive classification and summary of existing parallel sorting algorithms and identifies gaps and innovative opportunities in the current research landscape.
Findings
Summarizes research progress in parallel sorting algorithms.
Classifies research problems, methods, and measurement techniques.
Identifies unexplored areas and potential innovations.
Abstract
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Algorithms and Data Compression
