{"id":"https://openalex.org/W2003930726","doi":"https://doi.org/10.1145/1869746.1869767","title":"A specimen of parallel programming","display_name":"A specimen of parallel programming","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2003930726","doi":"https://doi.org/10.1145/1869746.1869767","mag":"2003930726"},"language":"en","primary_location":{"id":"doi:10.1145/1869746.1869767","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1869746.1869767","pdf_url":null,"source":{"id":"https://openalex.org/S2764691006","display_name":"ACM Inroads","issn_l":"2153-2184","issn":["2153-2184","2153-2192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Inroads","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/A5010456030","display_name":"Timothy J. Rolfe","orcid":null},"institutions":[{"id":"https://openalex.org/I159107703","display_name":"Eastern Washington University","ror":"https://ror.org/002g57a93","country_code":"US","type":"education","lineage":["https://openalex.org/I159107703"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Timothy J. Rolfe","raw_affiliation_strings":["Eastern Washington University, Cheney, Washington","Eastern Washington University, Cheney,#R# Washington"],"affiliations":[{"raw_affiliation_string":"Eastern Washington University, Cheney, Washington","institution_ids":["https://openalex.org/I159107703"]},{"raw_affiliation_string":"Eastern Washington University, Cheney,#R# Washington","institution_ids":["https://openalex.org/I159107703"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010456030"],"corresponding_institution_ids":["https://openalex.org/I159107703"],"apc_list":null,"apc_paid":null,"fwci":0.40081921,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70793847,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":"4","first_page":"72","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9836000204086304,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9771000146865845,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.8509076237678528},{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.6773310899734497},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6708748936653137},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.6508505344390869},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.502638578414917},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.474405974149704},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.470001757144928},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4483986794948578},{"id":"https://openalex.org/keywords/parallel-processing","display_name":"Parallel processing","score":0.4473532438278198},{"id":"https://openalex.org/keywords/merge-sort","display_name":"Merge sort","score":0.44360655546188354},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.44129228591918945},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.43251651525497437},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.39181697368621826},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3556627631187439},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.335606187582016},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3004101514816284},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.24607780575752258},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09696096181869507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0944514274597168}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8509076237678528},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.6773310899734497},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6708748936653137},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.6508505344390869},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.502638578414917},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.474405974149704},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.470001757144928},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4483986794948578},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.4473532438278198},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.44360655546188354},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.44129228591918945},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.43251651525497437},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.39181697368621826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3556627631187439},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.335606187582016},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3004101514816284},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.24607780575752258},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09696096181869507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0944514274597168},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1869746.1869767","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1869746.1869767","pdf_url":null,"source":{"id":"https://openalex.org/S2764691006","display_name":"ACM Inroads","issn_l":"2153-2184","issn":["2153-2184","2153-2192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Inroads","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1542449374","https://openalex.org/W1558864477","https://openalex.org/W1570906644","https://openalex.org/W4206037918","https://openalex.org/W4246367117"],"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/W2011379812","https://openalex.org/W3002580575","https://openalex.org/W2140238930","https://openalex.org/W3014215895","https://openalex.org/W1606108344"],"abstract_inverted_index":{"One":[0,162],"common":[1],"example":[2],"of":[3,9,59,63,88,110,117,140,176,204,221,313,331,339,346,394,400,422],"parallel":[4,15,21,43,72,89,189,294,332,370],"processing":[5,16,47,102,119,142,165,245,275,300,366,405],"is":[6,334,375,397,407],"the":[7,10,19,26,30,46,52,57,60,70,86,101,114,118,123,129,137,141,147,153,159,164,168,194,205,213,236,240,244,250,270,274,278,299,310,328,347,353,365,372,376,380,392,404,419],"implementation":[8,206,220],"merge":[11,40,146],"sort":[12],"within":[13,95,243],"a":[14,82,174,222,230,255,283,360,398,408],"environment.":[17,98],"In":[18],"fully":[20,53,287],"model,":[22],"you":[23,33,50,66,79,91,106,172,296,320,383],"repeatedly":[24],"split":[25],"sublists":[27,149],"down":[28],"to":[29,127,136,179,239,253,265,281,302,387],"point":[31],"where":[32,391],"have":[34,69,107,173,183],"single-element":[35],"lists":[36,197,252,280],"[3].":[37],"You":[38],"then":[39,151,234,260],"these":[41],"in":[42,158,170,212,273,326,364,369],"back":[44],"up":[45],"tree":[48,103,166,276,301,406,411],"until":[49],"obtain":[51,94,282],"merged":[54],"list":[55,155,175],"at":[56,352,359],"top":[58],"tree.":[61,160,246,367],"While":[62],"theoretical":[64],"interest,":[65],"probably":[67,385],"don't":[68],"massively":[71],"processor":[73],"that":[74,105,108,133,262,306,318,344],"this":[75],"would":[76],"require.":[77],"Instead,":[78],"can":[80,92],"use":[81,122,198],"mixed":[83],"strategy.":[84],"Determine":[85],"number":[87,109,330,393],"processes":[90,192,308,333],"realistically":[93],"your":[96,218,290],"computing":[97],"Then":[99],"construct":[100],"so":[104,305],"leaf":[111,115,227,348,395,414],"nodes.":[112],"Within":[113],"nodes":[116,139,349,396,415],"tree,":[120,143],"simply":[121],"best":[124],"sequential":[125,200,311],"algorithm":[126],"accomplish":[128],"sorting,":[130],"and":[131,150,182,259,356,412],"send":[132,152],"result":[134,238,263],"upstream":[135,157,264],"internal":[138],"which":[144,171,327],"will":[145,209,350,384],"sorted":[148,181,237],"resulting":[154],"farther":[156],"Figure":[161],"shows":[163],"for":[167,187],"case":[169],"2000":[177,285],"items":[178],"be":[180,210,351],"resources":[184],"only":[185],"sufficient":[186],"four":[188,303],"processes.":[190],"The":[191],"receiving":[193],"size":[195,231,256,284,314],"500":[196,232],"some":[199,345,357],"sorting":[201,224,312],"algorithm.":[202,225],"Because":[203],"environment,":[207],"it":[208],"something":[211],"C/C++":[214],"language---either":[215],"qsort()":[216],"or":[217],"favorite":[219],"fast":[223],"Each":[226],"node":[228],"(with":[229],"list)":[233],"provides":[235],"parent":[241,267],"process":[242,248,272],"That":[247,341],"combines":[249],"two":[251,279],"generate":[254],"1000":[257],"list,":[258,286],"sends":[261],"its":[266],"process.":[268],"Finally,":[269],"root":[271],"merges":[277],"sorted.":[288],"If":[289],"environment":[291],"supports":[292],"more":[293],"processes,":[295],"might":[297],"take":[298],"levels,":[304],"eight":[307],"do":[309],"250":[315],"lists.":[316],"For":[317],"matter,":[319],"could":[321],"even":[322],"deal":[323],"with":[324,389],"circumstances":[325,390],"supported":[329],"not":[335],"an":[336],"exact":[337],"power":[338,399],"two.":[340],"just":[342],"means":[343],"bottommost":[354],"level":[355,362],"conceptually":[358],"higher":[361],"above":[363],"Since":[368],"processing,":[371],"time":[373,377],"required":[374,378],"by":[379],"slowest":[381],"process,":[382],"want":[386],"stick":[388],"two---in":[401],"other":[402],"words,":[403],"full":[409],"binary":[410],"all":[413],"are":[416],"doing":[417],"approximately":[418],"same":[420],"amount":[421],"work.":[423]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}