{"id":"https://openalex.org/W2163341385","doi":"https://doi.org/10.1109/cit.2004.1357238","title":"Dynamic scheduling algorithm for parallel real-time jobs in heterogeneous system","display_name":"Dynamic scheduling algorithm for parallel real-time jobs in heterogeneous system","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2163341385","doi":"https://doi.org/10.1109/cit.2004.1357238","mag":"2163341385"},"language":"en","primary_location":{"id":"doi:10.1109/cit.2004.1357238","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cit.2004.1357238","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Fourth International Conference onComputer and Information Technology, 2004. CIT '04.","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/A5063481218","display_name":"Dan Ma","orcid":"https://orcid.org/0000-0001-8628-8954"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dan Ma","raw_affiliation_strings":["School of Computer, Huazhong University of Science and Technology, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"School of Computer, Huazhong University of Science and Technology, Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101550129","display_name":"Wei Zhang","orcid":"https://orcid.org/0000-0003-0356-9561"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wei Zhang","raw_affiliation_strings":["Wuhan Ordnance N.C.O Academy of PLA, WuHan, China"],"affiliations":[{"raw_affiliation_string":"Wuhan Ordnance N.C.O Academy of PLA, WuHan, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100670303","display_name":"Qinghua Li","orcid":"https://orcid.org/0000-0002-5143-6678"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qinghua Li","raw_affiliation_strings":["School of Computer, Huazhong University of Science and Technology, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"School of Computer, Huazhong University of Science and Technology, Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063481218"],"corresponding_institution_ids":["https://openalex.org/I47720641"],"apc_list":null,"apc_paid":null,"fwci":0.2633,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.59102179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"462","last_page":"466"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9929999709129333,"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.9779000282287598,"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.7883784770965576},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.7801640033721924},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.7439635396003723},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6920746564865112},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.6359232664108276},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.6299444437026978},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.5878857970237732},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.567484438419342},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5474447011947632},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5275461673736572},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.49136725068092346},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.475187212228775},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42955300211906433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3503645062446594},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3320038914680481},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24931403994560242},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0960073173046112},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07541966438293457},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.050998181104660034}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7883784770965576},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.7801640033721924},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.7439635396003723},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6920746564865112},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.6359232664108276},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.6299444437026978},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.5878857970237732},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.567484438419342},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5474447011947632},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5275461673736572},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.49136725068092346},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.475187212228775},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42955300211906433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3503645062446594},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3320038914680481},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24931403994560242},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0960073173046112},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07541966438293457},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.050998181104660034}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cit.2004.1357238","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cit.2004.1357238","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Fourth International Conference onComputer and Information Technology, 2004. CIT '04.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1481495003","https://openalex.org/W1781596060","https://openalex.org/W1897593416","https://openalex.org/W2103477606","https://openalex.org/W2114882894","https://openalex.org/W2157384735","https://openalex.org/W2158242851","https://openalex.org/W4285719527","https://openalex.org/W6629186198","https://openalex.org/W6682960005"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W2076947091","https://openalex.org/W2167574351","https://openalex.org/W2257422103","https://openalex.org/W2007437247","https://openalex.org/W2557471897","https://openalex.org/W2172075652","https://openalex.org/W2225350526"],"abstract_inverted_index":{"The":[0],"dynamic":[1],"tasks":[2,26,38],"scheduling":[3,27,39,44,60,63,69],"of":[4,81,87],"parallel":[5,88],"real-time":[6,25,37,43],"jobs":[7],"in":[8],"heterogeneous":[9],"system":[10],"is":[11,16],"still":[12],"challenging":[13],"problem":[14],"that":[15,47,58],"being":[17],"investigated":[18],"by":[19,75],"some":[20],"researchers.":[21],"But":[22],"the":[23,54,59,79],"DAG-based":[24,36],"isn't":[28],"yet":[29],"paid":[30],"enough":[31],"attention.":[32],"This":[33],"paper":[34],"proposed":[35],"model":[40,61],"and":[41,62],"a":[42,49,67,82],"algorithm":[45,64,77],"DEFF":[46],"has":[48],"lower":[50],"time":[51],"complexity.":[52],"Furthermore,":[53],"simulation":[55],"experiments":[56],"show":[57],"are":[65],"feasible,":[66],"higher":[68],"successful":[70],"ratio":[71],"may":[72],"be":[73],"obtained":[74],"this":[76],"under":[78],"condition":[80],"small":[83],"or":[84],"middle":[85],"scale":[86],"jobs.":[89]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}