{"id":"https://openalex.org/W4384698910","doi":"https://doi.org/10.1145/3597635.3598026","title":"Static Prediction of Parallel Computation Graphs (Abstract)","display_name":"Static Prediction of Parallel Computation Graphs (Abstract)","publication_year":2023,"publication_date":"2023-07-18","ids":{"openalex":"https://openalex.org/W4384698910","doi":"https://doi.org/10.1145/3597635.3598026"},"language":"en","primary_location":{"id":"doi:10.1145/3597635.3598026","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597635.3598026","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598026","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598026","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009393339","display_name":"Stefan K. Muller","orcid":"https://orcid.org/0000-0002-3210-9727"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Stefan K. Muller","raw_affiliation_strings":["Illinois Institute of Technology, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Illinois Institute of Technology, Chicago, IL, USA","institution_ids":["https://openalex.org/I180949307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009393339"],"corresponding_institution_ids":["https://openalex.org/I180949307"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09143554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"21","last_page":"22"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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/computer-science","display_name":"Computer science","score":0.8377357721328735},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.707689642906189},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6165521740913391},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47724127769470215},{"id":"https://openalex.org/keywords/bulk-synchronous-parallel","display_name":"Bulk synchronous parallel","score":0.46243369579315186},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.45912396907806396},{"id":"https://openalex.org/keywords/concurrent-computing","display_name":"Concurrent computing","score":0.45266351103782654},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.420987993478775},{"id":"https://openalex.org/keywords/parallel-programming-model","display_name":"Parallel programming model","score":0.42027032375335693},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.3749619126319885},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.3616099953651428},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.3389723300933838},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25702136754989624},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.18118777871131897}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8377357721328735},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.707689642906189},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6165521740913391},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47724127769470215},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.46243369579315186},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.45912396907806396},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.45266351103782654},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.420987993478775},{"id":"https://openalex.org/C137364921","wikidata":"https://www.wikidata.org/wiki/Q27929394","display_name":"Parallel programming model","level":3,"score":0.42027032375335693},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.3749619126319885},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.3616099953651428},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3389723300933838},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25702136754989624},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.18118777871131897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3597635.3598026","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597635.3598026","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598026","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3597635.3598026","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597635.3598026","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598026","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1465477919","display_name":null,"funder_award_id":"CCF-2107289","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4704430651","display_name":"Collaborative Research: SHF: Medium: Responsive Parallelism for Interactive Applications: Theory and Practice","funder_award_id":"2107289","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4384698910.pdf"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W2001673593","https://openalex.org/W2024929322","https://openalex.org/W2056714230","https://openalex.org/W2087875803","https://openalex.org/W2130566259","https://openalex.org/W2135490589","https://openalex.org/W2144249474","https://openalex.org/W2998338832","https://openalex.org/W4205117926"],"related_works":["https://openalex.org/W2360699736","https://openalex.org/W2070311730","https://openalex.org/W2070732426","https://openalex.org/W2535994930","https://openalex.org/W34352843","https://openalex.org/W2162188180","https://openalex.org/W2171732274","https://openalex.org/W1586380695","https://openalex.org/W173903132","https://openalex.org/W2098724627"],"abstract_inverted_index":{"Many":[0],"results":[1],"in":[2,15],"the":[3,18,34,75,81,89,101,106,112,120,129,143,165,170,200,224,268],"theory":[4],"of":[5,17,22,36,64,74,80,105,119,138,157,202,220,261,267],"parallel":[6,19,37,94,174],"scheduling,":[7],"dating":[8],"back":[9],"to":[10,48,56,69,72,91,193,235],"Brent's":[11],"Theorem,":[12],"are":[13,45,253],"expressed":[14],"terms":[16],"dependency":[20],"structure":[21],"a":[23,28,59,78,93,115,125,135,139,160,203,208,217,228,257],"program":[24,40,82,95,229],"as":[25,77,167,177,184],"represented":[26,255],"by":[27,256],"Directed":[29],"Acyclic":[30],"Graph":[31],"(DAG).":[32],"In":[33,62,122,172],"world":[35],"and":[38,53,103,188,197,227],"concurrent":[39],"analysis,":[41],"such":[42,176,183],"DAG":[43,76,113,126,166],"models":[44,128],"also":[46],"used":[47],"study":[49],"deadlock,":[50],"data":[51],"races,":[52],"priority":[54],"inversions,":[55],"name":[57],"just":[58],"few":[60],"examples.":[61],"all":[63,151,264],"these":[65,190],"cases,":[66],"it":[67,168],"tends":[68],"be":[70,194],"convenient":[71],"think":[73],"model":[79],"itself-we":[83],"might":[84,146],"say,":[85],"for":[86],"example,":[87,207],"that":[88,111,163,179],"time":[90],"run":[92],"on":[96,100,199,223,237,242,245],"P":[97],"processors":[98],"depends":[99],"work":[102],"span":[104],"program's":[107],"DAG.":[108],"This":[109],"assumes":[110],"is":[114],"static,":[116],"predictable":[117],"property":[118],"program.":[121,140,171,269],"reality,":[123],"however,":[124],"typically":[127],"runtime":[130],"relationships":[131],"between":[132],"threads":[133,238,243],"during":[134],"particular":[136,204],"execution":[137,149],"To":[141],"obtain":[142],"DAG,":[144],"one":[145],"simulate":[147],"an":[148],"(or":[150],"possible":[152,265],"executions)":[153],"using":[154,212],"some":[155],"form":[156],"cost":[158],"semantics,":[159],"dynamic":[161,196],"semantics":[162],"produces":[164],"executes":[169],"fine-grained":[173],"programs,":[175],"those":[178],"result":[180],"from":[181],"constructs":[182],"fork/join,":[185],"spawn/sync,":[186],"async/finish,":[187],"futures,":[189],"DAGs":[191],"tend":[192],"especially":[195],"dependent":[198],"features":[201],"execution.":[205],"For":[206],"divide-and-conquer":[209],"algorithm":[210],"implemented":[211],"fork/join":[213],"parallelism":[214],"may":[215],"divide":[216],"certain":[218],"number":[219],"times":[221],"depending":[222,244],"input":[225],"size,":[226],"written":[230],"with":[231],"futures":[232],"can":[233],"choose":[234],"wait":[236,241],"or":[239],"not":[240],"conditions":[246],"available":[247],"only":[248],"at":[249],"runtime.":[250],"Such":[251],"programs":[252],"best":[254],"(possibly":[258],"infinite)":[259],"family":[260],"DAGs,":[262],"representing":[263],"executions":[266]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}