{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:55Z","timestamp":1740123595668,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T00:00:00Z","timestamp":1535587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0953447","1718033"],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s11227-018-2567-3","type":"journal-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T04:53:07Z","timestamp":1535604787000},"page":"6369-6400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A comparison-free sorting algorithm on CPUs and GPUs"],"prefix":"10.1007","volume":"74","author":[{"given":"Saleh","family":"Abdel-hafeez","sequence":"first","affiliation":[]},{"given":"Ann","family":"Gordon-Ross","sequence":"additional","affiliation":[]},{"given":"Samer","family":"Abubaker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"key":"2567_CR1","doi-asserted-by":"crossref","unstructured":"Busse LM, Chehreghani MH, Buhmann JM (2012) The information content in sorting algorithms. In: IEEE International Symposium on Information Theory Proceedings (ISIT), Cambridge, MA, USA, pp 2746\u20132750","DOI":"10.1109\/ISIT.2012.6284021"},{"issue":"1","key":"2567_CR2","first-page":"62","volume":"1","author":"C Canaan","year":"2011","unstructured":"Canaan C, Garai MS, Daya M (2011) Popular sorting algorithms. World Appl Program 1(1):62\u201371","journal-title":"World Appl Program"},{"key":"2567_CR3","volume-title":"The art of computer programming","author":"DE Knuth","year":"2011","unstructured":"Knuth DE (2011) The art of computer programming. Addison-Wesley Professional, Boston"},{"issue":"7","key":"2567_CR4","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.jlap.2008.12.003","volume":"78","author":"F Henglein","year":"2009","unstructured":"Henglein F (2009) What is a sorting function? J Logic Algebr Program 78(7):552\u2013572","journal-title":"J Logic Algebr Program"},{"key":"2567_CR5","unstructured":"Ionescu MF, Schauser KE (1997) Optimize parallel bitonic sort. In: Proceedings 11th International Parallel Processing Symposium, Genva, pp 303\u2013309"},{"issue":"8","key":"2567_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.4156\/jdcta.vol4.issue8.21","volume":"4","author":"D Fuguo","year":"2010","unstructured":"Fuguo D (2010) Several incomplete sort algorithms for getting the median value. Int J Digit Content Technol Appl 4(8):193\u2013198","journal-title":"Int J Digit Content Technol Appl"},{"issue":"4","key":"2567_CR7","first-page":"1","volume":"14","author":"D Cederman","year":"2009","unstructured":"Cederman D, Tsigas P (2009) GPU-quicksort: a practical quicksort algorithm for graphics processors. ACM J Exp Algorithm (JEA) 14(4):1\u201322","journal-title":"ACM J Exp Algorithm (JEA)"},{"key":"2567_CR8","doi-asserted-by":"crossref","unstructured":"Zhang R, Wei X, Watanabe T (2013) A sorting-based IO connection assignment for flip-chip designs. In: 2013 IEEE 10th International Conference on ASIC (ASICON), Shenzhen, pp 1\u20134","DOI":"10.1109\/ASICON.2013.6811927"},{"key":"2567_CR9","first-page":"602","volume":"50","author":"Y Han","year":"2004","unstructured":"Han Y (2004) Deterministic sorting in O(n(log(log n))) time and linear space. J Algorithms Sci Direct Publ 50:602\u2013608","journal-title":"J Algorithms Sci Direct Publ"},{"key":"2567_CR10","unstructured":"Bentley JL, Sedgewick R (1997) Fast algorithms for sorting and searching strings. In: Proceedings of the Eighth annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201897), pp 360\u2013369"},{"key":"2567_CR11","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.jcss.2009.04.005","volume":"75","author":"T-C Lin","year":"2009","unstructured":"Lin T-C, Kuo C-C, Hsieh Y-H, Wang B-F (2009) Efficient algorithms for the inverse sorting problem with bound constraints under the norm and the Hamming distance. J Comput Syst Sci 75:451\u2013464","journal-title":"J Comput Syst Sci"},{"key":"2567_CR12","unstructured":"Abdel-hafeez S, Gordon-Ross A, Abubaker S (2016) A comparison-free sorting algorithm on CPUs. In: 13th International Conference on Applied Computing (AC), Mannheim, Germany, October 2016, pp 3\u201310"},{"key":"2567_CR13","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.ipm.2010.11.010","volume":"48","author":"G Capannini","year":"2012","unstructured":"Capannini G, Silvestri F, Baraglia R (2012) Sorting on GPUs for large scale datasets: a through comparison. Int Process Manag 48:903\u2013917","journal-title":"Int Process Manag"},{"issue":"5","key":"2567_CR14","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1109\/TVLSI.2017.2661746","volume":"2","author":"S Abdel-hafeez","year":"2017","unstructured":"Abdel-hafeez S, Gordon-Ross A (2017) An efficient O(N) comparison-free sorting algorithm. J IEEE Trans Very Large Scale Integr (VLSI) Syst 2(5):1930\u20131942","journal-title":"J IEEE Trans Very Large Scale Integr (VLSI) Syst"},{"key":"2567_CR15","doi-asserted-by":"crossref","unstructured":"Herruzo E, Ruiz G, Benavides J, Plata O, (2007) A new parallel sorting algorithm based on odd-even mergesort. In: 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, Naples, (PDP 07), pp 18\u201322","DOI":"10.1109\/PDP.2007.10"},{"key":"2567_CR16","doi-asserted-by":"crossref","unstructured":"Inoue H, Moriyama T, Komatsu H, Nakatani T (2007) AA-SORT: a new parallel sorting algorithm for multi-core SIMD processors. In: 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), Brasov, pp 189\u2013198","DOI":"10.1109\/PACT.2007.4336211"},{"key":"2567_CR17","doi-asserted-by":"crossref","unstructured":"Satish N, Kim C, Chhugani J, Nguyen A, Lee V, Kim D, Dubey P (2010) Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD Sort. In: SIGMOD\u201910, Indiana, vol 27, number 3, pp 351\u2013362","DOI":"10.1145\/1807167.1807207"},{"key":"2567_CR18","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1016\/j.jpdc.2011.07.004","volume":"71","author":"V Kundeti","year":"2011","unstructured":"Kundeti V, Rajasekaran S (2011) Efficient out-of-core sorting algorithms for the parallel disks model. J Parallel Distrib Comput 71:1427\u20131433","journal-title":"J Parallel Distrib Comput"},{"key":"2567_CR19","doi-asserted-by":"crossref","unstructured":"Satish N, Harris M, Garland M (2009) Designing efficient sorting algorithms for manycore GPUs. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, Rome, pp 1\u201310","DOI":"10.1109\/IPDPS.2009.5161005"},{"key":"2567_CR20","doi-asserted-by":"crossref","unstructured":"Garg A, Goswami S, Garg V (2016) CutShort: a hybrid sorting technique. In: 2016 International Conference on Computing, Communication and Automation (ICCCA), Noida, pp 139\u2013142","DOI":"10.1109\/CCAA.2016.7813705"},{"issue":"2","key":"2567_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/43.743726","volume":"18","author":"J-T Yan","year":"1999","unstructured":"Yan J-T (1999) An improved optimal algorithm for bubble-sorting based non-Manhattan channel routing. IEEE Trans Comput Aided Des Integr Circuits Syst 18(2):163\u2013171","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"3","key":"2567_CR22","first-page":"522","volume":"3","author":"P Sareen","year":"2013","unstructured":"Sareen P (2013) Comparison of sorting algorithms (on the basis of average case). IJARCSSE 3(3):522\u2013532","journal-title":"IJARCSSE"},{"issue":"3","key":"2567_CR23","first-page":"1","volume":"5","author":"L Xiao","year":"2000","unstructured":"Xiao L, Zhang X, Kubricht SA (2000) Improving memory performance of sorting algorithms. ACM J Exp Algorithm 5(3):1\u201320","journal-title":"ACM J Exp Algorithm"},{"key":"2567_CR24","unstructured":"Bunse C, Hopfner H, Roychoudhury S, Mansour E (2009) Choosing the BEST Sorting Algorithm from Optimal Energy Consumption. In: ICSOFT 2. INSTICC Press, pp 199\u2013206"},{"key":"2567_CR25","first-page":"363","volume":"2","author":"AD Mishra","year":"2008","unstructured":"Mishra AD, Garg D (2008) Selection of best sorting algorithm. Int J Intell Inf Process 2:363\u2013368","journal-title":"Int J Intell Inf Process"},{"key":"2567_CR26","first-page":"140","volume-title":"Programming massively parallel processors: a hands-on approach, Ch 6","author":"DB Kirk","year":"2013","unstructured":"Kirk DB, Hwu W-MW (2013) Programming massively parallel processors: a hands-on approach, Ch 6. Morgan Kaufman, San Francisco, pp 140\u2013144"},{"key":"2567_CR27","volume-title":"Introduction to parallel computing","author":"A Grama","year":"2003","unstructured":"Grama A, Gupta A, Karypis G, Kumar V (2003) Introduction to parallel computing. Pearson Education Limited, Edinburgh"},{"key":"2567_CR28","volume-title":"Computer systems: a programmer\u2019s perspective","author":"RE Bryant","year":"2003","unstructured":"Bryant RE, O\u2019Hallaron DR (2003) Computer systems: a programmer\u2019s perspective. Pearson Education Inc, Edinburgh"},{"key":"2567_CR29","unstructured":"Sorting Algorithms Animations. \n https:\/\/www.toptal.com\/developers\/sorting-algorithms\/\n \n . Accessed 16 Mar 2016"},{"issue":"3","key":"2567_CR30","first-page":"522","volume":"3","author":"Pankaj Sareen","year":"2013","unstructured":"Sareen Pankaj (2013) Comparison of sorting algorithms (on the basis of average case). IJARCSSE 3(3):522\u2013532","journal-title":"IJARCSSE"},{"issue":"2","key":"2567_CR31","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2002.1211","volume":"42","author":"Mikkel Thorup","year":"2002","unstructured":"Thorup Mikkel (2002) Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations. Elsevier J Algorithms 42(2):205\u2013230","journal-title":"Elsevier J Algorithms"},{"key":"2567_CR32","doi-asserted-by":"crossref","unstructured":"Herruzo E, Ruiz G, Benavides JI, Plata O (2007) A new parallel sorting algorithm based on odd-even mergesort. In: 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 07), pp 18\u201322","DOI":"10.1109\/PDP.2007.10"},{"key":"2567_CR33","doi-asserted-by":"crossref","unstructured":"Inoue H, Moriyama T, Komatsu H, Nakatani T (2007) AA-SORT: a new parallel sorting algorithm for multi-core SIMD processors. In: 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), Brasov, pp 189\u2013198","DOI":"10.1109\/PACT.2007.4336211"},{"issue":"4","key":"2567_CR34","first-page":"1","volume":"14","author":"D Cederman","year":"2009","unstructured":"Cederman D, Tsigas P (2009) GPU-quicksort: a practical quicksort algorithm for graphics processors. ACM J Exp Algorithm (JEA) 14(4):1\u201322","journal-title":"ACM J Exp Algorithm (JEA)"},{"key":"2567_CR35","doi-asserted-by":"crossref","unstructured":"Satish N, Harris M, Garland M (2009) Designing efficient sorting algorithms for manycore GPUs. In: Proceedings of 23rd IEEE International Parallel and Distributed Processing Symposium, pp 1\u201310","DOI":"10.1109\/IPDPS.2009.5161005"},{"issue":"5","key":"2567_CR36","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1556444.1556447","volume":"36","author":"D Cederman","year":"2008","unstructured":"Cederman D, Tsigas P (2008) On sorting and load balancing on GPUs. Distrib Comput Syst ACM SIGARCH Comput Archit News 36(5):11\u201318","journal-title":"Distrib Comput Syst ACM SIGARCH Comput Archit News"},{"key":"2567_CR37","first-page":"173","volume":"2011","author":"FG Khan","year":"2011","unstructured":"Khan FG, Khan OU, Montrucchio B, Giaccone P (2011) Analysis of fast parallel sorting algorithms for GPU architectures. Front Inf Technol 2011:173\u2013178","journal-title":"Front Inf Technol"},{"issue":"7","key":"2567_CR38","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1109\/TC.2012.108","volume":"62","author":"A Farmahini-Farahani","year":"2013","unstructured":"Farmahini-Farahani A, Duwe HJ, Schulte MJ, Compton K (2013) Modular design of high-throughput, low-latency sorting units. IEEE Trans Comput 62(7):1389\u20131402","journal-title":"IEEE Trans Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2567-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2567-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2567-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T23:33:30Z","timestamp":1569972810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2567-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,30]]},"references-count":38,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["2567"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2567-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2018,8,30]]},"assertion":[{"value":"30 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}