{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:56Z","timestamp":1725664976456},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631385"},{"type":"electronic","value":"9783540691570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63138-0_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:07:38Z","timestamp":1330297658000},"page":"13-24","source":"Crossref","is-referenced-by-count":27,"title":["Efficient massively parallel quicksort"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Hansch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"2_CR1","unstructured":"D. Bailey, E. Barszcz, J. Barton, D. Browning, and R. Carter. The NAS parallel benchmarks. Technical Report RNR-94-007, RNR, 1994."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. A comparison of sorting algorithms for the connection machine CM-2. In ACM Symposium on Parallel Architectures and Algorithms, pages 3\u201316, 1991.","DOI":"10.1145\/113379.113380"},{"issue":"2","key":"2_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/232302.232323","volume":"30","author":"R. Butenuth","year":"1996","unstructured":"R. Butenuth, W. Burke, and H.-U. Hei\u00df. Cosy \u2014 an operating system for highly parallel computers. ACM Operating Systems Review, 30(2):81\u201391, 1996.","journal-title":"ACM Operating Systems Review"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"R. Diekmann, J. Gehring, R. L\u00fcling, B. Monien, M. N\u00fcbel, and R. Wanka. Sorting large data sets on a massively parallel system. In 6th IEEE Symposium on Parallel and Distributed Processing, pages 2\u20139, 1994.","DOI":"10.1109\/SPDP.1994.346188"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"S. Goil, S. Aluru, and S. Ranka. Concatenated parallelism: A technique for efficient parallel divide and conquer. In Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing, pages 488\u2013495, 1996.","DOI":"10.1109\/SPDP.1996.570373"},{"key":"2_CR6","unstructured":"J. Hardwick. An efficient implementation of nested data parallelism for irregurlar divide-and-conquer algorithms. In Workshop on High-Level Programming Models and Supportive Environments, Honolulu, Hawaii, 1996."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"W. L. Hightower, J. F. Prins, and J. H. Reif. Implementations of randomized sorting on large parallel machines. In ACM Symposium on Parallel Architectures and Algorithms, pages 158\u2013167, 1992.","DOI":"10.1145\/140901.140918"},{"key":"2_CR8","unstructured":"V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing. Design and Analysis of Algorithms. Benjamin\/Cummings, 1994."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"H. Li and K. C. Sevcik. Parallel sorting by overpartitioning. In ACM Symposium on Parallel Architectures and Algorithms, pages 46\u201356, Cape May, New Jersey, 1994.","DOI":"10.1145\/181014.192329"},{"key":"2_CR10","unstructured":"R. Niedermeier and P. Sanders. On the Manhattan-distance between points on space-filling mesh-indexings. Technical Report IB 18\/96, Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, 1996."},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01952679","volume":"25","author":"M. J. Quinn","year":"1989","unstructured":"M. J. Quinn. Analysis and benchmarking oaf two parallel sorting algorithms: hyperquicksort and quickmerge. BIT, 25:239\u2013250, 1989.","journal-title":"BIT"},{"key":"2_CR12","unstructured":"S. Rajasekaran and S. Sen. Random sampling techniques and parallel algorithm design. In H. Reif, editor, Synthesis of Parallel Algorithms, chapter 9, pages 411\u2013451. Morgan Kaufmann, 1993."},{"key":"2_CR13","unstructured":"P. Sanders. A scalable parallel tree search library. In S. Ranka, editor, 2nd Workshop on Solving Irregular Problems on Distributed Memory Machines, Honolulu, Hawaii, 1996."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"P. Sanders. Randomized priority queues for fast parallel access. Technical Report IB 7\/97, Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, 1997.","DOI":"10.1006\/jpdc.1998.1429"},{"issue":"2","key":"2_CR15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01407839","volume":"20","author":"V. Singh","year":"1991","unstructured":"V. Singh, V. Kumar, G. Agha, and C. Tomlinson. Efficient algorithms for parallel sorting on mesh multicomputers. International Journal of Parallel Programming, 20(2):95\u2013131, 1991.","journal-title":"International Journal of Parallel Programming"},{"issue":"1","key":"2_CR16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0167-8191(94)90116-3","volume":"20","author":"T. Umland","year":"1994","unstructured":"T. Umland. Parallel sorting revisited. Parallel Computing, 20(1):115\u2013124, 1994.","journal-title":"Parallel Computing"}],"container-title":["Lecture Notes in Computer Science","Solving Irregularly Structured Problems in Parallel"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63138-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:51Z","timestamp":1605647751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63138-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631385","9783540691570"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63138-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}