Bulk-sort: A novel adaptive and parallel sorting algorithm

Abstract

Over the last few years, we have seen a plethora of new solutions which are gaining popularity in the software industry. All these solutions, such as Internet of things (IOT), big data, image processing, require a fast and parallel data manipulation. Sorting is one of the basic computational operations that have an immense impact on performance of the system. The efficiency of an application depends on the usage of a good sorting algorithm. In this paper, we present a novel adaptive and parallel sorting algorithm called bulk-sort designed to be implemented on parallel hardware architecture. The proposed approach offers a useful tradeoff between rapidity and the memory resources. A simulation program has been developed in C++ in order to validate the bulk-sort algorithm and compute its performances.