{"id":"https://openalex.org/W2962939166","doi":"https://doi.org/10.1109/tpds.2019.2929048","title":"Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors","display_name":"Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors","publication_year":2019,"publication_date":"2019-07-23","ids":{"openalex":"https://openalex.org/W2962939166","doi":"https://doi.org/10.1109/tpds.2019.2929048","mag":"2962939166"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2019.2929048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2019.2929048","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"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 Parallel and Distributed Systems","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/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"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyeonjoong Cho","raw_affiliation_strings":["Department of Computer and Information Science, Korea University, Sejong, South Korea"],"raw_orcid":"https://orcid.org/0000-0003-1487-895X","affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Korea University, Sejong, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022554135","display_name":"Chul-Goo Kim","orcid":null},"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"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Chulgoo Kim","raw_affiliation_strings":["Department of Computer and Information Science, Korea University, Sejong, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Korea University, Sejong, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082949360","display_name":"Joohyung Sun","orcid":"https://orcid.org/0000-0002-3177-6595"},"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"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Joohyung Sun","raw_affiliation_strings":["Department of Computer and Information Science, Korea University, Sejong, South Korea"],"raw_orcid":"https://orcid.org/0000-0002-3177-6595","affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Korea University, Sejong, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"middle","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"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016562495","display_name":"Ju-Derk Park","orcid":null},"institutions":[{"id":"https://openalex.org/I142401562","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10","country_code":"KR","type":"facility","lineage":["https://openalex.org/I142401562","https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Ju-Derk Park","raw_affiliation_strings":["ETRI, Daejeon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETRI, Daejeon, South Korea","institution_ids":["https://openalex.org/I142401562"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108541632","display_name":"Byeong-Cheol Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I142401562","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10","country_code":"KR","type":"facility","lineage":["https://openalex.org/I142401562","https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Byeong-Cheol Choi","raw_affiliation_strings":["ETRI, Daejeon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETRI, Daejeon, South Korea","institution_ids":["https://openalex.org/I142401562"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5935,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.89146707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"31","issue":"1","first_page":"171","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9995999932289124,"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.9995999932289124,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983999729156494,"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.998199999332428,"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.8591737151145935},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7693977952003479},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6576343774795532},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6014842987060547},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4997868537902832},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.44889265298843384},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.4457050561904907},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43615761399269104},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4328978657722473},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.43075525760650635},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4243607521057129},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24861007928848267},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16416728496551514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10366791486740112}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8591737151145935},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7693977952003479},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6576343774795532},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6014842987060547},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4997868537902832},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.44889265298843384},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.4457050561904907},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43615761399269104},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4328978657722473},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.43075525760650635},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4243607521057129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24861007928848267},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16416728496551514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10366791486740112},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tpds.2019.2929048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2019.2929048","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"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 Parallel and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1897989959","display_name":null,"funder_award_id":"NRF-2018R1D1A1B07049078","funder_id":"https://openalex.org/F4320312071","funder_display_name":"Ministry of Education, Libya"},{"id":"https://openalex.org/G6022042665","display_name":null,"funder_award_id":"NRF-2015R1D1A1A01057018","funder_id":"https://openalex.org/F4320312071","funder_display_name":"Ministry of Education, Libya"}],"funders":[{"id":"https://openalex.org/F4320312071","display_name":"Ministry of Education, Libya","ror":"https://ror.org/02w030k33"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W164978841","https://openalex.org/W175810106","https://openalex.org/W618967794","https://openalex.org/W1520679476","https://openalex.org/W1604465009","https://openalex.org/W1615714516","https://openalex.org/W1625622590","https://openalex.org/W1971610650","https://openalex.org/W1975579741","https://openalex.org/W1977545325","https://openalex.org/W1982587869","https://openalex.org/W1983174400","https://openalex.org/W1983383464","https://openalex.org/W1987228334","https://openalex.org/W2012059473","https://openalex.org/W2037468202","https://openalex.org/W2050086297","https://openalex.org/W2054998117","https://openalex.org/W2056239531","https://openalex.org/W2063123613","https://openalex.org/W2066415966","https://openalex.org/W2072162984","https://openalex.org/W2072725684","https://openalex.org/W2081746076","https://openalex.org/W2090822559","https://openalex.org/W2090902997","https://openalex.org/W2092826427","https://openalex.org/W2095126271","https://openalex.org/W2112967454","https://openalex.org/W2114149665","https://openalex.org/W2116581888","https://openalex.org/W2124888010","https://openalex.org/W2125690626","https://openalex.org/W2147133278","https://openalex.org/W2170091282","https://openalex.org/W2344218769","https://openalex.org/W2344636624","https://openalex.org/W2520095606","https://openalex.org/W2524169710","https://openalex.org/W2526851073","https://openalex.org/W2568058857","https://openalex.org/W2569164022","https://openalex.org/W2604724652","https://openalex.org/W2623976580","https://openalex.org/W2782953044","https://openalex.org/W2890277969","https://openalex.org/W3159335831","https://openalex.org/W4234858060","https://openalex.org/W6607051610","https://openalex.org/W6619356156","https://openalex.org/W6631228652","https://openalex.org/W6738710508","https://openalex.org/W6794826106"],"related_works":["https://openalex.org/W1569389315","https://openalex.org/W2503642292","https://openalex.org/W2790478050","https://openalex.org/W2462936459","https://openalex.org/W2997221951","https://openalex.org/W3174582865","https://openalex.org/W3113618232","https://openalex.org/W1498584408","https://openalex.org/W2000536041","https://openalex.org/W2136269455"],"abstract_inverted_index":{"Recently,":[0],"several":[1],"parallel":[2,30,55,67,78,123],"frameworks":[3],"have":[4],"emerged":[5],"to":[6,99,155],"utilize":[7],"the":[8,24,43,48,54,90,101,107,134,138,143,149,157,160,166,170,184],"increasing":[9],"computational":[10],"capacity":[11,104],"of":[12,46,50,76,117,129,137,169],"multiprocessors.":[13],"Parallel":[14],"tasks":[15,21,57],"are":[16,80],"distinguished":[17],"from":[18],"traditional":[19],"sequential":[20],"in":[22,27,70,193],"that":[23,97,183],"subtasks":[25,75],"contained":[26],"a":[28,83,113,127,152,194],"single":[29],"task":[31,79,125],"can":[32],"simultaneously":[33],"execute":[34],"on":[35,52,64,159],"multiple":[36],"processors.":[37],"In":[38,60],"this":[39],"study,":[40],"we":[41,62,92],"consider":[42],"scheduling":[44,65],"problem":[45,96,150],"minimizing":[47],"number":[49],"processors":[51],"which":[53,71],"real-time":[56,68,124],"feasibly":[58],"run.":[59],"particular,":[61],"focus":[63],"sporadic":[66],"tasks,":[69],"precedence":[72,135],"constraints":[73,136],"between":[74],"each":[77,122],"expressed":[81],"using":[82],"directed":[84],"acyclic":[85],"graph":[86],"(DAG).":[87],"To":[88],"address":[89],"problem,":[91],"formulate":[93],"an":[94],"optimization":[95],"aims":[98],"minimize":[100],"maximum":[102],"processing":[103],"for":[105],"executing":[106],"given":[108],"tasks.":[109],"We":[110,163],"then":[111],"suggest":[112],"polynomial":[114],"solution":[115],"consisting":[116],"three":[118],"steps:":[119],"(1)":[120],"transform":[121],"into":[126],"series":[128],"multithreaded":[130],"segments,":[131],"while":[132],"respecting":[133],"DAG;":[139],"(2)":[140],"selectively":[141],"extend":[142],"segment":[144],"lengths;":[145],"and":[146],"(3)":[147],"interpret":[148],"as":[151],"flow":[153],"network":[154],"balance":[156],"flows":[158],"terminal":[161],"edges.":[162],"also":[164],"provide":[165],"schedulability":[167],"bound":[168],"proposed":[171,185],"solution:":[172],"it":[173],"has":[174],"acapacity":[175],"augmentation":[176],"boundof":[177],"2.":[178],"Our":[179],"experimental":[180],"results":[181],"show":[182],"approach":[186],"yields":[187],"higher":[188],"performance":[189],"than":[190],"one":[191],"developed":[192],"recent":[195],"study.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}