{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:31:38Z","timestamp":1725564698206},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335174"},{"type":"electronic","value":"9783642335181"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33518-1_25","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T12:17:23Z","timestamp":1347106643000},"page":"204-213","source":"Crossref","is-referenced-by-count":1,"title":["Efficient MPI Implementation of a Parallel, Stable Merge Algorithm"],"prefix":"10.1007","author":[{"given":"Christian","family":"Siebert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper Larsson","family":"Tr\u00e4ff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TC.1987.5009478","volume":"36","author":"S.G. Akl","year":"1987","unstructured":"Akl, S.G., Santoro, N.: Optimal parallel merging and sorting without memory conflicts. IEEE Transactions on Computers\u00a0C-36(11), 1367\u20131369 (1987)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(94)00009-3","volume":"50","author":"N. Deo","year":"1994","unstructured":"Deo, N., Jain, A., Medidi, M.: An optimal parallel algorithm for merging using multiselection. Information Processing Letters\u00a050(2), 81\u201387 (1994)","journal-title":"Information Processing Letters"},{"issue":"1-3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0020-0255(91)90028-S","volume":"56","author":"N. Deo","year":"1991","unstructured":"Deo, N., Sarkar, D.: Parallel algorithms for merging and sorting. Information Sciences\u00a056(1-3), 151\u2013161 (1991)","journal-title":"Information Sciences"},{"issue":"6","key":"25_CR4","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/S0167-8191(00)00104-6","volume":"27","author":"A.V. Gerbessiotis","year":"2001","unstructured":"Gerbessiotis, A.V., Siniolakis, C.J.: Merging on the BSP model. Parallel Computing\u00a027(6), 809\u2013822 (2001)","journal-title":"Parallel Computing"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(89)90138-5","volume":"33","author":"T. Hagerup","year":"1989","unstructured":"Hagerup, T., R\u00fcb, C.: Optimal merging and sorting on the EREW PRAM. Information Processing Letters\u00a033, 181\u2013185 (1989)","journal-title":"Information Processing Letters"},{"issue":"4","key":"25_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1051\/ita\/1993270402951","volume":"27","author":"J. Katajainen","year":"1993","unstructured":"Katajainen, J., Levcopoulos, C., Petersson, O.: Space-efficient parallel merging. Informatique Th\u00e9oretique et Applications\u00a027(4), 295\u2013310 (1993)","journal-title":"Informatique Th\u00e9oretique et Applications"},{"key":"25_CR7","unstructured":"MPI Forum. MPI: A Message-Passing Interface Standard. Version 2.2 (September 4, 2009), \n                    \n                      www.mpi-forum.org"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1177\/1094342006064504","volume":"20","author":"J. Nieplocha","year":"2006","unstructured":"Nieplocha, J., Tipparaju, V., Krishnan, M., Panda, D.K.: High performance remote memory access communication: The ARMCI approach. International Journal on High Performance Computing Applications\u00a020(2), 233\u2013253 (2006)","journal-title":"International Journal on High Performance Computing Applications"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Poole, S.W., Hernandez, O., Kuehn, J.A., Shipman, G.M., Curtis, A., Feind, K.: OpenSHMEM - toward a unified RMA model. In: Padua, D.A. (ed.) Encyclopedia of Parallel Computing, pp. 1379\u20131391. Springer (2011)","DOI":"10.1007\/978-0-387-09766-4_490"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y., Vishkin, U.: Finding the maximum, merging and sorting in a parallel computation model. Journal of Algorithms\u00a02, 88\u2013102 (1981)","journal-title":"Journal of Algorithms"},{"issue":"1-3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0167-8191(90)90040-G","volume":"15","author":"P.J. Varman","year":"1990","unstructured":"Varman, P.J., Iyer, B.R., Haderle, D.J., Dunn, S.M.: Parallel merging: algorithm and implementation results. Parallel Computing\u00a015(1-3), 165\u2013177 (1990)","journal-title":"Parallel Computing"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in the Message Passing Interface"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33518-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:14:12Z","timestamp":1620130452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33518-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335174","9783642335181"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33518-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}