{"id":"https://openalex.org/W1971297816","doi":"https://doi.org/10.1142/s0129626414500054","title":"Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge","display_name":"Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge","publication_year":2014,"publication_date":"2014-03-01","ids":{"openalex":"https://openalex.org/W1971297816","doi":"https://doi.org/10.1142/s0129626414500054","mag":"1971297816"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626414500054","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626414500054","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017050802","display_name":"Christian H. Siebert","orcid":"https://orcid.org/0000-0001-7228-5488"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Siebert","raw_affiliation_strings":["RWTH Aachen University, Department of Computer Science, Laboratory for Parallel Programming, Schinkelstrasse 2a, 52062 Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Department of Computer Science, Laboratory for Parallel Programming, Schinkelstrasse 2a, 52062 Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064279948","display_name":"Jesper Larsson Tr\u00e4ff","orcid":"https://orcid.org/0000-0002-4864-9226"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Jesper Larsson Tr\u00e4ff","raw_affiliation_strings":["Vienna University of Technology, Faculty of Informatics, Institute of Information Systems, Research Group Parallel Computing, Favoritenstrasse 16, 1040 Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Faculty of Informatics, Institute of Information Systems, Research Group Parallel Computing, Favoritenstrasse 16, 1040 Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0797,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.79338015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"24","issue":"01","first_page":"1450005","last_page":"1450005"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.7917871475219727},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.773115873336792},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5419141054153442},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5322625041007996},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4917912781238556},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4372459053993225},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.41232678294181824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4046338200569153},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3010982871055603},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21517223119735718}],"concepts":[{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.7917871475219727},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.773115873336792},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5419141054153442},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5322625041007996},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4917912781238556},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4372459053993225},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.41232678294181824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4046338200569153},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3010982871055603},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21517223119735718},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.0},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626414500054","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626414500054","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W267273397","https://openalex.org/W1974615456","https://openalex.org/W1974815393","https://openalex.org/W1992402172","https://openalex.org/W2002023594","https://openalex.org/W2040730660","https://openalex.org/W2044031350","https://openalex.org/W2045271686","https://openalex.org/W2048234997","https://openalex.org/W2062679636","https://openalex.org/W2087489294","https://openalex.org/W2090650041","https://openalex.org/W2101000699","https://openalex.org/W2110045923"],"related_works":["https://openalex.org/W1997715509","https://openalex.org/W2356015003","https://openalex.org/W2074050947","https://openalex.org/W1838431648","https://openalex.org/W2156833550","https://openalex.org/W2006931095","https://openalex.org/W2060029658","https://openalex.org/W4237134732","https://openalex.org/W2388800952","https://openalex.org/W2049427966"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,36,140,172,211],"simple,":[3,38],"work-optimal":[4],"and":[5,22,40,125,180,206,234,284],"synchronization-free":[6],"solution":[7],"to":[8,65,111,134,165,191,196,210,217,279],"the":[9,49,54,60,77,86,90,93,100,105,113,136,152,197,201,222,225,238,251,266],"problem":[10],"of":[11,20,29,48,57,59,99,142,155,183,213,240,253],"stably":[12,50],"merging":[13,182],"in":[14,76,97,132,237],"parallel":[15,133,176,198,267],"two":[16,61,101,214],"given,":[17],"ordered":[18,27],"arrays":[19,63,103,138],"m":[21],"n":[23],"elements":[24,242,255],"into":[25,139],"an":[26],"array":[28,232],"m+n":[30],"elements.":[31,156],"The":[32,116,169],"main":[33],"contribution":[34],"is":[35,130,171,203,277],"new,":[37],"fast":[39],"direct":[41],"algorithm":[42,91,118,161,202,227,269],"that":[43],"determines,":[44],"for":[45,72,220,229],"any":[46,73],"prefix":[47],"merged":[51],"output":[52,68,83,88,231],"array,":[53,84],"exact":[55],"prefixes":[56,108],"each":[58,98,148],"input":[62,102,107,114,137],"needed":[64],"produce":[66],"this":[67],"prefix.":[69],"More":[70],"precisely,":[71],"given":[74],"index":[75],"resulting,":[78],"but":[79],"not":[80,258],"yet":[81],"constructed":[82],"representing":[85,104],"desired":[87],"prefix,":[89],"computes":[92],"indices":[94,233],"(called":[95],"co-ranks)":[96],"required":[106],"without":[109,188],"having":[110],"merge":[112,160,166,177,199,268],"arrays.":[115],"co-ranking":[117,223],"takes":[119],"[Formula:":[120],"see":[121],"text]":[122],"time":[123,248],"steps,":[124],"uses":[126],"O(1)":[127],"space.":[128],"Co-ranking":[129,179],"used":[131,164],"partition":[135],"collection":[141],"as":[143,146],"many":[144],"pairs":[145,167,184],"desired,":[147],"pair":[149],"with":[150],"exactly":[151],"same":[153],"number":[154,252],"Any":[157],"stable,":[158,175],"sequential":[159,181],"can":[162,185,207],"be":[163,186,208],"independently.":[168],"result":[170],"perfectly":[173],"load-balanced,":[174],"algorithm.":[178],"done":[187],"synchronization.":[189],"Compared":[190,216],"other,":[192],"linear":[193,272],"speed-up":[194],"approaches":[195],"problem,":[200,224],"considerably":[204],"simpler":[205],"up":[209],"factor":[212],"faster.":[215],"previous":[218],"algorithms":[219],"solving":[221],"new":[226],"works":[228],"arbitrary":[230],"maintains":[235],"stability":[236],"presence":[239],"repeated":[241],"at":[243],"no":[244],"extra":[245],"space":[246],"or":[247],"cost.":[249],"When":[250],"processing":[254],"p":[256],"does":[257],"exceed":[259],"(m":[260],"+":[261],"n)/":[262],"log":[263],"min(m,":[264],"n),":[265],"has":[270],"perfect,":[271],"speedup":[273],"p.":[274],"Furthermore,":[275],"it":[276],"easy":[278],"implement":[280],"on":[281],"both":[282],"shared":[283],"distributed":[285],"memory":[286],"systems.":[287]},"counts_by_year":[{"year":2014,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}