{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:57:29Z","timestamp":1725490649214},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411284"},{"type":"electronic","value":"9783540399995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-39999-2_14","type":"book-chapter","created":{"date-parts":[[2007,9,3]],"date-time":"2007-09-03T00:22:39Z","timestamp":1188778959000},"page":"160-171","source":"Crossref","is-referenced-by-count":1,"title":["Partitioned Parallel Radix Sort"],"prefix":"10.1007","author":[{"given":"Shin-Jae","family":"Lee","sequence":"first","affiliation":[]},{"given":"Minsoo","family":"Jeon","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Sohn","sequence":"additional","affiliation":[]},{"given":"Dongseung","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,4,6]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"M. E. Batcher, Sorting Networks and their applications, Proceedings of AFIPS Conference, pp. 307\u2013314, 1968. 161","DOI":"10.1145\/1468075.1468121"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/12.53587","volume":"C-39","author":"R. Beigel","year":"1990","unstructured":"R. Beigel and J. Gill, Sorting n objects with k-sorter, IEEE Transactions on Computers, vol. C-39, pp. 714\u2013716, 1990.","journal-title":"IEEE Transactions on Computers"},{"issue":"8","key":"14_CR3","first-page":"161","volume":"7","author":"A. C. Dusseau","year":"1996","unstructured":"A. C. Dusseau, D. E. Culler, K. E. Schauser, and R. P. Martin, Fast parallel sorting under LogP: experience with the CM-5, IEEE Trans. Computers, Vol. 7(8), Aug. 1996. 161","journal-title":"IEEE Trans. Computers"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"D. R. Helman, D. A. Bader, and J. JaJa, Parallel algorithms for personalized communication and sorting with an experimental study, Procs. ACM Symposium on Parallel Algorithms and Architectures, Padua, Italy, pp. 211\u2013220, June 1996. 161, 164, 165","DOI":"10.1145\/237502.237558"},{"key":"14_CR5","unstructured":"J. S. Huang and Y. C. Chow, Parallel Sorting and Data Partitioning by Sampling, Procs. the 7th Computer Software and Applications Conference, pp. 627\u2013631, November 1983. 161, 164"},{"key":"14_CR6","unstructured":"J. JaJa, Introduction to Parallel Algorithms, Addison-Wesley, 1992. 161"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TC.1985.1676584","volume":"C-34","author":"F. T. Leighton","year":"1985","unstructured":"F. T. Leighton, Tight Bounds on the Complexity of Parallel Sorting, IEEE Transactions on Computers, C-34: pp. 344\u2013354, 1985. 161","journal-title":"IEEE Transactions on Computers"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Addison-Wesley, Morgan Kauffman, 1992. 160, 161","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/356593.356594","volume":"3","author":"W. A. Martin","year":"1971","unstructured":"W. A. Martin, Sorting, ACM Computing Surveys, Vol. 3(4), p.p. 147\u2013174, 1971. 160","journal-title":"ACM Computing Surveys"},{"key":"14_CR10","unstructured":"Sedgewick, Algorithms, Wiley, 1990. 161, 162"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"A. Sohn and Y. Kodama, Load balanced parallel radix sort, Procs. 12th ACM Int\u2019l Conf. Supercomputing, Melbourne, Australia, July 14\u201317, 1998. 161, 162, 165","DOI":"10.1145\/277830.277903"},{"key":"14_CR12","unstructured":"A. Sohn, Y. Kodama, M. Sato, H. Sakane, H. Yamada, S. Sakai, Y. Yamaguchi, Identifying the capability of overlapping computation with communication, Procs. ACM\/IEEE Parallel Architecture and Compilation Techniques, Boston, MA, Oct. 1996. 161"},{"key":"14_CR13","series-title":"Technical report","volume-title":"MPI: A Message-Passing Interface Standard","author":"Message Passing Interface Forum","year":"1995","unstructured":"Message Passing Interface Forum, MPI: A Message-Passing Interface Standard. Technical report, University of Tennessee, Knoxville, TN, June 1995. 165"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39999-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T19:40:49Z","timestamp":1556826049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39999-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411284","9783540399995"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-39999-2_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}