Bulk-Sort: A Novel Adaptive and Parallel Sorting Algorithm

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.

[1]  Wang Xiang,et al.  Analysis of the Time Complexity of Quick Sort Algorithm , 2011, 2011 International Conference on Information Management, Innovation Management and Industrial Engineering.

[2]  Francisco J. Cazorla,et al.  CPU Accounting in CMP Processors , 2009, IEEE Computer Architecture Letters.

[3]  Fahad Saeed,et al.  MS-REDUCE: an ultrafast technique for reduction of big mass spectrometry data for high-throughput processing , 2016, Bioinform..

[4]  Li Miao,et al.  Quick Sorting Algorithm of Matrix , 2007, 2007 8th International Conference on Electronic Measurement and Instruments.

[5]  Rajkumar Buyya,et al.  iFogSim: A toolkit for modeling and simulation of resource management techniques in the Internet of Things, Edge and Fog computing environments , 2016, Softw. Pract. Exp..

[6]  Meikang Qiu,et al.  Health-CPS: Healthcare Cyber-Physical System Assisted by Cloud and Big Data , 2017, IEEE Systems Journal.

[7]  Alan Saalfeld.  Sorting Spatial Data for Sampling and Other Geographic Applications , 1998, GeoInformatica.

[8]  George A. Jenner,et al.  Inductively coupled plasma-mass spectrometric analysis of geological samples: A critical evaluation based on case studies , 1990 .

[9]  Albert Bifet,et al.  Mining Big Data in Real Time , 2013, Informatica.

[10]  Fahad Saeed,et al.  GPU-ArraySort: A Parallel, In-Place Algorithm for Sorting Large Number of Arrays , 2016, 2016 45th International Conference on Parallel Processing Workshops (ICPPW).

[11]  Ann Gordon-Ross,et al.  An Efficient O( $N$ ) Comparison-Free Sorting Algorithm , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.