{"id":"https://openalex.org/W4200526932","doi":"https://doi.org/10.1109/espm254806.2021.00006","title":"Scalable parallel algorithm for fast computation of Transitive Closure of Graphs on Shared Memory Architectures","display_name":"Scalable parallel algorithm for fast computation of Transitive Closure of Graphs on Shared Memory Architectures","publication_year":2021,"publication_date":"2021-11-01","ids":{"openalex":"https://openalex.org/W4200526932","doi":"https://doi.org/10.1109/espm254806.2021.00006"},"language":"en","primary_location":{"id":"doi:10.1109/espm254806.2021.00006","is_oa":false,"landing_page_url":"https://doi.org/10.1109/espm254806.2021.00006","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE/ACM 6th International Workshop on Extreme Scale Programming Models and Middleware (ESPM2)","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/A5086141031","display_name":"Sarthak Patel","orcid":null},"institutions":[{"id":"https://openalex.org/I98389781","display_name":"Dhirubhai Ambani Institute of Information and Communication Technology","ror":"https://ror.org/02d5b7g69","country_code":"IN","type":"education","lineage":["https://openalex.org/I98389781"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sarthak Patel","raw_affiliation_strings":["Group in Computational Science and HPC DA-IICT, India"],"affiliations":[{"raw_affiliation_string":"Group in Computational Science and HPC DA-IICT, India","institution_ids":["https://openalex.org/I98389781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029194591","display_name":"Bhrugu Dave","orcid":null},"institutions":[{"id":"https://openalex.org/I98389781","display_name":"Dhirubhai Ambani Institute of Information and Communication Technology","ror":"https://ror.org/02d5b7g69","country_code":"IN","type":"education","lineage":["https://openalex.org/I98389781"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Bhrugu Dave","raw_affiliation_strings":["Group in Computational Science and HPC DA-IICT, India"],"affiliations":[{"raw_affiliation_string":"Group in Computational Science and HPC DA-IICT, India","institution_ids":["https://openalex.org/I98389781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088094097","display_name":"Smit Kumbhani","orcid":null},"institutions":[{"id":"https://openalex.org/I98389781","display_name":"Dhirubhai Ambani Institute of Information and Communication Technology","ror":"https://ror.org/02d5b7g69","country_code":"IN","type":"education","lineage":["https://openalex.org/I98389781"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Smit Kumbhani","raw_affiliation_strings":["Group in Computational Science and HPC DA-IICT, India"],"affiliations":[{"raw_affiliation_string":"Group in Computational Science and HPC DA-IICT, India","institution_ids":["https://openalex.org/I98389781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101456860","display_name":"Mihir Desai","orcid":"https://orcid.org/0000-0002-5796-0921"},"institutions":[{"id":"https://openalex.org/I98389781","display_name":"Dhirubhai Ambani Institute of Information and Communication Technology","ror":"https://ror.org/02d5b7g69","country_code":"IN","type":"education","lineage":["https://openalex.org/I98389781"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mihir Desai","raw_affiliation_strings":["Group in Computational Science and HPC DA-IICT, India"],"affiliations":[{"raw_affiliation_string":"Group in Computational Science and HPC DA-IICT, India","institution_ids":["https://openalex.org/I98389781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101815397","display_name":"Sidharth Kumar","orcid":"https://orcid.org/0009-0007-0418-9962"},"institutions":[{"id":"https://openalex.org/I32389192","display_name":"University of Alabama at Birmingham","ror":"https://ror.org/008s83205","country_code":"US","type":"education","lineage":["https://openalex.org/I32389192"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sidharth Kumar","raw_affiliation_strings":["University of Alabama, Birmingham, USA"],"affiliations":[{"raw_affiliation_string":"University of Alabama, Birmingham, USA","institution_ids":["https://openalex.org/I32389192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047839861","display_name":"Bhaskar Chaudhury","orcid":"https://orcid.org/0000-0001-7618-3737"},"institutions":[{"id":"https://openalex.org/I98389781","display_name":"Dhirubhai Ambani Institute of Information and Communication Technology","ror":"https://ror.org/02d5b7g69","country_code":"IN","type":"education","lineage":["https://openalex.org/I98389781"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Bhaskar Chaudhury","raw_affiliation_strings":["Group in Computational Science and HPC DA-IICT, India"],"affiliations":[{"raw_affiliation_string":"Group in Computational Science and HPC DA-IICT, India","institution_ids":["https://openalex.org/I98389781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5086141031"],"corresponding_institution_ids":["https://openalex.org/I98389781"],"apc_list":null,"apc_paid":null,"fwci":0.2303,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.52824235,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"9"},"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.9997000098228455,"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.9997000098228455,"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.9966999888420105,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/transitive-closure","display_name":"Transitive closure","score":0.9132634401321411},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8773331642150879},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.769955039024353},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7424558401107788},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.6572420001029968},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4897763729095459},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.48552632331848145},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.48503559827804565},{"id":"https://openalex.org/keywords/memory-architecture","display_name":"Memory architecture","score":0.4136175513267517},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37342050671577454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3514564633369446},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3293270468711853},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09630551934242249},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07966148853302002}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9132634401321411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8773331642150879},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.769955039024353},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7424558401107788},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.6572420001029968},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4897763729095459},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.48552632331848145},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48503559827804565},{"id":"https://openalex.org/C2779602883","wikidata":"https://www.wikidata.org/wiki/Q15544750","display_name":"Memory architecture","level":2,"score":0.4136175513267517},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37342050671577454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3514564633369446},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3293270468711853},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09630551934242249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07966148853302002},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/espm254806.2021.00006","is_oa":false,"landing_page_url":"https://doi.org/10.1109/espm254806.2021.00006","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE/ACM 6th International Workshop on Extreme Scale Programming Models and Middleware (ESPM2)","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":14,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W1559934419","https://openalex.org/W1765631655","https://openalex.org/W2007572995","https://openalex.org/W2035080386","https://openalex.org/W2092135477","https://openalex.org/W2099624270","https://openalex.org/W2105576992","https://openalex.org/W2167685423","https://openalex.org/W2545919726","https://openalex.org/W3006496683","https://openalex.org/W4238644074","https://openalex.org/W6654470729","https://openalex.org/W6729749364"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2371151875","https://openalex.org/W2136009070","https://openalex.org/W2362009423","https://openalex.org/W2391133415","https://openalex.org/W2012063573","https://openalex.org/W2123627450","https://openalex.org/W1982015164","https://openalex.org/W203725150","https://openalex.org/W4230967508"],"abstract_inverted_index":{"We":[0,46],"present":[1],"a":[2,11,60,66,93,97],"scalable":[3],"algorithm":[4],"that":[5,85],"computes":[6],"the":[7,18,31,34,48,51,75,82,88,126],"transitive":[8,89],"closure":[9,90],"of":[10,33,43,50,77,91,116],"graph":[12,67,95],"on":[13,59,96],"shared":[14,61,98],"memory":[15,62,99],"architectures":[16],"using":[17,125],"OpenMP":[19,128],"API":[20],"in":[21,134],"C++.":[22],"Two":[23],"different":[24],"parallelization":[25],"strategies":[26,102],"have":[27,110],"been":[28,38,111,120,132],"presented":[29],"and":[30,122],"performance":[32],"two":[35],"algorithms":[36],"has":[37,86,119,131],"compared":[39],"for":[40,103,107],"several":[41],"data-sets":[42,109],"varying":[44],"sizes.":[45],"demonstrate":[47],"scalability":[49],"best":[52,76],"parallel":[53],"implementation":[54,84],"up":[55],"to":[56],"176":[57],"threads":[58],"architecture,":[63],"by":[64],"producing":[65],"with":[68],"more":[69],"than":[70],"3.82":[71],"trillion":[72],"edges.":[73],"To":[74],"our":[78],"knowledge,":[79],"this":[80],"is":[81],"first":[83],"computed":[87],"such":[92],"large":[94,108],"system.":[100],"Optimization":[101],"better":[104],"cache":[105],"utilization":[106],"discussed.":[112],"The":[113],"important":[114],"issue":[115],"load":[117],"balancing":[118],"analyzed":[121],"its":[123],"mitigation":[124],"optimal":[127],"scheduling":[129],"clause":[130],"discussed":[133],"detail.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}