Energy performance of parallel sort algorithms

The issue of productivity and energy is an important objective of the optimization of parallel applications. Thesize of the problem for a large number of data on multiprocessor platforms forces the use of parallel algorithms.Efficient management of large memories using modern processors in Big data processing requires innovativetechniques and efficient algorithms. For years have found the results of tests conducted on methods for usein various computing environments and improvements. This article shows the energy consumption analysisby parallel sorting algorithms. Sort algorithms are used in information systems and databases, to select andorganize the information. The subject of this article is research into energy consumption and computationalcomplexity for parallel sorting methods by merging compared to classic methods. The tests carried out confirmthe reduction of energy consumption by using parallel sorting algorithms. The presented parallel fast sort andparallel modified merge sort for large task dimensions have less power consumption than classic methods andcan be used successfully in NoSQL databases.