Optimizing sorting algorithms by using sorting networks

DOI10.1007/S00165-016-0401-3MaRDI QIDQ2628305zbMATH OpenOpenAlexFDO

Authors 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

sorting networkssorting algorithmsinstruction-level parallelismout-of-order execution

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Sorting with networks of data structures
• Optimal sorting networks
• Applying sorting networks to synthesize optimized sorting libraries
• Slowing down sorting networks to obtain faster sorting algorithms
• On optimal parallelization of sorting networks
• scientific article; zbMATH DE number 4031004
• Improved sorting networks with O(log N) depth
• Optimal-depth sorting networks
• New Bounds on Optimal Sorting Networks

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1330906 (Why is no real title available?)
• scientific article; zbMATH DE number 2155520 (Why is no real title available?)
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• A Simple Sorting Algorithm
• A Sorting Problem
• A computer-assisted optimal depth lower bound for nine-input sorting networks
• Applying sorting networks to synthesize optimized sorting libraries
• New Bounds on Optimal Sorting Networks
• Optimal sorting networks
• Quicksort
• Sorting networks: the end game
• Sorting nine inputs requires twenty-five comparisons
• The analysis of Quicksort programs

Cited in

(8)

• Using symmetry and evolutionary search to minimize sorting networks
• Improved layout of the odd-even sorting network
• Sorting-based selection algorithms for hypercubic networks
• Increasing the Efficiency of Existing Sorting Algorithms by Using Randomized Wrappers
• Improved sorting networks with O(log N) depth
• Accelerating certain outputs of merging and sorting networks
• An 11-step sorting network for 18 elements
• Applying sorting networks to synthesize optimized sorting libraries

Describes a project that uses

Uses Software

• Quicksort
• GPU-ABiSort
• Networksort

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628305)