Optimizing sorting algorithms by using sorting networks

DOI10.1007/s00165-016-0401-3zbMath1365.68191OpenAlexW2548557305MaRDI QIDQ2628305

Yanyan Li

Publication date: 1 June 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0401-3

zbMATH Keywords

instruction-level parallelismsorting networkssorting algorithmsout-of-order execution

Mathematics Subject Classification ID

Searching and sorting (68P10)

Uses Software

• Networksort
• GPU-ABiSort
• Quicksort

Cites Work

• Sorting nine inputs requires twenty-five comparisons
• The analysis of Quicksort programs
• Sorting Networks: The End Game
• New Bounds on Optimal Sorting Networks
• A computer-assisted optimal depth lower bound for nine-input sorting networks
• A Sorting Problem
• Optimal Sorting Networks
• A Simple Sorting Algorithm
• Applying Sorting Networks to Synthesize Optimized Sorting Libraries
• Quicksort
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimizing sorting algorithms by using sorting networks