{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T23:12:50Z","timestamp":1717197170706},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T00:00:00Z","timestamp":1240876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s11227-009-0294-5","type":"journal-article","created":{"date-parts":[[2009,4,27]],"date-time":"2009-04-27T12:54:41Z","timestamp":1240836881000},"page":"293-312","source":"Crossref","is-referenced-by-count":10,"title":["Analyzing and enhancing the parallel sort operation on\u00a0multithreaded architectures"],"prefix":"10.1007","volume":"53","author":[{"given":"Layali","family":"Rashid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wessam M.","family":"Hassanein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moustafa A.","family":"Hammad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,28]]},"reference":[{"key":"294_CR1","first-page":"Article 3.2","volume":"12","author":"G Brodal","year":"2008","unstructured":"Brodal G, Fagerberg R, Moruz G (2008) On the adaptiveness of quicksort. J Exp Algorithm (JEA) 12:Article 3.2","journal-title":"J Exp Algorithm (JEA)"},{"issue":"4","key":"294_CR2","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/1105734.1105742","volume":"33","author":"J Chen","year":"2005","unstructured":"Chen J, Juang P, Ko K, Contreras G, Penry D, Rangan R, Stoler A, Peh L, Martonosi M (2005) Hardware-modulated parallelism in chip multiprocessors. ACM SIGARCH Comput Archit News Arch 33(4):54\u201363","journal-title":"ACM SIGARCH Comput Archit News Arch"},{"key":"294_CR3","isbn-type":"print","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press and McGraw-Hill, Cambridge, New York. ISBN 0-262-03293-7. Section 8.4: Bucket Sort, pp\u00a0174\u2013177","ISBN":"http:\/\/id.crossref.org\/isbn\/0262032937","edition":"2"},{"key":"294_CR4","unstructured":"DeWitt D, Naughton J, Schneider D (1992) Parallel Sorting on Shared Nothing Architectures Using Probabilistic Splitting. In: Proceedings of the 1st Intel conference on parallel and distributed info systems, 1992, pp 280\u2013291"},{"key":"294_CR5","doi-asserted-by":"crossref","unstructured":"Graefe G (2006) Implementing sorting in database systems. ACM Comput Surv (CSUR) 38(3)","DOI":"10.1145\/1132960.1132964"},{"issue":"9","key":"294_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/2.612253","volume":"30","author":"L Hammond","year":"1997","unstructured":"Hammond L, Nayfeh B, Olukotun K (1997) A single-chip multiprocessor. IEEE Comput 30(9):79\u201385","journal-title":"IEEE Comput"},{"key":"294_CR7","unstructured":"Intel\u00ae (2009) VTune Performance Analyzer for Linux. URL: http:\/\/www.intel.com\/software\/products\/vtune\/"},{"key":"294_CR8","unstructured":"Intel C++ Compiler for Linux (2009) URL: http:\/\/www.intel.com\/cd\/software\/products\/asmo-na\/eng\/compilers\/277618.htm"},{"key":"294_CR9","unstructured":"Intel\u00ae Core 2 Duo (2009) URL: http:\/\/www.intel.com\/products\/processor\/core2duo\/index.htm"},{"key":"294_CR10","unstructured":"Intel Hyper-Threading Technology (2002) URL: http:\/\/www.intel.com\/technology\/itj\/2002\/volume06issue01\/vol6iss1_hyper_threading_technology.pdf"},{"key":"294_CR11","unstructured":"Jim\u00e9nez-Gonz\u00e1lez D, Navarro JJ, Larriba-Pey J (1999) Communication and cache conscious radix sort. In: Proceedings of the international conference on supercomputing, 1999, pp 76\u201383"},{"key":"294_CR12","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez-Gonz\u00e1lez D, Navarro JJ, Larriba-Pey J (2001) Fast Parallel in-memory 64-bit Sorting. In: Proceedings of the 15th ACM international conference on supercomputing (ICS), 2001, pp 114\u2013122","DOI":"10.1145\/377792.377816"},{"key":"294_CR13","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez-Gonz\u00e1lez D, Navarro JJ, Larriba-Pey J (2003) CC-Radix: a cache conscious sorting based on radix sort. In: Proceedings of the 11th Euromicro conference on parallel distributed and network-based processing (PDP), 2003, pp 101\u2013108","DOI":"10.1109\/EMPDP.2003.1183573"},{"key":"294_CR14","volume-title":"The art of computer programming, vol 3: sorting and searching","author":"D Knuth","year":"1997","unstructured":"Knuth D (1997) The art of computer programming, vol 3: sorting and searching, 3rd edn. Addison-Wesley, Reading","edition":"3"},{"key":"294_CR15","unstructured":"LaMarca A, Ladner R (1997) The influence of caches on the performance of sorting. In: Proceeding of the ACM\/SIAM symposium on discrete algorithms, 1997, pp 370\u2013379"},{"key":"294_CR16","doi-asserted-by":"crossref","unstructured":"Larriba-Pey JL, Jimenez D, Navarro J (1997) An analysis of superscalar Sorting Algorithms on an R8000 Processor. In: Proceedings of the 17th international conference of the Chilean Computer Science Society (SCCC), 1997, pp 125\u2013134","DOI":"10.1109\/SCCC.1997.637084"},{"key":"294_CR17","doi-asserted-by":"crossref","unstructured":"Lee S, Jeon M, Kim D, Sohn A (2002) Partition parallel radix sort. J Parallel Distrib Comput 656\u2013668","DOI":"10.1006\/jpdc.2001.1808"},{"key":"294_CR18","unstructured":"Marr DT, Binns F, Hill DL, Hinton G, Koufaty DA, Miller JA, Upton M (2002) Hyper-threading technology architecture and microarchitecture. Intel Technol J (Q1):4\u201315"},{"key":"294_CR19","unstructured":"OpenMP\u00ae (2009) URL: http:\/\/www.openmp.org\/"},{"key":"294_CR20","unstructured":"Rahman N, Raman R (2000) Adapting radix sort to the memory hierarchy. In: Proceedings of the 2nd workshop on algorithm engineering and experiments (ALENEX), 2000, pp 131\u2013146"},{"key":"294_CR21","doi-asserted-by":"crossref","unstructured":"Rahman N, Raman R (2000) Analysing the cache behaviour of non-uniform distribution sorting algorithms. In: Proceedings of the European symposium on algorithms (ESA), 2000, pp 380\u2013391","DOI":"10.1007\/3-540-45253-2_35"},{"key":"294_CR22","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1145\/359619.359631","volume":"21","author":"R Sedgewick","year":"1978","unstructured":"Sedgewick R (1978) Implementing quicksort programs. Commun ACM 21:847\u2013857","journal-title":"Commun ACM"},{"key":"294_CR23","doi-asserted-by":"crossref","unstructured":"Sohn A, Kodama Y (1998) Load balanced parallel radix sort. In: Proceeding of the international conference of supercomputing, 1998, pp 305\u2013312","DOI":"10.1145\/277830.277903"},{"key":"294_CR24","unstructured":"Tsigas P, Zhang Yi (2002) Parallel quicksort seems to outperform sample sort on cache-coherent shared memory multiprocessors: an evaluation on SUN ENTERPRISE 10000. Technical Report 2002-03, Department of Computer Science, Chalmers University of Technology"},{"key":"294_CR25","doi-asserted-by":"crossref","unstructured":"Tsigas P, Zhang Yi (2003) A Simple, Fast Parallel Implementation of Quicksort and its Performance Evaluation on Sun Enterprise 10000. In: Proceedings of the 11th EUROMICRO conference on parallel distributed and network-based processing (PDP), 2003, pp 372\u2013381","DOI":"10.1109\/EMPDP.2003.1183613"},{"key":"294_CR26","doi-asserted-by":"crossref","unstructured":"Tullsen D, Eggers S, Levy H (1995) Simultaneous multithreading: maximizing on-chip parallelism. In: Proceedings of the 22nd annual international symposium on computer architecture, (ISCA), 1995","DOI":"10.1145\/223982.224449"},{"issue":"3","key":"294_CR27","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\u201322","journal-title":"ACM J Exp Algorithm"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-009-0294-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-009-0294-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-009-0294-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:23:58Z","timestamp":1559384638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-009-0294-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,28]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["294"],"URL":"https:\/\/doi.org\/10.1007\/s11227-009-0294-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,28]]}}}