{"id":"https://openalex.org/W3091362456","doi":"https://doi.org/10.1109/access.2020.3024692","title":"Flow Network Models for Online Scheduling Real-Time Tasks on Multiprocessors","display_name":"Flow Network Models for Online Scheduling Real-Time Tasks on Multiprocessors","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3091362456","doi":"https://doi.org/10.1109/access.2020.3024692","mag":"3091362456"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.3024692","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3024692","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09199814.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09199814.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024592528","display_name":"Hyeonjoong Cho","orcid":"https://orcid.org/0000-0003-1487-895X"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]},{"id":"https://openalex.org/I28777354","display_name":"Sejong University","ror":"https://ror.org/00aft1q37","country_code":"KR","type":"education","lineage":["https://openalex.org/I28777354"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyeonjoong Cho","raw_affiliation_strings":["Korea University, Sejong, South Korea"],"raw_orcid":"https://orcid.org/0000-0003-1487-895X","affiliations":[{"raw_affiliation_string":"Korea University, Sejong, South Korea","institution_ids":["https://openalex.org/I197347611","https://openalex.org/I28777354"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054946593","display_name":"Arvind Easwaran","orcid":"https://orcid.org/0000-0002-9628-3847"},"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":"Arvind Easwaran","raw_affiliation_strings":["School of Computer Engineering, Nanyang Technological University, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-9628-3847","affiliations":[{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.4508,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64554243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":null,"first_page":"172136","last_page":"172151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994999766349792,"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.9994999766349792,"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.991100013256073,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.982200026512146,"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.8371535539627075},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6151018142700195},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5736035108566284},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5666869878768921},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5648461580276489},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5573213696479797},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5545870661735535},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5480140447616577},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5178909301757812},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4917626678943634},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4821333587169647},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.48173192143440247},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4798142910003662},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.449863463640213},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.44890421628952026},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4407198429107666},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3709205389022827},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3679500222206116},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31189459562301636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29107218980789185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09881308674812317}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8371535539627075},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6151018142700195},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5736035108566284},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5666869878768921},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5648461580276489},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5573213696479797},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5545870661735535},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5480140447616577},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5178909301757812},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4917626678943634},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4821333587169647},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.48173192143440247},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4798142910003662},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.449863463640213},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.44890421628952026},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4407198429107666},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3709205389022827},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3679500222206116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31189459562301636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29107218980789185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09881308674812317},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/access.2020.3024692","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3024692","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09199814.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:3bf50be579ce49bc919ffca94fd692c6","is_oa":true,"landing_page_url":"https://doaj.org/article/3bf50be579ce49bc919ffca94fd692c6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 8, Pp 172136-172151 (2020)","raw_type":"article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/145816","is_oa":true,"landing_page_url":"https://hdl.handle.net/10356/145816","pdf_url":null,"source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":{"id":"doi:10.1109/access.2020.3024692","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3024692","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09199814.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4032354975","display_name":null,"funder_award_id":"NRF-2018R1D1A1B07049078","funder_id":"https://openalex.org/F4320321408","funder_display_name":"Ministry of Education"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320321408","display_name":"Ministry of Education","ror":"https://ror.org/01p262204"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3091362456.pdf","grobid_xml":"https://content.openalex.org/works/W3091362456.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W586095647","https://openalex.org/W940012988","https://openalex.org/W1921705579","https://openalex.org/W1968005108","https://openalex.org/W1977545325","https://openalex.org/W1980289219","https://openalex.org/W1983383464","https://openalex.org/W2001274023","https://openalex.org/W2012059473","https://openalex.org/W2016946898","https://openalex.org/W2030483977","https://openalex.org/W2037468202","https://openalex.org/W2037702235","https://openalex.org/W2043507584","https://openalex.org/W2053044043","https://openalex.org/W2056830486","https://openalex.org/W2058817479","https://openalex.org/W2066415966","https://openalex.org/W2071701263","https://openalex.org/W2084224084","https://openalex.org/W2101144036","https://openalex.org/W2104338317","https://openalex.org/W2114149665","https://openalex.org/W2123806189","https://openalex.org/W2128426273","https://openalex.org/W2133768306","https://openalex.org/W2137784941","https://openalex.org/W2147133278","https://openalex.org/W2148960429","https://openalex.org/W2156036190","https://openalex.org/W2157407983","https://openalex.org/W2158343672","https://openalex.org/W2169221343","https://openalex.org/W2170091282","https://openalex.org/W6679379070"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W2245286458","https://openalex.org/W3184267879","https://openalex.org/W2545511463","https://openalex.org/W2106332846","https://openalex.org/W2172075652","https://openalex.org/W2167842822","https://openalex.org/W2372879566"],"abstract_inverted_index":{"We":[0,153,223],"consider":[1],"the":[2,8,15,28,34,74,92,97,103,109,116,120,138,143,149,156,164,169,183,212,217,220,230,234,240,255],"flow":[3,16,53,75,93,157,165],"network":[4,17,54,76,94,158,166],"model":[5,18,55,77,167,209],"to":[6,72,90,128,172,189,211],"solve":[7],"multiprocessor":[9],"real-time":[10,82,132],"task":[11,170,244],"scheduling":[12,47,80,105,124,161,193,204,231],"problems.":[13],"Using":[14],"or":[19,56],"its":[20],"generic":[21],"form,":[22],"linear":[23],"programming":[24],"(LP)":[25],"formulation,":[26],"for":[27,39,78,96,115],"problems":[29],"is":[30,89,125],"not":[31,147],"new.":[32],"However,":[33],"previous":[35],"works":[36],"have":[37],"limitations,":[38],"example,":[40],"that":[41,130,226],"they":[42,50],"are":[43],"classified":[44],"as":[45],"offline":[46],"techniques":[48],"since":[49],"establish":[51],"a":[52,61,177,207],"an":[57,112,251],"LP":[58],"problem":[59,221],"considering":[60],"very":[62],"long":[63],"time":[64,179],"interval.":[65],"In":[66],"this":[67],"study,":[68],"we":[69],"propose":[70,155],"how":[71],"construct":[73,91],"online":[79],"periodic":[81],"tasks":[83,101,133,145],"on":[84,195,206,254],"multiprocessors.":[85],"Our":[86],"key":[87],"idea":[88],"only":[95],"active":[98],"instances":[99,118],"of":[100,111,119,142,214,237,243],"at":[102],"current":[104],"time,":[106],"while":[107],"guaranteeing":[108],"existence":[110],"optimal":[113,123],"schedule":[114],"future":[117],"tasks.":[121],"The":[122],"here":[126],"defined":[127],"ensure":[129],"all":[131],"meet":[134],"their":[135],"deadlines":[136],"when":[137],"total":[139,150],"utilization":[140],"demand":[141],"given":[144],"does":[146],"exceed":[148],"processing":[151],"capacity.":[152],"then":[154],"model-based":[159],"polynomial-time":[160],"algorithms.":[162],"Advantageously,":[163],"allows":[168],"workload":[171],"be":[173],"collected":[174],"unfairly":[175],"within":[176],"certain":[178],"interval":[180],"without":[181],"losing":[182],"optimality.":[184],"It":[185],"thus":[186],"leads":[187],"us":[188],"designing":[190],"three":[191],"unfair-but-optimal":[192,203],"algorithms":[194],"both":[196],"continuous":[197],"and":[198],"discrete-time":[199,208,256],"models.":[200],"Especially,":[201],"our":[202,215],"algorithm":[205,253],"is,":[210],"best":[213],"knowledge,":[216],"first":[218],"in":[219,248],"domain.":[222],"experimentally":[224],"demonstrate":[225],"it":[227],"significantly":[228],"alleviates":[229],"overheads,":[232],"i.e.,":[233],"reduced":[235],"number":[236,242],"preemptions":[238],"with":[239,250],"comparable":[241],"migrations":[245],"across":[246],"processors,":[247],"comparison":[249],"existing":[252],"model.":[257]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}