{"id":"https://openalex.org/W2575826106","doi":"https://doi.org/10.3233/978-1-61499-621-7-439","title":"A Massively Parallel Barnes-Hut Tree Code with Dual Tree Traversal","display_name":"A Massively Parallel Barnes-Hut Tree Code with Dual Tree Traversal","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2575826106","doi":"https://doi.org/10.3233/978-1-61499-621-7-439","mag":"2575826106"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-61499-621-7-439","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-621-7-439","pdf_url":null,"source":{"id":"https://openalex.org/S4210175178","display_name":"Advances in parallel computing","issn_l":"0927-5452","issn":["0927-5452","1879-808X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Parallel Computing","raw_type":"book-chapter"},"type":"book-chapter","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/A5060056451","display_name":"B. Steinbusch","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Steinbusch Benedikt","raw_affiliation_strings":["KU Leuven"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038332510","display_name":"Marvin\u2010Lucas Henkel","orcid":"https://orcid.org/0000-0003-1440-923X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henkel Marvin-Lucas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Winkel Mathias","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Winkel Mathias","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027806999","display_name":"P. Gibbon","orcid":"https://orcid.org/0000-0002-5540-9626"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gibbon Paul","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5060056451"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":0.4992,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6762226,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9995999932289124,"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/T12029","display_name":"DNA and Biological Computing","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8830889463424683},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6260645389556885},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.6141974329948425},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5764741897583008},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5665788054466248},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44721484184265137},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2951101064682007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2235213816165924},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09219053387641907}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8830889463424683},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6260645389556885},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.6141974329948425},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5764741897583008},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5665788054466248},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44721484184265137},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2951101064682007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2235213816165924},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09219053387641907},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/978-1-61499-621-7-439","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-621-7-439","pdf_url":null,"source":{"id":"https://openalex.org/S4210175178","display_name":"Advances in parallel computing","issn_l":"0927-5452","issn":["0927-5452","1879-808X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Parallel Computing","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1964275886","https://openalex.org/W2068306188","https://openalex.org/W2083206954","https://openalex.org/W2120229493","https://openalex.org/W2136770272","https://openalex.org/W3121187660"],"related_works":["https://openalex.org/W4229950834","https://openalex.org/W2023839151","https://openalex.org/W1774183074","https://openalex.org/W3107197685","https://openalex.org/W2057488824","https://openalex.org/W2908418870","https://openalex.org/W2334687145","https://openalex.org/W2178011914","https://openalex.org/W48124421","https://openalex.org/W4235962491"],"abstract_inverted_index":{"Hierarchical":[0],"methods":[1],"like":[2],"the":[3,9,19,24,68,71,94,102],"Barnes-Hut":[4],"(BH)":[5],"tree":[6,47,85],"code":[7,48,86],"and":[8,39,87,106],"Fast":[10],"Multipole":[11],"Method":[12],"(FMM)":[13],"are":[14],"important":[15],"tools":[16],"to":[17,32,111],"decrease":[18],"algorithmic":[20],"complexity":[21],"of":[22,70,82,96],"solving":[23],"N-body":[25],"problem.":[26],"We":[27,65,91],"report":[28],"on":[29,36,57],"recent":[30,77],"efforts":[31],"achieve":[33,112],"massive":[34],"scalability":[35,95],"IBM":[37],"BlueGene/Q":[38],"other":[40],"highly":[41],"concurrent":[42],"supercomputers":[43],"with":[44,62],"our":[45],"BH":[46,84],"PEPC":[49],"by":[50,101],"replacing":[51],"a":[52,75,109],"thread":[53],"synchronization":[54],"strategy":[55],"based":[56],"traditional":[58],"lock":[59],"data":[60],"structures":[61],"atomic":[63],"operations.":[64],"also":[66],"describe":[67],"integration":[69],"Dual":[72],"Tree":[73],"Traversal":[74],"more":[76],"algorithm":[78,98],"that":[79],"combines":[80],"advantages":[81],"both":[83],"FMM":[88],"into":[89],"PEPC.":[90],"explain":[92],"how":[93],"this":[97],"is":[99],"influenced":[100],"existing":[103],"communication":[104],"scheme":[105],"we":[107],"propose":[108],"modification":[110],"better":[113],"distributed":[114],"memory":[115],"scalability.":[116]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2017-01-26T00:00:00"}