{"id":"https://openalex.org/W7131100837","doi":"https://doi.org/10.1109/cgo68049.2026.11395217","title":"The Parallel-Semantics Program Dependence Graph for Parallel Optimization","display_name":"The Parallel-Semantics Program Dependence Graph for Parallel Optimization","publication_year":2026,"publication_date":"2026-01-31","ids":{"openalex":"https://openalex.org/W7131100837","doi":"https://doi.org/10.1109/cgo68049.2026.11395217"},"language":null,"primary_location":{"id":"doi:10.1109/cgo68049.2026.11395217","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo68049.2026.11395217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5080709570","display_name":"Yian Su","orcid":"https://orcid.org/0000-0001-8242-0743"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yian Su","raw_affiliation_strings":["Northwestern University,Evanston,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University,Evanston,USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045515249","display_name":"Brian Homerding","orcid":"https://orcid.org/0000-0002-5455-6181"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Homerding","raw_affiliation_strings":["Northwestern University,Evanston,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University,Evanston,USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126595339","display_name":"Haocheng Gao","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haocheng Gao","raw_affiliation_strings":["Northwestern University,Evanston,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University,Evanston,USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038767830","display_name":"Federico Sossai","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Federico Sossai","raw_affiliation_strings":["Northwestern University,Evanston,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University,Evanston,USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067135457","display_name":"Yebin Chon","orcid":"https://orcid.org/0000-0003-0765-7913"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yebin Chon","raw_affiliation_strings":["Princeton University,Princeton,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University,Princeton,USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008319090","display_name":"David I. August","orcid":"https://orcid.org/0000-0003-3327-1803"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David I. August","raw_affiliation_strings":["Princeton University,Princeton,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University,Princeton,USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084389543","display_name":"Simone Campanoni","orcid":"https://orcid.org/0000-0001-9806-7016"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Simone Campanoni","raw_affiliation_strings":["Northwestern University,Evanston,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University,Evanston,USA","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"348","last_page":"361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.1607999950647354,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.1607999950647354,"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"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.13189999759197235,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.08250000327825546,"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/compiler","display_name":"Compiler","score":0.6938999891281128},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5773000121116638},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5740000009536743},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.5440999865531921},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5415999889373779},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.49889999628067017},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.48969998955726624},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.4165000021457672},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.40540000796318054}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8517000079154968},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6938999891281128},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6601999998092651},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5773000121116638},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5740000009536743},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.5440999865531921},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5415999889373779},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5030999779701233},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.49889999628067017},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.48969998955726624},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.4165000021457672},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.40540000796318054},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.3903999924659729},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.38530001044273376},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35190001130104065},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.34389999508857727},{"id":"https://openalex.org/C137364921","wikidata":"https://www.wikidata.org/wiki/Q27929394","display_name":"Parallel programming model","level":3,"score":0.3276999890804291},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2955000102519989},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C2776834041","wikidata":"https://www.wikidata.org/wiki/Q25346349","display_name":"Execution model","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.28060001134872437},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.2685000002384186},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cgo68049.2026.11395217","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo68049.2026.11395217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.40342363715171814}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1490084794","https://openalex.org/W1506062870","https://openalex.org/W1525663018","https://openalex.org/W1529761535","https://openalex.org/W1578042273","https://openalex.org/W1972174903","https://openalex.org/W1983545421","https://openalex.org/W1986804682","https://openalex.org/W1993621349","https://openalex.org/W2013433526","https://openalex.org/W2024929322","https://openalex.org/W2032401773","https://openalex.org/W2095951614","https://openalex.org/W2097717378","https://openalex.org/W2098153911","https://openalex.org/W2148049665","https://openalex.org/W2163496769","https://openalex.org/W2167089275","https://openalex.org/W2508222108","https://openalex.org/W2581356531","https://openalex.org/W2747413550","https://openalex.org/W2786332448","https://openalex.org/W2995576800","https://openalex.org/W2999016616","https://openalex.org/W3012385591","https://openalex.org/W3033603793","https://openalex.org/W3137184863","https://openalex.org/W3149553891","https://openalex.org/W4220780061","https://openalex.org/W4234858060","https://openalex.org/W4243245318","https://openalex.org/W4244257941","https://openalex.org/W4256554854","https://openalex.org/W4321446066","https://openalex.org/W4394998948"],"related_works":[],"abstract_inverted_index":{"Modern":[0],"shared-memory":[1],"parallel":[2,15,43,94,125,136,147],"programming":[3],"models,":[4],"such":[5],"as":[6],"OpenMP":[7],"and":[8,25,61,103,133,154],"Cilk,":[9],"enable":[10],"developers":[11],"to":[12],"encode":[13],"a":[14,65],"execution":[16,44,126,137,148],"plan":[17,102,149],"within":[18],"their":[19],"code.":[20],"Existing":[21],"compilers,":[22],"including":[23],"Clang":[24],"GCC,":[26],"directly":[27],"lower":[28],"or":[29],"add":[30],"additional":[31],"compatible":[32],"parallelism":[33],"on":[34,157],"top":[35],"of":[36,58,83,112,123],"the":[37,51,56,75,84,99,104,110,144,166],"developers\u2019":[38],"plan.":[39],"However,":[40],"when":[41],"better":[42,66,135],"plans":[45,127,138],"exist":[46],"that":[47,90],"are":[48],"incompatible":[49],"with":[50,64],"original":[52,101,146],"plan,":[53],"compilers":[54],"lack":[55],"capability":[57],"disregarding":[59],"it":[60,63],"replacing":[62],"one.":[67],"To":[68,108],"address":[69],"this":[70,72,114],"problem,":[71],"paper":[73,115],"introduces":[74,117],"parallel-semantics":[76],"program":[77,85],"dependence":[78,86],"graph":[79,87],"(PS-PDG),":[80],"an":[81,119],"extension":[82],"(PDG)":[88],"abstraction":[89],"can":[91],"simultaneously":[92],"represent":[93],"semantics":[95],"derived":[96],"from":[97,165],"both":[98],"developer\u2019s":[100,145],"compiler\u2019s":[105],"own":[106],"analysis.":[107],"demonstrate":[109],"power":[111],"PS-PDG,":[113,141],"also":[116],"GINO,":[118],"LLVM-based":[120],"compiler":[121],"capable":[122],"optimizing":[124],"using":[128],"PS-PDG.":[129],"Through":[130],"exploring,":[131],"reasoning,":[132],"implementing":[134],"unlocked":[139],"by":[140,150,155],"GINO":[142],"outperforms":[143],"46.6%":[151],"at":[152],"most,":[153],"15%":[156],"average":[158],"over":[159],"56":[160],"cores":[161],"across":[162],"8":[163],"benchmarks":[164],"NAS":[167],"benchmark":[168],"suite.":[169]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-02-24T00:00:00"}