{"id":"https://openalex.org/W3199513229","doi":"https://doi.org/10.1109/tc.2021.3111512","title":"A Fluid Scheduling Algorithm for DAG Tasks with Constrained or Arbitrary Deadlines","display_name":"A Fluid Scheduling Algorithm for DAG Tasks with Constrained or Arbitrary Deadlines","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3199513229","doi":"https://doi.org/10.1109/tc.2021.3111512","mag":"3199513229"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2021.3111512","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2021.3111512","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":["Computer Science and Technology, Northeast Forestry University, 47820 Harbin, Heilongjiang, China, (e-mail: fei.guan@nefu.edu.cn)"],"affiliations":[{"raw_affiliation_string":"Computer Science and Technology, Northeast Forestry University, 47820 Harbin, Heilongjiang, China, (e-mail: fei.guan@nefu.edu.cn)","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":["Computer, National University of Defense Technology, 58294 Changsha, Hunan, China, (e-mail: penglong@nudt.edu.cn)"],"affiliations":[{"raw_affiliation_string":"Computer, National University of Defense Technology, 58294 Changsha, Hunan, China, (e-mail: penglong@nudt.edu.cn)","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":["Electronics and Information Engineering, Harbin Institute of Technology, 47822 Harbin, Heilongjiang, China, (e-mail: qiaojiaqing@hit.edu.cn)"],"affiliations":[{"raw_affiliation_string":"Electronics and Information Engineering, Harbin Institute of Technology, 47822 Harbin, Heilongjiang, China, (e-mail: qiaojiaqing@hit.edu.cn)","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":1.612,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.82975702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9987000226974487,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"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.7815290093421936},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6938806772232056},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.637742280960083},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5497739911079407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5102412700653076},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5014629364013672},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4918961524963379},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46529635787010193},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.46384480595588684},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4618889391422272},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.4138389229774475},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3484141230583191},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29384005069732666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20203712582588196},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.06677457690238953},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.059646785259246826}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7815290093421936},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6938806772232056},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.637742280960083},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5497739911079407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5102412700653076},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5014629364013672},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4918961524963379},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46529635787010193},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.46384480595588684},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4618889391422272},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4138389229774475},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3484141230583191},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29384005069732666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20203712582588196},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.06677457690238953},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.059646785259246826},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2021.3111512","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2021.3111512","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.5899999737739563,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G7298992733","display_name":null,"funder_award_id":"2572019BH04","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"}],"funders":[{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1599063719","https://openalex.org/W1625622590","https://openalex.org/W1977289603","https://openalex.org/W2010226155","https://openalex.org/W2015293407","https://openalex.org/W2030429378","https://openalex.org/W2030483977","https://openalex.org/W2037468202","https://openalex.org/W2037702235","https://openalex.org/W2050086297","https://openalex.org/W2056830486","https://openalex.org/W2074573349","https://openalex.org/W2081746076","https://openalex.org/W2090822559","https://openalex.org/W2095126271","https://openalex.org/W2104338317","https://openalex.org/W2104680817","https://openalex.org/W2105697995","https://openalex.org/W2156316099","https://openalex.org/W2168253093","https://openalex.org/W2236640451","https://openalex.org/W2256337618","https://openalex.org/W2896562548","https://openalex.org/W2917461237","https://openalex.org/W2946406471","https://openalex.org/W2962939166","https://openalex.org/W2972968925","https://openalex.org/W2997221951","https://openalex.org/W2999593010","https://openalex.org/W3022664842","https://openalex.org/W3099845448","https://openalex.org/W3114999473","https://openalex.org/W4240481045"],"related_works":["https://openalex.org/W2167574351","https://openalex.org/W4300092030","https://openalex.org/W2184166483","https://openalex.org/W3184267879","https://openalex.org/W1545991362","https://openalex.org/W2076947091","https://openalex.org/W2172075652","https://openalex.org/W2245286458","https://openalex.org/W2404383452","https://openalex.org/W2545511463"],"abstract_inverted_index":{"A":[0],"number":[1,91],"of":[2,19,75,92,99,122,132,145,178,186],"scheduling":[3,23,47,52,79,133,160,181],"algorithms":[4,182],"have":[5,31],"been":[6,157],"proposed":[7,68],"for":[8,159],"real-time":[9],"parallel":[10],"tasks":[11,25,34,58,82,136,163],"modeled":[12],"as":[13],"Directed":[14],"Acyclic":[15],"Graphs":[16],"(DAGs).":[17],"Many":[18],"them":[20],"focus":[21],"on":[22,50],"DAG":[24,33,57,81,135,162],"with":[26,35,59,83,137,164],"implicit":[27],"deadlines.":[28,40,63],"Fewer":[29],"studies":[30],"considered":[32],"constrained":[36,60,84],"deadlines":[37,138,165],"or":[38,61],"arbitrary":[39,62],"In":[41],"this":[42,148],"study,":[43],"we":[44,55],"propose":[45],"a":[46,71,118],"strategy":[48],"based":[49],"fluid":[51],"theory":[53],"and":[54,94],"target":[56],"We":[64,114],"prove":[65,116],"that":[66,117,155,172],"the":[67,90,96,109,130,143,150,176,179,184],"algorithm":[69,128,174],"has":[70,156],"capacity":[72,119,152],"augmentation":[73,120,153],"bound":[74,121,154],"1/2(1++((1+)<sup>":[76],"2</sup>4/m))":[77],"when":[78],"multiple":[80,134,161],"deadlines,":[85],"in":[86,129,183],"which":[87],"m":[88],"is":[89,95,106,124,149],"processors":[93],"maximum":[97],"ratio":[98],"task":[100,188],"period":[101],"to":[102],"deadline.":[103],"This":[104],"value":[105],"lower":[107],"than":[108,140,167],"current":[110],"best":[111,144],"result":[112],"+2((1+-1/m)(1-1/m)).":[113],"also":[115],"1/2(1+2+((1+2)<sup>2</sup>42/m))":[123],"guaranteed":[125],"by":[126],"our":[127,146,173],"case":[131],"greater":[139,166],"periods.":[141,168],"To":[142],"knowledge,":[147],"first":[151],"proven":[158],"Our":[169],"experiments":[170],"show":[171],"outperforms":[175],"state":[177],"art":[180],"percentage":[185],"schedulable":[187],"sets.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}