An O(N) Sorting Algorithm: Machine Learning Sorting

05/11/2018
by   Hanqing Zhao, et al.
0

We propose an O(N) sorting algorithm based on Machine Learning method, which shows a huge potential for sorting big data. This sorting algorithm can be applied to parallel sorting and is suitable for GPU or TPU acceleration. Furthermore, we apply this algorithm to sparse hash table.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/02/2018

Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools

This dissertation focuses on two fundamental sorting problems: string so...
research
12/29/2017

Sorting Real Numbers in O(n√( n)) Time and Linear Space

We present an O(n√( n)) time and linear space algorithm for sorting real...
research
07/15/2020

Permutree sorting

Generalizing stack sorting and c-sorting for permutations, we define the...
research
02/17/2022

A Creativity Survey of Parallel Sorting Algorithm

Sorting is one of the most fundamental problems in the field of computer...
research
08/14/2022

Towards Parallel Learned Sorting

We introduce a new sorting algorithm that is the combination of ML-enhan...
research
06/03/2022

Onesweep: A Faster Least Significant Digit Radix Sort for GPUs

We present Onesweep, a least-significant digit (LSD) radix sorting algor...
research
02/22/2021

Lightweight Combinational Machine Learning Algorithm for Sorting Canine Torso Radiographs

The veterinary field lacks automation in contrast to the tremendous tech...

Please sign up or login with your details

Forgot password? Click here to reset