{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:00:06Z","timestamp":1725487206321},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414292"},{"type":"electronic","value":"9783540444671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44467-x_27","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:21:46Z","timestamp":1184602906000},"page":"301-309","source":"Crossref","is-referenced-by-count":3,"title":["Parallel Sorting Algorithms with Sampling Techniques on Clusters with Processors Running at Different Speeds"],"prefix":"10.1007","author":[{"given":"Christophe","family":"C\u00e9rin","sequence":"first","affiliation":[]},{"given":"Jean Luc","family":"Gaudiot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,8]]},"reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0743-7315(92)90075-X","volume":"14","author":"H. Shi","year":"1992","unstructured":"H. Shi and J. Schaeffer, \u201cParallel sorting by regular sampling,\u201d Journal of Parallel and Distributed Computing, vol. 14, no. 4, pp. 361\u2013372, 1992.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"27_CR2","unstructured":"O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping, \u201cThe paderborn university bsp (pub) library-design, implementation and performance,\u201d in 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 12-16 April, 1999, San Juan, Puerto Rico, available electronically through IEEE Computer Society, 1999."},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0129626499000384","volume":"9","author":"N. S. A. Ferreira","year":"1999","unstructured":"N. S. Afonso Ferreira, \u201cA randomized bsp\/cgm algorithm for the maximal independent set problem,\u201d Parallel Processing Letters, vol. 9, no. 3, pp. 411\u2013422, 1999.","journal-title":"Parallel Processing Letters"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"C. C\u00e9rin and J.-L. Gaudiot, \u201cAlgorithms for stable sorting to minimize communications in networks of workstations and their implementations in bsp,\u201d in IEEE Computer Society International Wokshop on Cluster Computing (IWCC\u201999), pp. 112\u2013120, 1999.","DOI":"10.1109\/IWCC.1999.810815"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"G. Blelloch, C. Leiserson, and B. Maggs, \u201cA Comparison of Sorting Algorithms for the Connection Machine CM-2,\u201d in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, July 1991.","DOI":"10.1145\/113379.113380"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"H. Li and K. C. Sevcik, \u201cParallel sorting by overpartitioning,\u201d in Proceedings of the 6th Annual Symposium on Parallel Algorithms and Architectures, (New York, NY, USA), pp. 46\u201356, ACM Press, June 1994.","DOI":"10.1145\/181014.192329"},{"key":"27_CR7","unstructured":"Helman and J\u00e1J\u00e1, \u201cSorting on clusters of SMPs,\u201d Informatica: An International Journal of Computing and Informatics, vol. 23, 1999."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01952679","volume":"29","author":"M. Quinn","year":"1989","unstructured":"M. Quinn, \u201cAnalysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge,\u201d BIT, vol. 29, no. 2, pp. 239\u2013250, 1989.","journal-title":"BIT"},{"key":"27_CR9","unstructured":"X. Li, P. Lu, J. Schaeffer, J. Shillington, P. S. Wong, and H. Shi, \u201cOn the versatility of parallel sorting by regular sampling,\u201d Parallel Computing, vol. 19, pp. 1079\u20131103, Oct. 1993."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2014 HiPC 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44467-X_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:32:43Z","timestamp":1556681563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44467-X_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414292","9783540444671"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44467-x_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}