DeepAI AI Chat
Log In Sign Up

Towards Parallel Learned Sorting

by   Ivan Carvalho, et al.

We introduce a new sorting algorithm that is the combination of ML-enhanced sorting with the In-place Super Scalar Sample Sort (IPS4o). The main contribution of our work is to achieve parallel ML-enhanced sorting, as previous algorithms were limited to sequential implementations. We introduce the In-Place Parallel Learned Sort (IPLS) algorithm and compare it extensively against other sorting approaches. IPLS combines the IPS4o framework with linear models trained using the Fastest Minimum Conflict Degree algorithm to partition data. The experimental results do not crown IPLS as the fastest algorithm. However, they do show that IPLS is competitive among its peers and that using the IPS4o framework is a promising approach towards parallel learned sorting.


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...

Engineering In-place (Shared-memory) Sorting Algorithms

We present sorting algorithms that represent the fastest known technique...

Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model

A new algorithm, Guidesort, for sorting in the uniprocessor variant of t...

A study of integer sorting on multicores

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

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

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

A Creativity Survey of Parallel Sorting Algorithm

Sorting is one of the most fundamental problems in the field of computer...

An efficient sorting algorithm - Ultimate Heapsort(UHS)

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