Loading [a11y]/accessibility-menu.js
A High-Performance Bidirectional Architecture for the Quasi-Comparison-Free Sorting Algorithm | IEEE Journals & Magazine | IEEE Xplore

A High-Performance Bidirectional Architecture for the Quasi-Comparison-Free Sorting Algorithm


Abstract:

This paper proposes a high-performance bidirectional architecture for the quasi-comparison-free sorting algorithm. Our architecture improves the performance of the conven...Show More

Abstract:

This paper proposes a high-performance bidirectional architecture for the quasi-comparison-free sorting algorithm. Our architecture improves the performance of the conventional unidirectional architecture by reducing the total number of sorting cycles via bidirectional sorting along with two auxiliary methods. Bidirectional sorting allows the sorting tasks to be conducted concurrently in the high- and low-index parts of our architecture. The first auxiliary method is boundary finding, which shortens the range for index searching by finding the boundaries of the range. The second auxiliary method is queue storing, which stores each useful index in a queue in advance to reduce the number of miss cycles during index searching. The performance of our architecture highly depends on the distribution of input data. For each set of input data to be sorted, five Gaussian distributions of the input data and four standard derivations for each distribution were adopted in our experiments. The results show that at the expense of some additional area cost, the number of sorting cycles and the energy consumption are significantly reduced by our method.
Page(s): 1493 - 1506
Date of Publication: 14 January 2021

ISSN Information:

Funding Agency:


Contact IEEE to Subscribe

References

References is not available for this document.