{"id":"https://openalex.org/W4392519920","doi":"https://doi.org/10.1145/3649169.3649247","title":"Pure C++ Approach to Optimized Parallel Traversal of Regular Data Structures","display_name":"Pure C++ Approach to Optimized Parallel Traversal of Regular Data Structures","publication_year":2024,"publication_date":"2024-03-03","ids":{"openalex":"https://openalex.org/W4392519920","doi":"https://doi.org/10.1145/3649169.3649247"},"language":"en","primary_location":{"id":"doi:10.1145/3649169.3649247","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3649169.3649247","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3649169.3649247","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Workshop on Programming Models and Applications for Multicores and Manycores","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3649169.3649247","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053854396","display_name":"Ji\u0159\u00ed Klepl","orcid":"https://orcid.org/0000-0002-2231-4073"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u00ed Klepl","raw_affiliation_strings":["Department of Distributed and Dependable Systems, Charles University Prague, Czechia"],"raw_orcid":"https://orcid.org/0000-0002-2231-4073","affiliations":[{"raw_affiliation_string":"Department of Distributed and Dependable Systems, Charles University Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012279697","display_name":"Adam \u0160melko","orcid":"https://orcid.org/0000-0001-8334-2783"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Adam \u0160melko","raw_affiliation_strings":["Department of Distributed and Dependable Systems, Charles University Prague, Czechia"],"raw_orcid":"https://orcid.org/0000-0001-8334-2783","affiliations":[{"raw_affiliation_string":"Department of Distributed and Dependable Systems, Charles University Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083789179","display_name":"Luk\u00e1\u0161 Rozsypal","orcid":"https://orcid.org/0009-0007-5252-2838"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Luk\u00e1\u0161 Rozsypal","raw_affiliation_strings":["Department of Distributed and Dependable Systems, Charles University Prague, Czechia"],"raw_orcid":"https://orcid.org/0009-0007-5252-2838","affiliations":[{"raw_affiliation_string":"Department of Distributed and Dependable Systems, Charles University Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084726014","display_name":"Martin Kruli\u0161","orcid":"https://orcid.org/0000-0002-0985-8949"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Martin Kruli\u0161","raw_affiliation_strings":["Department of Distributed and Dependable Systems, Charles University Prague, Czechia"],"raw_orcid":"https://orcid.org/0000-0002-0985-8949","affiliations":[{"raw_affiliation_string":"Department of Distributed and Dependable Systems, Charles University Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"42","last_page":"51"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9980000257492065,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8318150043487549},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6861476898193359},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5878807306289673},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.41703590750694275},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.35279083251953125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34544289112091064}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8318150043487549},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6861476898193359},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5878807306289673},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.41703590750694275},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.35279083251953125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34544289112091064}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3649169.3649247","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3649169.3649247","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3649169.3649247","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Workshop on Programming Models and Applications for Multicores and Manycores","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3649169.3649247","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3649169.3649247","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3649169.3649247","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Workshop on Programming Models and Applications for Multicores and Manycores","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.4699999988079071}],"awards":[{"id":"https://openalex.org/G6980104329","display_name":null,"funder_award_id":"260698","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G7720347574","display_name":null,"funder_award_id":"269723","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320309755","display_name":"Univerzita Karlova v Praze","ror":"https://ror.org/024d6js02"},{"id":"https://openalex.org/F4320309872","display_name":"Grantov\u00e1 Agentura, Univerzita Karlova","ror":"https://ror.org/024d6js02"},{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4392519920.pdf","grobid_xml":"https://content.openalex.org/works/W4392519920.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1480958225","https://openalex.org/W1988888548","https://openalex.org/W2102976251","https://openalex.org/W2128120785","https://openalex.org/W2515012086","https://openalex.org/W2898537641","https://openalex.org/W3016205154","https://openalex.org/W3090768939","https://openalex.org/W3162434019","https://openalex.org/W3195293013","https://openalex.org/W3214154787","https://openalex.org/W4251637954","https://openalex.org/W4313907765"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W170547082","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W2136735429"],"abstract_inverted_index":{"Many":[0],"computational":[1],"problems":[2],"consider":[3],"memory":[4,28,45,63,108],"throughput":[5],"a":[6,49,85,137],"performance":[7,53,170],"bottleneck.":[8],"The":[9,123],"problem":[10],"becomes":[11],"even":[12],"more":[13],"pronounced":[14],"in":[15],"the":[16,22,61,70,96,111,132,169,177],"case":[17],"of":[18,52,72,87,98,110,131,140,173],"parallel":[19],"platforms,":[20],"where":[21],"ratio":[23],"between":[24],"computing":[25],"elements":[26],"and":[27,171],"bandwidth":[29],"shifts":[30],"towards":[31],"computing.":[32],"Software":[33],"needs":[34],"to":[35,38,47],"be":[36,57,104],"attuned":[37],"hardware":[39],"features":[40],"like":[41],"cache":[42],"architectures":[43],"or":[44,68,116],"banks":[46],"reach":[48],"decent":[50],"level":[51],"efficiency.":[54],"This":[55],"can":[56,103],"achieved":[58],"by":[59],"selecting":[60],"right":[62],"layouts":[64,109],"for":[65,83,106],"data":[66,73,89,112,142],"structures":[67,90],"changing":[69],"order":[71],"structure":[74],"traversal.":[75],"In":[76],"this":[77],"work,":[78],"we":[79],"present":[80],"an":[81,129],"abstraction":[82],"traversing":[84],"set":[86],"regular":[88,141],"(e.g.,":[91],"multidimensional":[92],"arrays)":[93],"that":[94,135],"allows":[95],"design":[97,139],"traversal-agnostic":[99],"algorithms.":[100],"Such":[101],"algorithms":[102],"adjusted":[105],"particular":[107],"structures,":[113],"semi-automated":[114],"parallelization,":[115],"autotuning":[117],"without":[118,152],"altering":[119],"their":[120],"internal":[121],"code.":[122],"proposed":[124],"solution":[125],"was":[126],"implemented":[127,146],"as":[128],"extension":[130],"Noarr":[133],"library":[134],"simplifies":[136],"layout-agnostic":[138],"structures.":[143],"It":[144],"is":[145,158],"entirely":[147],"using":[148],"C++":[149],"template":[150],"meta-programming":[151],"any":[153],"nonstandard":[154],"dependencies,":[155],"so":[156],"it":[157],"fully":[159],"compatible":[160],"with":[161],"existing":[162],"compilers,":[163],"including":[164],"CUDA":[165],"NVCC.":[166],"We":[167],"evaluate":[168],"expressiveness":[172],"our":[174],"approach":[175],"on":[176],"Polybench-C":[178],"benchmarks.":[179]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}