DocumentCode :
264054
Title :
Parallel merge sort with double merging
Author :
Uyar, Ahmet
Author_Institution :
Dept. of Comput. Eng., Meliksah Univ., Kayseri, Turkey
fYear :
2014
fDate :
15-17 Oct. 2014
Firstpage :
1
Lastpage :
5
Abstract :
Sorting is one of the fundamental problems in computer science. With the proliferation of multi core processors, parallel algorithms for sorting have become very important. In this study, we propose a new parallel merge sort algorithm in which two threads perform the merge operation simultaneously. We have implemented the new merge sort algorithm in Java. We compared the results of the new algorithm with the parallel merge sort implemented in Java library. The results showed that the new algorithm provides between %20-%30 percent speed increase in a quad core system when sorting 10M to 50M double numbers.
Keywords :
Java; multiprocessing systems; parallel algorithms; sorting; Java; double merging; merge operation; multicore processor; parallel merge sort algorithm; quad core system; Arrays; Instruction sets; Java; Libraries; Merging; Sorting; Synchronization; parallel algorithms; parallel merge sort; sorting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Application of Information and Communication Technologies (AICT), 2014 IEEE 8th International Conference on
Conference_Location :
Astana
Print_ISBN :
978-1-4799-4120-9
Type :
conf
DOI :
10.1109/ICAICT.2014.7036012
Filename :
7036012
Link To Document :
بازگشت