{"id":"https://openalex.org/W4281660080","doi":"https://doi.org/10.1145/3534879.3534892","title":"Analysis of Federated Scheduling for Integer-Valued Workloads","display_name":"Analysis of Federated Scheduling for Integer-Valued Workloads","publication_year":2022,"publication_date":"2022-06-06","ids":{"openalex":"https://openalex.org/W4281660080","doi":"https://doi.org/10.1145/3534879.3534892"},"language":"en","primary_location":{"id":"doi:10.1145/3534879.3534892","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3534879.3534892","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3534879.3534892","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 30th International Conference on Real-Time Networks and Systems","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/3534879.3534892","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010731802","display_name":"Marion Sudvarg","orcid":"https://orcid.org/0000-0003-2318-7763"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marion Sudvarg","raw_affiliation_strings":["Department of Computer Science & Engineering, Washington University in St. Louis, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Washington University in St. Louis, USA","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064135468","display_name":"Chris Gill","orcid":"https://orcid.org/0000-0002-9229-0943"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris Gill","raw_affiliation_strings":["Department of Computer Science & Engineering, Washington University in St. Louis, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Washington University in St. Louis, USA","institution_ids":["https://openalex.org/I204465549"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204465549"],"apc_list":null,"apc_paid":null,"fwci":0.2318,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.3375702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"49","issue":null,"first_page":"12","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991000294685364,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991000294685364,"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.9952999949455261,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8990856409072876},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.7641036510467529},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7123892903327942},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6587567329406738},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5870572328567505},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5479261875152588},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5425532460212708},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.5400906205177307},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5014429092407227},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4989471435546875},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4973154366016388},{"id":"https://openalex.org/keywords/context-switch","display_name":"Context switch","score":0.46034717559814453},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.45229092240333557},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4492756128311157},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.41900983452796936},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.23133397102355957},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.2141965925693512},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.16705960035324097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13640838861465454},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12316009402275085}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8990856409072876},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.7641036510467529},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7123892903327942},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6587567329406738},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5870572328567505},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5479261875152588},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5425532460212708},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.5400906205177307},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5014429092407227},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4989471435546875},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4973154366016388},{"id":"https://openalex.org/C53833338","wikidata":"https://www.wikidata.org/wiki/Q1061424","display_name":"Context switch","level":2,"score":0.46034717559814453},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.45229092240333557},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4492756128311157},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.41900983452796936},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.23133397102355957},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2141965925693512},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.16705960035324097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13640838861465454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12316009402275085},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3534879.3534892","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3534879.3534892","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3534879.3534892","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 30th International Conference on Real-Time Networks and Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3534879.3534892","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3534879.3534892","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3534879.3534892","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 30th International Conference on Real-Time Networks and Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1324325954","display_name":null,"funder_award_id":"CNS-17653503","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4413993358","display_name":null,"funder_award_id":"CSR-1814739, CNS-17653503","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4714051121","display_name":null,"funder_award_id":"80NSSC21K1741","funder_id":"https://openalex.org/F4320306101","funder_display_name":"National Aeronautics and Space Administration"},{"id":"https://openalex.org/G5263456550","display_name":"CSR: Small: Dynamically Customizable Safety-Critical Embedded Systems","funder_award_id":"1814739","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"},{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"},{"id":"https://openalex.org/F4320322037","display_name":"Nuclear Safety and Security Commission","ror":"https://ror.org/05qk3ge34"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4281660080.pdf","grobid_xml":"https://content.openalex.org/works/W4281660080.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1217907795","https://openalex.org/W1599063719","https://openalex.org/W1910972696","https://openalex.org/W1973538756","https://openalex.org/W1993893662","https://openalex.org/W2001364911","https://openalex.org/W2012173880","https://openalex.org/W2027077493","https://openalex.org/W2052110143","https://openalex.org/W2057392949","https://openalex.org/W2060983467","https://openalex.org/W2081746076","https://openalex.org/W2092333800","https://openalex.org/W2097855867","https://openalex.org/W2100562975","https://openalex.org/W2104680817","https://openalex.org/W2105697995","https://openalex.org/W2141440050","https://openalex.org/W2165326505","https://openalex.org/W2484422940","https://openalex.org/W2487530804","https://openalex.org/W2557654849","https://openalex.org/W2620711632","https://openalex.org/W2962684887","https://openalex.org/W2964157077","https://openalex.org/W3025380722","https://openalex.org/W3034463530","https://openalex.org/W3088227491","https://openalex.org/W3170676180","https://openalex.org/W3182348664","https://openalex.org/W4233985188","https://openalex.org/W4240481045","https://openalex.org/W4256510569"],"related_works":["https://openalex.org/W1592997712","https://openalex.org/W2368587382","https://openalex.org/W2621035484","https://openalex.org/W2184693802","https://openalex.org/W2104066885","https://openalex.org/W3139960272","https://openalex.org/W2161021073","https://openalex.org/W2378385142","https://openalex.org/W3140440779","https://openalex.org/W2533764636"],"abstract_inverted_index":{"In":[0,39],"federated":[1],"scheduling":[2],"of":[3,29,88,109,134],"parallel":[4],"real-time":[5],"tasks":[6,11,52],"on":[7,16],"multiprocessor":[8],"systems,":[9],"high-utilization":[10,70,89],"are":[12],"allocated":[13],"dedicated":[14,135],"processors":[15,30],"which":[17,153],"they":[18,117],"execute":[19],"exclusively.":[20],"Several":[21],"methods":[22],"exist":[23],"for":[24,47,68,129,152],"allocating":[25,48],"a":[26,92,126],"sufficient":[27],"number":[28,133],"to":[31,51,137],"guarantee":[32],"that":[33],"each":[34,69],"task":[35],"meets":[36],"its":[37],"deadline.":[38,80],"this":[40,142,154],"paper,":[41],"we":[42],"propose":[43],"two":[44],"new":[45,104],"strategies":[46],"unit-speed":[49],"cores":[50,136],"with":[53],"integer":[54],"workload":[55],"and":[56,79,101,112,149],"deadline":[57],"values.":[58],"The":[59,81],"first":[60],"method":[61,83,128,143],"can":[62,144],"be":[63,145],"performed":[64],"in":[65,96,106,115,147],"constant":[66],"time":[67],"task,":[71],"given":[72],"the":[73,85,107],"task\u2019s":[74],"total":[75],"workload,":[76],"critical-path":[77],"length,":[78],"second":[82],"exploits":[84],"DAG":[86],"structure":[87],"tasks,":[90,139],"providing":[91],"potentially":[93],"better":[94],"schedule":[95],"pseudo-polynomial":[97],"time.":[98],"We":[99,123],"analyze":[100],"evaluate":[102],"these":[103],"bounds":[105],"context":[108],"existing":[110],"techniques,":[111],"demonstrate":[113],"that,":[114],"practice,":[116,148],"often":[118],"allocate":[119],"fewer":[120],"processor":[121],"cores.":[122],"also":[124],"present":[125],"novel":[127],"assigning":[130],"an":[131],"optimal":[132],"heavy":[138],"describe":[140],"how":[141],"used":[146],"consider":[150],"cases":[151],"is":[155],"efficient.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}