{"id":"https://openalex.org/W2946406471","doi":"https://doi.org/10.23919/date.2019.8714859","title":"Analyzing GEDF Scheduling for Parallel Real-Time Tasks with Arbitrary Deadlines","display_name":"Analyzing GEDF Scheduling for Parallel Real-Time Tasks with Arbitrary Deadlines","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2946406471","doi":"https://doi.org/10.23919/date.2019.8714859","mag":"2946406471"},"language":"en","primary_location":{"id":"doi:10.23919/date.2019.8714859","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2019.8714859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Design, Automation & Test in Europe Conference & Exhibition (DATE)","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/A5051642924","display_name":"Xu Jiang","orcid":"https://orcid.org/0000-0003-2675-2895"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Xu Jiang","raw_affiliation_strings":["The Hong Kong Polytechnic University, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The Hong Kong Polytechnic University, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002245169","display_name":"Nan Guan","orcid":"https://orcid.org/0000-0003-3775-911X"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Nan Guan","raw_affiliation_strings":["The Hong Kong Polytechnic University, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The Hong Kong Polytechnic University, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060042554","display_name":"Di Liu","orcid":"https://orcid.org/0000-0002-4365-2768"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Di Liu","raw_affiliation_strings":["Yunnan University, China"],"affiliations":[{"raw_affiliation_string":"Yunnan University, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038598144","display_name":"Weichen Liu","orcid":"https://orcid.org/0000-0001-9348-4662"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Weichen Liu","raw_affiliation_strings":["Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5051642924"],"corresponding_institution_ids":["https://openalex.org/I14243506"],"apc_list":null,"apc_paid":null,"fwci":1.4446,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.80250457,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1537","last_page":"1542"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9993000030517578,"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.9993000030517578,"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.9955999851226807,"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.9947999715805054,"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.8935774564743042},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7520305514335632},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7098889946937561},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.598163902759552},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5960568189620972},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5826737880706787},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48356935381889343},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4605850577354431},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4466893970966339},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4347369074821472},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.4321081042289734},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.383556991815567},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.25609368085861206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2057328224182129},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.151667058467865},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09681537747383118}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8935774564743042},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7520305514335632},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7098889946937561},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.598163902759552},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5960568189620972},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5826737880706787},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48356935381889343},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4605850577354431},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4466893970966339},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4347369074821472},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.4321081042289734},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.383556991815567},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.25609368085861206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2057328224182129},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.151667058467865},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09681537747383118},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/date.2019.8714859","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2019.8714859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Design, Automation & Test in Europe Conference & Exhibition (DATE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1525605957","https://openalex.org/W1599063719","https://openalex.org/W1917241563","https://openalex.org/W1977289603","https://openalex.org/W1987228334","https://openalex.org/W1992715100","https://openalex.org/W2011039300","https://openalex.org/W2027934431","https://openalex.org/W2050086297","https://openalex.org/W2081746076","https://openalex.org/W2090822559","https://openalex.org/W2090902997","https://openalex.org/W2097855867","https://openalex.org/W2104680817","https://openalex.org/W2124888010","https://openalex.org/W2156316099","https://openalex.org/W2165326505","https://openalex.org/W2568058857","https://openalex.org/W2613108601","https://openalex.org/W2964157077","https://openalex.org/W4240481045","https://openalex.org/W4256510569","https://openalex.org/W6631722374"],"related_works":["https://openalex.org/W2119707973","https://openalex.org/W4247346144","https://openalex.org/W4294167391","https://openalex.org/W2232116431","https://openalex.org/W2890277969","https://openalex.org/W4200080306","https://openalex.org/W1632514893","https://openalex.org/W2980563077","https://openalex.org/W2021072488","https://openalex.org/W2119358936"],"abstract_inverted_index":{"Real-time":[0],"and":[1,159],"embedded":[2],"systems":[3],"are":[4,155],"shifting":[5],"from":[6],"single-core":[7],"to":[8,17,50,72,82,85,158],"multi-core":[9],"processors,":[10],"on":[11,31],"which":[12,78,124],"software":[13],"must":[14],"be":[15,73],"parallelized":[16],"fully":[18],"utilize":[19],"the":[20,60,67,76,95,128,162,169],"computation":[21],"capacity":[22,141],"of":[23,34,45,63,97,119,164],"hardware.":[24],"Recently":[25],"much":[26],"work":[27,58],"has":[28],"been":[29],"done":[30],"real-time":[32],"scheduling":[33,103,118,171],"parallel":[35,106],"tasks":[36,49,107,167],"modeled":[37],"as":[38],"directed":[39],"acyclic":[40],"graphs":[41],"(DAG).":[42],"However,":[43],"most":[44],"these":[46],"studies":[47],"assume":[48],"have":[51],"implicit":[52],"or":[53],"constrained":[54],"deadlines.":[55,110],"Much":[56],"less":[57],"considered":[59],"general":[61,131],"case":[62,163],"arbitrary":[64,109],"deadlines":[65],"(i.e.,":[66],"relative":[68],"deadline":[69],"is":[70,79,149],"allowed":[71],"larger":[74],"than":[75],"period),":[77],"more":[80],"difficult":[81],"analyze":[83],"due":[84],"intra-task":[86],"interference":[87],"among":[88],"jobs.":[89],"In":[90],"this":[91],"paper,":[92],"we":[93],"study":[94],"analysis":[96,114,153],"Global":[98],"Earliest":[99],"Deadline":[100],"First":[101],"(GEDF)":[102],"for":[104,116],"DAG":[105,122,166],"with":[108,161],"We":[111],"develop":[112],"new":[113],"techniques":[115,154],"GEDF":[117],"a":[120,139],"single":[121],"task,":[123],"not":[125],"only":[126],"outperform":[127],"state-of-the-art":[129],"in":[130],"evidenced":[132],"by":[133],"empirical":[134],"evaluation,":[135],"but":[136],"also":[137,156],"guarantee":[138],"better":[140],"augmentation":[142],"bound":[143],"2.41":[144],"(the":[145],"best":[146],"known":[147],"result":[148],"2.5).":[150],"The":[151],"proposed":[152],"extended":[157],"evaluated":[160],"multiple":[165],"using":[168],"federated":[170],"approach.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}