{"id":"https://openalex.org/W4404954206","doi":"https://doi.org/10.1109/sies62473.2024.10767967","title":"Budgeting Processing Graphs Under Restricted Parallelism","display_name":"Budgeting Processing Graphs Under Restricted Parallelism","publication_year":2024,"publication_date":"2024-10-23","ids":{"openalex":"https://openalex.org/W4404954206","doi":"https://doi.org/10.1109/sies62473.2024.10767967"},"language":"en","primary_location":{"id":"doi:10.1109/sies62473.2024.10767967","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sies62473.2024.10767967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 14th International Symposium on Industrial Embedded Systems (SIES)","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/A5001720743","display_name":"Zelin Tong","orcid":"https://orcid.org/0000-0002-4697-8747"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zelin Tong","raw_affiliation_strings":["University of North Carolina at Chapel Hill,Department of Computer Science"],"affiliations":[{"raw_affiliation_string":"University of North Carolina at Chapel Hill,Department of Computer Science","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114246496","display_name":"James H. Anderson","orcid":"https://orcid.org/0000-0001-7138-939X"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James H. Anderson","raw_affiliation_strings":["University of North Carolina at Chapel Hill,Department of Computer Science"],"affiliations":[{"raw_affiliation_string":"University of North Carolina at Chapel Hill,Department of Computer Science","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001720743"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":null,"apc_paid":null,"fwci":0.3755,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64800947,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9368000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9368000030517578,"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.7288615703582764},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.667852520942688},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6517372131347656},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.4121091067790985}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7288615703582764},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.667852520942688},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6517372131347656},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.4121091067790985}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sies62473.2024.10767967","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sies62473.2024.10767967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 14th International Symposium on Industrial Embedded Systems (SIES)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G353644097","display_name":null,"funder_award_id":"CPS 2038960,CPS 2038855,CNS 2151829,CPS 2333120","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2050086297","https://openalex.org/W2100226506","https://openalex.org/W3014188181","https://openalex.org/W3130041341","https://openalex.org/W4312199178","https://openalex.org/W4391583801","https://openalex.org/W4391583811","https://openalex.org/W6762860991"],"related_works":["https://openalex.org/W2023505575","https://openalex.org/W2950520577","https://openalex.org/W1501159154","https://openalex.org/W74409296","https://openalex.org/W2003935582","https://openalex.org/W2567390125","https://openalex.org/W1554644772","https://openalex.org/W305742777","https://openalex.org/W1595672120","https://openalex.org/W4230999561"],"abstract_inverted_index":{"Certifying":[0],"graph-based":[1],"workloads":[2],"on":[3,76],"multicore":[4],"systems":[5],"requires":[6],"valid":[7],"worst-case":[8],"execution":[9,24],"time":[10],"(WCET)":[11],"estimates,":[12],"which":[13],"are":[14,95],"challenging":[15],"to":[16,22,35,47,55,71,97],"obtain.":[17],"This":[18,62],"warrants":[19],"a":[20,29,32,65],"method":[21,67],"enforce":[23],"budgets":[25],"at":[26],"runtime.":[27],"Allowing":[28],"node":[30,45,78],"in":[31],"processing":[33],"graph":[34,59,91],"overrun":[36,72],"its":[37],"budget":[38],"can":[39],"delay":[40],"future":[41,77],"in-vocations":[42],"of":[43,58,89,101],"that":[44,68],"due":[46],"data":[48],"dependencies.":[49],"Conversely,":[50],"preventing":[51],"overruns":[52],"may":[53],"lead":[54],"high":[56],"rates":[57],"invocation":[60],"aborts.":[61],"paper":[63],"presents":[64],"budget-enforcement":[66],"allows":[69],"nodes":[70],"with":[73],"limited":[74],"effect":[75],"invocations.":[79],"Additionally,":[80],"analysis":[81],"is":[82],"presented":[83,103],"for":[84],"bounding":[85],"the":[86,99,102],"abort":[87],"probability":[88],"each":[90],"invocation.":[92],"Experimental":[93],"results":[94],"given":[96],"demonstrate":[98],"efficacy":[100],"method.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}