{"id":"https://openalex.org/W1985596301","doi":"https://doi.org/10.1109/hpcsim.2011.5999810","title":"Improved real-time scheduling for periodic tasks on multiprocessors","display_name":"Improved real-time scheduling for periodic tasks on multiprocessors","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W1985596301","doi":"https://doi.org/10.1109/hpcsim.2011.5999810","mag":"1985596301"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2011.5999810","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2011.5999810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on High Performance Computing & Simulation","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/A5048190485","display_name":"Prapaporn Rattanatamrong","orcid":"https://orcid.org/0000-0002-4534-6406"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Prapaporn Rattanatamrong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, USA","Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL USA#TAB#","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003181544","display_name":"J.A.B. Fortes","orcid":"https://orcid.org/0000-0001-8870-5205"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jose A. B. Fortes","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, USA","Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL USA#TAB#","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048190485"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":null,"apc_paid":null,"fwci":0.2519,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52887277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"81","last_page":"89"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","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/T10933","display_name":"Real-Time Systems Scheduling","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9907000064849854,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9855999946594238,"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.8266844749450684},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5745968818664551},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.564655065536499},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5350974798202515},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5333580374717712},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5281241536140442},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.520273745059967},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4387492537498474},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4356473386287689},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3937993049621582},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.26089173555374146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19694381952285767},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09046408534049988},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08642488718032837}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8266844749450684},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5745968818664551},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.564655065536499},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5350974798202515},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5333580374717712},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5281241536140442},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.520273745059967},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4387492537498474},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4356473386287689},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3937993049621582},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.26089173555374146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19694381952285767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09046408534049988},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08642488718032837}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2011.5999810","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2011.5999810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on High Performance Computing & Simulation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5899999737739563,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W182339613","https://openalex.org/W1594053261","https://openalex.org/W1602274988","https://openalex.org/W1963982293","https://openalex.org/W1968005108","https://openalex.org/W2006640984","https://openalex.org/W2054998117","https://openalex.org/W2056830486","https://openalex.org/W2066135202","https://openalex.org/W2101181662","https://openalex.org/W2115392544","https://openalex.org/W2125783196","https://openalex.org/W2146370746","https://openalex.org/W2159641731","https://openalex.org/W2160847564","https://openalex.org/W2277716546","https://openalex.org/W2500925871","https://openalex.org/W6635681447"],"related_works":["https://openalex.org/W2155564881","https://openalex.org/W1833217363","https://openalex.org/W2161267363","https://openalex.org/W2062808533","https://openalex.org/W1809394610","https://openalex.org/W2134658009","https://openalex.org/W1511880291","https://openalex.org/W2101300711","https://openalex.org/W2153689068","https://openalex.org/W2618418901"],"abstract_inverted_index":{"Due":[0],"to":[1,84,89,142,163,209],"increasing":[2],"numbers":[3],"of":[4,68,77,96,125,131,152,165,180,188,204,211,220],"real-time":[5,17,32],"high-performance":[6],"applications":[7,18],"like":[8],"control":[9],"systems,":[10,14],"autonomous":[11],"robots,":[12],"financial":[13],"scheduling":[15,34,123],"these":[16,97],"on":[19],"HPC":[20],"resources":[21,93],"has":[22,235],"become":[23],"an":[24,143],"important":[25],"problem.":[26],"This":[27],"paper":[28],"presents":[29],"a":[30,66,82],"novel":[31],"multiprocessor":[33],"algorithm,":[35],"called":[36],"Notional":[37],"Approximation":[38],"for":[39,48],"Balancing":[40],"Load":[41],"Residues":[42],"(NABLR),":[43],"which":[44,128],"heuristically":[45],"selects":[46],"tasks":[47,126],"execution":[49,88],"by":[50,64,170],"taking":[51],"into":[52],"account":[53],"their":[54],"residual":[55],"loads":[56],"and":[57,80,99,119,149,197,206,224],"laxities.":[58],"The":[59],"NABLR":[60,111,159,181,234],"schedule":[61,161,182],"is":[62],"created":[63],"considering":[65],"sequence":[67],"inter-arrival":[69],"intervals":[70,98],"(IAI)":[71],"between":[72],"two":[73],"consecutive":[74],"job":[75],"arrivals":[76],"any":[78],"task":[79,87,133,157],"using":[81],"heuristic":[83],"carefully":[85],"plan":[86],"fully":[90],"utilize":[91],"available":[92,136],"in":[94,121,127],"each":[95,132],"avoid":[100],"deadline":[101],"misses":[102],"as":[103,105,147,222,240],"much":[104],"possible.":[106],"Performance":[107],"evaluation":[108],"shows":[109],"that":[110],"outperforms":[112],"previously":[113,242],"known":[114,173],"efficient":[115,174,208,244],"algorithms":[116],"(i.e.":[117],"EDF":[118],"EDZL)":[120],"successfully":[122],"sets":[124,167],"total":[129],"utilization":[130],"set":[134],"equals":[135],"resource":[137],"capacity,":[138],"performing":[139],"the":[140,166,171,178,217,236],"closest":[141],"optimal":[144,189],"algorithm":[145],"such":[146],"LLREF":[148],"Pfair.":[150],"Out":[151],"2500":[153],"randomly":[154],"selected":[155],"high-utilization":[156],"sets,":[158],"can":[160],"up":[162],"97.9%":[164],"versus":[168],"63.2%":[169],"best":[172],"algorithm.":[175],"In":[176],"addition,":[177],"overheads":[179],"are":[183],"significantly":[184],"smaller":[185],"than":[186,202,232],"those":[187,203,210],"schedules":[190,213],"(on":[191],"average":[192],"80.57%":[193],"fewer":[194,199],"preemptions,":[195],"migrations":[196],"75.52%":[198],"scheduler":[200],"invocations":[201,221],"LLREF)":[205],"comparably":[207],"suboptimal":[212],"(fewer":[214],"or":[215],"nearly":[216],"same":[218,237],"number":[219],"EDZL":[223],"ASEDZL,":[225],"but":[226],"within":[227],"only":[228],"0.12%":[229],"more":[230],"preemptions/migrations":[231],"ASEDZL).":[233],"time":[238],"complexity":[239],"other":[241],"proposed":[243],"algorithms.":[245]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}