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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bifet A (2013) Mining big data in real time. Informatica 37(1):15
Abdel-Hafeez S, Ann Gordon R (2017) Comparison-free sorting algorithm. IEEE Trans Very Large Scale Integr (VLSI) Syst 25(6)
Gupta H et al (2017) iFogSim: a toolkit for modeling and simulation of resource management techniques in the Internet of Things, Edge and Fog computing environments. Softw Pract Exp 47(9) (2017)
Zhang Y et al (2017) Health-CPS: healthcare cyber-physical system assisted by cloud and big data. IEEE Syst J 11(1):88–95
Luque C et al (2009) CPU accounting in CMP processors. IEEE Comput Archit Lett 8(1):17–20
Saalfeld A (1998) Sorting spatial data for sampling and other geographic applications. GeoInformatica 2(1):37–57
Longerich HP, Jenner GA, Fryer BJ (1990) A critical evaluation based on case studies. Chem Geol 83(1–2):105–118
Awan M, Saeed F (2016) MS-REDUCE: an ultrafast technique for reduction of big mass spectrometry data for high-throughput processing. Bioinformatics 32(10):1518–1526
Awan M, Saeed F (2016) GPU-ArraySort: a parallel, in-place algorithm for sorting large number of arrays. In: 45th International Conference on Parallel Processing Workshops (ICPPW). IEEE, pp 78–87
Yueying P, Shicai L, Miao L (2007) Quick sorting algorithm of matrix. In: 8th international conference on electronic measurement and instruments, 2007. ICEMI ’07, pp 2-601–2-605
Xiang W (2011) Analysis of the time complexity of quick sort algorithm. In: 2011 international conference on information management, innovation management and industrial engineering, vol 1, pp 408–410
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ihirri, S., Errami, A., Khaldoun, M. (2019). Bulk-Sort: A Novel Adaptive and Parallel Sorting Algorithm. In: Yang, XS., Sherratt, S., Dey, N., Joshi, A. (eds) Third International Congress on Information and Communication Technology. Advances in Intelligent Systems and Computing, vol 797. Springer, Singapore. https://doi.org/10.1007/978-981-13-1165-9_66
Download citation
DOI: https://doi.org/10.1007/978-981-13-1165-9_66
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1164-2
Online ISBN: 978-981-13-1165-9
eBook Packages: EngineeringEngineering (R0)