{"id":"https://openalex.org/W1985306533","doi":"https://doi.org/10.1109/dbta.2010.5659041","title":"A High Efficient Task Scheduling Algorithm Based on Heterogeneous Multi-Core Processor","display_name":"A High Efficient Task Scheduling Algorithm Based on Heterogeneous Multi-Core Processor","publication_year":2010,"publication_date":"2010-11-01","ids":{"openalex":"https://openalex.org/W1985306533","doi":"https://doi.org/10.1109/dbta.2010.5659041","mag":"1985306533"},"language":"en","primary_location":{"id":"doi:10.1109/dbta.2010.5659041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dbta.2010.5659041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 2nd International Workshop on Database Technology and Applications","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/A5101609082","display_name":"Hui Cheng","orcid":"https://orcid.org/0000-0003-2950-2445"},"institutions":[{"id":"https://openalex.org/I151727225","display_name":"Harbin Engineering University","ror":"https://ror.org/03x80pn82","country_code":"CN","type":"education","lineage":["https://openalex.org/I151727225"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hui Cheng","raw_affiliation_strings":["College of Computer Science and Technology, Harbin Engineering of Technology, Harbin, China","College of Computer Sci. and Tech., Harbin Engineering University, Harbin, China"],"affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Harbin Engineering of Technology, Harbin, China","institution_ids":[]},{"raw_affiliation_string":"College of Computer Sci. and Tech., Harbin Engineering University, Harbin, China","institution_ids":["https://openalex.org/I151727225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101609082"],"corresponding_institution_ids":["https://openalex.org/I151727225"],"apc_list":null,"apc_paid":null,"fwci":1.4245,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.81491899,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9950000047683716,"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.800640344619751},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.6122860908508301},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5488763451576233},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5468610525131226},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5412895083427429},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.511214017868042},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.48646780848503113},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.480815052986145},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45860323309898376},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4581223726272583},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.43828386068344116},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4168110191822052},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3792973458766937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32415035367012024},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20793727040290833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11106035113334656},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.053654491901397705}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.800640344619751},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.6122860908508301},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5488763451576233},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5468610525131226},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5412895083427429},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.511214017868042},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.48646780848503113},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.480815052986145},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45860323309898376},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4581223726272583},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.43828386068344116},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4168110191822052},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3792973458766937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32415035367012024},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20793727040290833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11106035113334656},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.053654491901397705}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dbta.2010.5659041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dbta.2010.5659041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 2nd International Workshop on Database Technology and Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1958965543","https://openalex.org/W1965919411","https://openalex.org/W1978559775","https://openalex.org/W2041990277","https://openalex.org/W2114719509","https://openalex.org/W2132067977","https://openalex.org/W2143031615","https://openalex.org/W2155951254","https://openalex.org/W2159123182"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1545991362","https://openalex.org/W2167574351","https://openalex.org/W2184166483","https://openalex.org/W2545511463","https://openalex.org/W3184267879","https://openalex.org/W2404383452","https://openalex.org/W2245286458","https://openalex.org/W2076947091","https://openalex.org/W177179517"],"abstract_inverted_index":{"Task":[0],"scheduling":[1,16,26,105,119,126],"is":[2,18,29,77,92,100],"an":[3],"important":[4],"part":[5],"of":[6,13,52,62,72,82,89,97,128],"high":[7],"performance":[8],"multi-core":[9],"building.":[10],"The":[11,70],"shortcomings":[12],"existing":[14],"task":[15,25,54,66,73,90,104,130],"algorithms":[17],"analyzed,":[19],"and":[20,65],"a":[21],"new":[22,36,121],"efficient":[23],"heuristic":[24],"algorithm,":[27],"namely,HCDDSL":[28],"proposed":[30,103],"in":[31,59,74,79],"this":[32,85],"paper.":[33],"Firstly,":[34],"the":[35,45,50,60,75,80,87,95,112,125,129],"algorithm":[37,106,122],"optimizes":[38],"DAG":[39,76],"graph":[40,131],"by":[41,49],"using":[42],"clustering,":[43],"then":[44],"nodes":[46],"are":[47,68],"descended":[48],"values":[51],"Succ_sum,the":[53],"schedule":[55,91],"has":[56,107],"been":[57,108],"processed":[58],"case":[61],"insert":[63],"interval":[64],"duplication":[67],"considered.":[69],"weight":[71],"considered":[78],"process":[81],"schedule.":[83],"By":[84],"means,":[86],"result":[88],"optimized":[93],"effectively,and":[94],"makespan":[96],"all":[98],"tasks":[99],"reduced":[101],"also.The":[102],"analyzed":[109],"through":[110],"simulation,":[111],"results":[113],"show":[114],"that":[115],"compare":[116],"to":[117],"old":[118],"algorithm,this":[120],"can":[123],"shorten":[124],"length":[127],"greatly.":[132]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}