{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:13:41Z","timestamp":1742958821892,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030483395"},{"type":"electronic","value":"9783030483401"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48340-1_30","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T23:07:41Z","timestamp":1590707261000},"page":"388-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Data-Adapted Parallel Merge Sort"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Holke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"R\u00fcttgers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Margrit","family":"Klitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Achim","family":"Basermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Bitton, D., DeWitt, D.J., Hsiao, D.K., Menon, J.: A taxonomy of parallel sorting. Technical report, Cornell University (1984)","DOI":"10.1145\/2514.2516"},{"key":"30_CR2","unstructured":"CASE-2: SGI ICE X, Intel Xeon E5\u20132695v2 12C 2.4\u00a0GHz, Inifiniband, FDR. https:\/\/www.top500.org\/system\/178196. Accessed 16 Apr 2019"},{"key":"30_CR3","unstructured":"Friedland, D.B.: Design, analysis, and implementation of parallel external sorting algorithms. Ph.D. thesis (1981). aAI8206830"},{"key":"30_CR4","unstructured":"JUWELS: http:\/\/www.fz-juelich.de\/ias\/jsc\/EN\/Expertise\/Supercomputers\/JUWELS\/JUWELS_node.html. Accessed 15 Apr 2019"},{"key":"30_CR5","unstructured":"Karypis, G., Schoegel, K., Kumar, V.: ParMETIS - parallel graph partitioning and sparse matrix ordering library, version 3.1 (2013)"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"30_CR7","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Pearson Education, London (1997)"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/2669372","volume":"41","author":"D Langr","year":"2014","unstructured":"Langr, D., Tvrd\u00edk, P., Dytrych, T., Draayer, J.P.: Algorithm 947: Paraperm-parallel generation of random permutations with MPI. ACM Trans. Math. Softw. 41(1), 51\u2013526 (2014). https:\/\/doi.org\/10.1145\/2669372. http:\/\/doi.acm.org\/10.1145\/2669372","journal-title":"ACM Trans. Math. Softw."},{"key":"30_CR9","unstructured":"Leicht, T., et al.: DLR-Project Digital-X - Next generation CFD solver \u2018Flucs\u2019. Deutscher Luft- und Raumfahrtkongress 2016, February 2016. https:\/\/elib.dlr.de\/111205\/"},{"issue":"4","key":"30_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0020-0190(00)00098-3","volume":"75","author":"FC Leu","year":"2000","unstructured":"Leu, F.C., Tsai, Y.T., Tang, C.Y.: An efficient external sorting algorithm. Inf. Proces. Lett. 75(4), 159\u2013163 (2000)","journal-title":"Inf. Proces. Lett."},{"key":"30_CR11","unstructured":"Meinel, M., Einarsson, G.O.: The FlowSimulator framework for massively parallel CFD applications. In: PARA 2010 Conference: State of the Art in Scientific and Parallel Computing. Citeseer (2010)"},{"key":"30_CR12","unstructured":"Reimer, L.: The FlowSimulator\u2013a software framework for CFD-related multidisciplinary simulations. In: European NAFEMS Conference Computational Fluid Dynamics (CFD) - Beyond the Solve, December 2015. https:\/\/elib.dlr.de\/100536\/"},{"key":"30_CR13","unstructured":"The HDF Group: Hierarchical Data Format, version 5 (1997-NNNN). http:\/\/www.hdfgroup.org\/HDF5\/"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48340-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:11:12Z","timestamp":1716941472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48340-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030483395","9783030483401"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48340-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,94","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"double blind review in two cases","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}