{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T08:51:29Z","timestamp":1775292689830,"version":"3.50.1"},"reference-count":51,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T00:00:00Z","timestamp":1543708800000},"content-version":"vor","delay-in-days":335,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100007835","name":"Silesian University of Technology","doi-asserted-by":"crossref","award":["09\/010\/RGH18\/0035"],"award-info":[{"award-number":["09\/010\/RGH18\/0035"]}],"id":[{"id":"10.13039\/501100007835","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>The development in multicore architectures gives a new line of processors that can flexibly distribute tasks between their logical cores. These need flexible models of efficient algorithms, both fast and stable. A new line of efficient sorting algorithms can support these systems to efficiently use all available resources. Processes and calculations shall be flexibly distributed between cores to make the performance as high as possible. In this article we present a fully flexible sorting method designed for parallel processing. The idea we describe in this article is based on modified merge sort, which in parallel form is designed for multicore architectures. The novelty of this idea is in particular way of processing. We have developed a fully flexible method that can be implemented for a number of processors. The tasks are flexibly distributed between logical cores to increase the efficiency of sorting. The method preserves separation of concerns; therefore, each of the processors works separately without any cross actions and interruptions. The proposed method was described in theoretical way, examined in tests, and compared to other methods. The results confirm high efficiency and show that with each newly added processor sorting becomes faster and more efficient.<\/jats:p>","DOI":"10.1155\/2018\/8679579","type":"journal-article","created":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T18:35:33Z","timestamp":1543775733000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Fully Flexible Parallel Merge Sort for Multicore Architectures"],"prefix":"10.1155","volume":"2018","author":[{"given":"Zbigniew","family":"Marsza\u0142ek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9073-5347","authenticated-orcid":false,"given":"Marcin","family":"Wo\u017aniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawid","family":"Po\u0142ap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,12,2]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.07.021"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2017.05.009"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.3390\/s17102302"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cogsys.2016.12.001"},{"key":"e_1_2_9_5_2","doi-asserted-by":"crossref","unstructured":"StanescuL. BrezovanM. andBurdescuD. D. Automatic mapping of MySQL databases to NoSQL MongoDB Proceedings of the 2016 Federated Conference on Computer Science and Information Systems FedCSIS 2016 September 2016 Poland 837\u2013840 2-s2.0-85007203287.","DOI":"10.15439\/2016F45"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.02.029"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.08.061"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.07.004"},{"key":"e_1_2_9_9_2","volume-title":"The design and analysis of computer algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_9_10_2","volume-title":"The art of computer programming. Vol. 3","author":"Knuth D. E.","year":"1998"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01939369"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(92)90089-P"},{"key":"e_1_2_9_13_2","doi-asserted-by":"crossref","unstructured":"RauhA.andArceG. R. A fast weighted median algorithm based on Quickselect Proceedings of the 2010 17th IEEE International Conference on Image Processing ICIP 2010 September 2010 Hong Kong 105\u2013108 2-s2.0-78651063730.","DOI":"10.1109\/ICIP.2010.5651855"},{"key":"e_1_2_9_14_2","doi-asserted-by":"crossref","unstructured":"TsigasP.andZhangY. A simple fast parallel implementation of Quicksort and its performance evaluation on SUN Enterprise 10000 Proceedings of the 11th Euromicro Conference on Parallel Distributed and Network-Based Processing Euro-PDP 2003 February 2003 Italy 372\u2013381 2-s2.0-84947906488.","DOI":"10.1109\/EMPDP.2003.1183613"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22603-8_58"},{"key":"e_1_2_9_16_2","unstructured":"EdmondsonJ. M pivot sort\u2013replacing quick sort presenter Proceedings of the James edmondson conference: Amcs05\u20132005 world congress in applied computing 2005."},{"key":"e_1_2_9_17_2","doi-asserted-by":"crossref","unstructured":"KushagraS. L\u00f3pez-OrtizA. MunroJ. I. andQiaoA. Multi-pivot quicksort: Theory and experiments in Proceedings of the Meeting on Algorithm Engineering & Expermiments 2014 47\u201360.","DOI":"10.1137\/1.9781611973198.6"},{"key":"e_1_2_9_18_2","doi-asserted-by":"crossref","unstructured":"Ben-OrM. lower bounds for algebraic computation trees Proceedings of the 15th Annual ACM Symposium on Theory of Computing 80\u201386 2-s2.0-0020879158.","DOI":"10.1145\/800061.808735"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01941462"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.29490"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11933-5_78"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1160"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90017-5"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190160"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(02)00065-8"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380111211"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00572988"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/42392.42403"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/69.494169"},{"key":"e_1_2_9_31_2","first-page":"25","volume-title":"VLDB, Citeseer","author":"Zhang W.","year":"1997"},{"key":"e_1_2_9_32_2","first-page":"523","volume-title":"The VLDB Journal","author":"Zhang W.","year":"1998"},{"key":"e_1_2_9_33_2","doi-asserted-by":"crossref","unstructured":"VigneshR.andPradhanT. Merge sort enhanced in place sorting algorithm Proceedings of the 2016 International Conference on Advanced Communication Control and Computing Technologies ICACCCT 2016 May 2016 India 698\u2013704 2-s2.0-85014223820.","DOI":"10.1109\/ICACCCT.2016.7831730"},{"key":"e_1_2_9_34_2","doi-asserted-by":"crossref","unstructured":"CheemaS. M. SarwarN. andYousafF. Contrastive analysis of bubble & merge sort proposing hybrid approach Proceedings of the 6th International Conference on Innovative Computing Technology INTECH 2016 August 2016 Ireland 371\u2013375 2-s2.0-85015307761.","DOI":"10.1109\/INTECH.2016.7845075"},{"key":"e_1_2_9_35_2","doi-asserted-by":"crossref","unstructured":"PairaS. ChandraS. andAlamS. K. S. Enhanced Merge Sort- A New Approach to the Merging Process Proceedings of the 6th International Conference On Advances In Computing and Communications ICACC 2016 September 2016 India 982\u2013987 2-s2.0-84985991513.","DOI":"10.1016\/j.procs.2016.07.292"},{"key":"e_1_2_9_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010255"},{"key":"e_1_2_9_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276346"},{"key":"e_1_2_9_38_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0985"},{"key":"e_1_2_9_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44867-5_7"},{"key":"e_1_2_9_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/146370.146381"},{"key":"e_1_2_9_41_2","doi-asserted-by":"crossref","unstructured":"AxtmannM. BingmannT. SandersP. andSchulzC. Practical massively parallel sorting Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures SPAA 2015 June 2015 USA 13\u201323 2-s2.0-84950284876.","DOI":"10.1145\/2755573.2755595"},{"key":"e_1_2_9_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2661746"},{"key":"e_1_2_9_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.01.034"},{"key":"e_1_2_9_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19090-7_9"},{"key":"e_1_2_9_45_2","first-page":"657","article-title":"Triple heap sort algorithm for large data sets","author":"Wo\u017aniak M.","year":"2013","journal-title":"Looking into the Future of Creativity and Decision Support Systems"},{"key":"e_1_2_9_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38610-7_56"},{"key":"e_1_2_9_47_2","doi-asserted-by":"crossref","unstructured":"Marsza\u0142ekZ. Wo\u017aniakM. BorowikG. WaziraliR. NapoliC. PappalardoG. andTramontanaE. Benchmark Tests on Improved Merge for Big Data Processing Proceedings of the Asia-Pacific Conference on Computer-Aided System Engineering APCASE 2015 July 2015 Ecuador 96\u2013101 2-s2.0-84959317853.","DOI":"10.1109\/APCASE.2015.24"},{"key":"e_1_2_9_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19419-6_39"},{"key":"e_1_2_9_49_2","doi-asserted-by":"crossref","unstructured":"UyarA. Parallel merge sort with double merging Proceedings of the 8th IEEE International Conference on Application of Information and Communication Technologies AICT 2014 October 2014 Kazakhstan 2-s2.0-84988240382.","DOI":"10.1109\/ICAICT.2014.7036012"},{"key":"e_1_2_9_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46254-7_27"},{"key":"e_1_2_9_51_2","doi-asserted-by":"publisher","DOI":"10.3390\/sym9090176"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/8679579.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/8679579.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/8679579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:58:41Z","timestamp":1775289521000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/8679579"}},"subtitle":[],"editor":[{"given":"Julian","family":"Szymanski","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/8679579"],"URL":"https:\/\/doi.org\/10.1155\/2018\/8679579","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-06-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8679579"}}