A Scalable Sorting Network Based on Hybrid Algorithms for Accelerating Data Sorting

This paper presents a scalable hybrid sorting network that maintains or improves performance while reducing computational load and hardware requirements. The network is composed of the pre-comparison odd--even sorting network (P-OESN) and the bidirectional insertion sorting network (BISN).

A pre-comparison layer is introduced to the original OESN. This layer aims to place larger values in the first half of the input sequence and smaller values in the latter half. The number of iterations is reduced when the P-OESN transitions from fully parallel execution to iterative execution.