{"title":"双归并并行归并排序","authors":"A. Uyar","doi":"10.1109/ICAICT.2014.7036012","DOIUrl":null,"url":null,"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.","PeriodicalId":103329,"journal":{"name":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Parallel merge sort with double merging\",\"authors\":\"A. Uyar\",\"doi\":\"10.1109/ICAICT.2014.7036012\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":103329,\"journal\":{\"name\":\"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAICT.2014.7036012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICT.2014.7036012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
