{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:13:49Z","timestamp":1725574429481},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407881"},{"type":"electronic","value":"9783540452096"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45209-6_122","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T21:03:29Z","timestamp":1294434209000},"page":"885-893","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving Communication Sensitive Parallel Radix Sort for Unbalanced Data"],"prefix":"10.1007","author":[{"given":"Martin","family":"Schmollinger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,6,1]]},"reference":[{"issue":"1","key":"122_CR1","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1006\/jpdc.1999.1541","volume":"58","author":"D.A. Bader","year":"1999","unstructured":"Bader, D.A., J\u00e1J\u00e1, J.: SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs). Journal of Parallel and Distributed Computing\u00a058(1), 92\u2013108 (1999)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"122_CR2","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Leiserson, C.E., Maggs, B.M., Plaxton, C.G., Smith, S.J., Zagha, M.: A Comparison of Sorting Algorithms for the Connection Machine. In: Proceedings of Sysmposium on Parallel Algorithms and Architectures, July 1991, pp. 3\u201316 (1991)","DOI":"10.1145\/113379.113380"},{"key":"122_CR3","doi-asserted-by":"crossref","unstructured":"Gerbessiotis, A.V., Siniolakis, C.J.: Deterministic Sorting and Randomized Median Finding on the BSP Model. In: Proceedings oth the 8th ACM Symposium on Parallel Algorithms and Architectures, pp. 223\u2013232 (1996)","DOI":"10.1145\/237502.237561"},{"key":"122_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1007\/3-540-44520-X_152","volume-title":"Euro-Par 2000 Parallel Processing","author":"T. Grundmann","year":"2000","unstructured":"Grundmann, T., Ritt, M., Rosenstiel, W.: Object-Oriented Message-Passing with TPO++. In: Bode, A., Ludwig, T., Karl, W.C., Wism\u00fcller, R. (eds.) Euro-Par 2000. LNCS, vol.\u00a01900, pp. 1081\u20131084. Springer, Heidelberg (2000)"},{"key":"122_CR5","doi-asserted-by":"crossref","unstructured":"Helman, D.R., Bader, D.A., J\u00e1J\u00e1, J.: Parallel Algorithms for Personalized Communication and Sorting With Experimental Study. In: Proceedings of the IEEE Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 211\u2013220 (1996)","DOI":"10.1145\/237502.237558"},{"key":"122_CR6","unstructured":"Helman, D.R., J\u00e1J\u00e1, J.: Sorting on Clusters of SMPs. Informatica: An International Journal of Computing and Informatics\u00a023 (1999)"},{"key":"122_CR7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/305138.305166","volume-title":"Proceedings of the International Conference on Supercomputing","author":"D. Jiminez-Gonzales","year":"1999","unstructured":"Jiminez-Gonzales, D., Larriba-Pey, J., Navarro, J.: Communication Conscious Radix Sort. In: Proceedings of the International Conference on Supercomputing, pp. 76\u201382. ACM, New York (1999)"},{"key":"122_CR8","doi-asserted-by":"crossref","unstructured":"Jiminez-Gonzales, D., Larriba-Pey, J., Navarro, J.: Case Study: Memory Conscious Parallel Sorting. In: Meyer, U., Sanders, P., Sibeyn, J.F. (eds.) Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625, pp. 358\u2013378. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36574-5_16"},{"key":"122_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/377792.377816","volume-title":"Proceedings of the International Conference on Supercomputing","author":"D. Jiminez-Gonzales","year":"2001","unstructured":"Jiminez-Gonzales, D., Navarro, J., Larriba-Pey, J.: Fast Parallel In-Memory 64 Bit Sorting. In: Proceedings of the International Conference on Supercomputing, pp. 114\u2013122. ACM, New York (2001)"},{"key":"122_CR10","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming: Sorting and Searching, vol.\u00a03. Addison- Wesley, London (1973)"},{"key":"122_CR11","unstructured":"Message Passing Interface Forum. MPI: A Message-Passing Interface Standard. Technical Report CS-94-230, Computer Science Department, University of Tennessee, Knoxville, TN (May 1994)"},{"key":"122_CR12","unstructured":"Message Passing Interface Forum. MPI-2: Extensions to the Message-Passing Interface (July 1997)"},{"key":"122_CR13","volume-title":"Algorithms","author":"R. Sedgewick","year":"1992","unstructured":"Sedgewick, R.: Algorithms. Addison-Wesley, Reading (1992)"},{"key":"122_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0743-7315(92)90075-X","volume":"14","author":"H. Shi","year":"1992","unstructured":"Shi, H., Schaeffer, J.: Parallel Sorting by Regular Sampling. Journal of Parallel and Distributed Computing\u00a014, 361\u2013372 (1992)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"122_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1145\/277830.277903","volume-title":"Proceedings of the International Conference on Supercomputing","author":"A. Sohn","year":"1998","unstructured":"Sohn, A., Kodama, Y.: Load Balanced Parallel Radix Sort. In: Proceedings of the International Conference on Supercomputing, pp. 305\u2013312. ACM, New York (1998)"},{"key":"122_CR16","unstructured":"University of T\u00fcbingen (SFB-382), http:\/\/kepler.sfb382-zdv.uni-tuebingen.de\/"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2003 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45209-6_122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T02:53:20Z","timestamp":1637117600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45209-6_122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407881","9783540452096"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45209-6_122","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"1 June 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}