{"id":"https://openalex.org/W4321021038","doi":"https://doi.org/10.1109/tc.2023.3244632","title":"A New Federated Scheduling Algorithm for Arbitrary-Deadline DAG Tasks","display_name":"A New Federated Scheduling Algorithm for Arbitrary-Deadline DAG Tasks","publication_year":2023,"publication_date":"2023-02-16","ids":{"openalex":"https://openalex.org/W4321021038","doi":"https://doi.org/10.1109/tc.2023.3244632"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2023.3244632","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2023.3244632","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-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/A5005190136","display_name":"Fei Guan","orcid":"https://orcid.org/0000-0003-3791-7093"},"institutions":[{"id":"https://openalex.org/I47689461","display_name":"Northeast Forestry University","ror":"https://ror.org/02yxnh564","country_code":"CN","type":"education","lineage":["https://openalex.org/I47689461"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Fei Guan","raw_affiliation_strings":["Department of Computer Science and Technology, Northeast Forestry University, Harbin, Heilongjiang, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Northeast Forestry University, Harbin, Heilongjiang, China","institution_ids":["https://openalex.org/I47689461"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032990215","display_name":"Long Peng","orcid":"https://orcid.org/0000-0002-8345-6278"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Long Peng","raw_affiliation_strings":["School of Computer, National University of Defense Technology, Changsha, Hunan, China"],"affiliations":[{"raw_affiliation_string":"School of Computer, National University of Defense Technology, Changsha, Hunan, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050807214","display_name":"Jiaqing Qiao","orcid":"https://orcid.org/0000-0003-1906-4883"},"institutions":[{"id":"https://openalex.org/I4210161462","display_name":"Heilongjiang Institute of Technology","ror":"https://ror.org/05x0m9n95","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210161462"]},{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiaqing Qiao","raw_affiliation_strings":["School of Electronic and Information Engineering, Harbin Institute of Technology, Harbin, Heilongjiang, China"],"affiliations":[{"raw_affiliation_string":"School of Electronic and Information Engineering, Harbin Institute of Technology, Harbin, Heilongjiang, China","institution_ids":["https://openalex.org/I4210161462","https://openalex.org/I204983213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005190136"],"corresponding_institution_ids":["https://openalex.org/I47689461"],"apc_list":null,"apc_paid":null,"fwci":4.2723,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.94788473,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"72","issue":"8","first_page":"2264","last_page":"2277"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991999864578247,"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.9991999864578247,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9984999895095825,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8891427516937256},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.8141262531280518},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6305174231529236},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.615706741809845},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5547241568565369},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.550811231136322},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5342833995819092},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.49944639205932617},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4319721460342407},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4290889501571655},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.42577892541885376},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3830481767654419},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.36735716462135315},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09930917620658875},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09102636575698853}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8891427516937256},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.8141262531280518},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6305174231529236},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.615706741809845},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5547241568565369},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.550811231136322},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5342833995819092},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.49944639205932617},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4319721460342407},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4290889501571655},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.42577892541885376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3830481767654419},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.36735716462135315},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09930917620658875},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09102636575698853},{"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.1109/tc.2023.3244632","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2023.3244632","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G354059379","display_name":null,"funder_award_id":"62202093","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1599063719","https://openalex.org/W1625622590","https://openalex.org/W1968005108","https://openalex.org/W1977289603","https://openalex.org/W2037468202","https://openalex.org/W2050086297","https://openalex.org/W2081746076","https://openalex.org/W2104680817","https://openalex.org/W2156316099","https://openalex.org/W2158002367","https://openalex.org/W2165326505","https://openalex.org/W2168253093","https://openalex.org/W2256337618","https://openalex.org/W2896562548","https://openalex.org/W2946406471","https://openalex.org/W2962684887","https://openalex.org/W2964157077","https://openalex.org/W2997221951","https://openalex.org/W3114999473","https://openalex.org/W3199513229","https://openalex.org/W4200096706","https://openalex.org/W4240481045"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1545991362","https://openalex.org/W2167574351","https://openalex.org/W2184166483","https://openalex.org/W3184267879","https://openalex.org/W2545511463","https://openalex.org/W2404383452","https://openalex.org/W2245286458","https://openalex.org/W2076947091","https://openalex.org/W177179517"],"abstract_inverted_index":{"A":[0],"parallel":[1],"task":[2,106,123,156],"can":[3,64],"always":[4],"be":[5],"modelled":[6,18,28],"as":[7,19,29],"a":[8,33,59,108],"directed":[9],"acyclic":[10],"graph":[11],"(DAG),":[12],"where":[13],"sequential":[14],"instruction":[15],"blocks":[16],"are":[17,27,51,58,98,189],"vertices":[20],"and":[21,92],"data":[22],"dependencies":[23],"or":[24],"resource":[25],"constraints":[26],"edges.":[30],"We":[31,97],"propose":[32],"new":[34],"federated":[35,84,136],"scheduling":[36,56,95,103,137],"algorithm":[37,131,179],"for":[38],"arbitrary-deadline":[39],"sporadic":[40],"DAG":[41,49,67],"tasks,":[42,129],"assuming":[43],"that":[44,63,140,177],"the":[45,81,89,94,102,122,154,165,184],"exact":[46,185],"structures":[47,186],"of":[48,61,83,104,149,187],"tasks":[50,68,188],"unknown":[52,190],"before":[53,191],"runtime.":[54,192],"Federated":[55],"algorithms":[57,62,138,182],"class":[60],"efficiently":[65],"schedule":[66],"by":[69,121,153,168],"assigning":[70],"several":[71],"processors":[72,144],"exclusively":[73],"to":[74,145,163],"each":[75,146],"task.":[76],"Existing":[77],"studies":[78],"have":[79],"shown":[80],"advantages":[82],"scheduling,":[85],"which":[86],"include":[87],"increasing":[88],"analytical":[90,166],"schedulability":[91,167],"minimising":[93],"overhead.":[96],"particularly":[99],"focused":[100],"on":[101],"any":[105],"with":[107],"deadline":[109],"longer":[110],"than":[111],"its":[112],"release":[113],"period;":[114],"in":[115,139],"this":[116],"case,":[117],"multiple":[118],"jobs":[119,151],"generated":[120],"could":[124],"run":[125],"concurrently.":[126],"For":[127],"such":[128],"our":[130,178],"is":[132,162],"different":[133],"from":[134],"most":[135],"it":[141],"assigns":[142],"dedicated":[143],"job":[147],"instead":[148],"letting":[150],"released":[152],"same":[155],"share":[157],"processors.":[158],"The":[159,173],"main":[160],"idea":[161],"increase":[164],"avoiding":[169],"interference":[170],"between":[171],"jobs.":[172],"simulation":[174],"results":[175],"show":[176],"outperforms":[180],"existing":[181],"when":[183]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2}],"updated_date":"2026-03-21T08:13:44.787528","created_date":"2025-10-10T00:00:00"}