{"id":"https://openalex.org/W2221290804","doi":"https://doi.org/10.1109/ipdps.2002.1016670","title":"Load-balanced parallel merge sort on distributed memory parallel computers","display_name":"Load-balanced parallel merge sort on distributed memory parallel computers","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2221290804","doi":"https://doi.org/10.1109/ipdps.2002.1016670","mag":"2221290804"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2002.1016670","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2002.1016670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 16th International Parallel and Distributed Processing Symposium","raw_type":"proceedings-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/A5103020286","display_name":"Minsoo Jeon","orcid":"https://orcid.org/0000-0003-2205-3210"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Minsoo Jeon","raw_affiliation_strings":["Department of Electrical Engineering, Korea University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083109471","display_name":"Dongseung Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Dongseung Kim","raw_affiliation_strings":["Department of Electrical Engineering, Korea University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103020286"],"corresponding_institution_ids":["https://openalex.org/I197347611"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.25364532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"7 pp","last_page":"7 pp"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/merge-sort","display_name":"Merge sort","score":0.8856097459793091},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.8574475049972534},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8491895198822021},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8472627997398376},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.7524369955062866},{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.7089130282402039},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.6114596724510193},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5502498149871826},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.5107531547546387},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.5003468990325928},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.43459510803222656},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.39105820655822754},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3082014322280884},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.26990365982055664}],"concepts":[{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.8856097459793091},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8574475049972534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8491895198822021},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8472627997398376},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.7524369955062866},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.7089130282402039},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.6114596724510193},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5502498149871826},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5107531547546387},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.5003468990325928},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.43459510803222656},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.39105820655822754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3082014322280884},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.26990365982055664},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2002.1016670","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2002.1016670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 16th International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W31923072","https://openalex.org/W161097227","https://openalex.org/W1575350781","https://openalex.org/W1978583881","https://openalex.org/W1992754027","https://openalex.org/W2039333207","https://openalex.org/W2041097097","https://openalex.org/W2062743552","https://openalex.org/W2092574257","https://openalex.org/W2117077079","https://openalex.org/W2132963579","https://openalex.org/W2133204787","https://openalex.org/W2134008688","https://openalex.org/W2141389982","https://openalex.org/W2176540941","https://openalex.org/W6606450935","https://openalex.org/W6679461936","https://openalex.org/W6680874277"],"related_works":["https://openalex.org/W2925598649","https://openalex.org/W4320925713","https://openalex.org/W2190513794","https://openalex.org/W2540352350","https://openalex.org/W2765396134","https://openalex.org/W2552439138","https://openalex.org/W2140238930","https://openalex.org/W2011379812","https://openalex.org/W2463222062","https://openalex.org/W2098330178"],"abstract_inverted_index":{"Sort":[0],"can":[1,18,139],"be":[2,19,140],"speeded":[3],"up":[4,48],"on":[5,26,126],"parallel":[6,60],"computers":[7,29],"by":[8,45],"dividing":[9],"and":[10,80],"computing":[11],"data":[12],"individually":[13],"in":[14,51,68,87,130],"parallel.":[15],"Merge":[16],"sort":[17,62],"parallelized,":[20],"however,":[21],"the":[22,35,39,52,71,93,101,105,108],"conventional":[23],"algorithm":[24,63],"implemented":[25],"distributed":[27,76],"memory":[28],"has":[30,95],"poor":[31],"performance":[32,94],"due":[33],"to":[34,49,77,85,142],"successive":[36],"reduction":[37],"of":[38,41,92,104,107,120,132],"number":[40],"active":[42],"(non-idling)":[43],"processors":[44,66],"a":[46,118],"half,":[47],"one":[50],"last":[53],"merging":[54,69,88],"stage.":[55],"This":[56],"paper":[57],"presents":[58],"load-balanced":[59],"merge":[61,109],"where":[64],"all":[65,78],"participate":[67],"throughout":[70],"computation.":[72],"Data":[73],"are":[74],"evenly":[75],"processors,":[79],"every":[81],"processor":[82],"is":[83,124],"forced":[84],"work":[86],"phase.":[89],"Significant":[90],"enhancement":[91],"been":[96],"achieved.":[97],"Our":[98],"analysis":[99],"shows":[100],"upper":[102],"bound":[103,123],"speedup":[106,119],"time":[110],"as":[111],"(P":[112],"-1)=":[113],"logP.":[114],"We":[115],"have":[116],"had":[117],"9.6":[121],"(upper":[122],"10.5)":[125],"32-processor":[127],"Cray":[128],"T3E":[129],"sorting":[131,145],"4M":[133],"32-bit":[134],"integers.":[135],"The":[136],"same":[137],"idea":[138],"applied":[141],"parallellize":[143],"other":[144],"algorithms.":[146]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}