{"id":"https://openalex.org/W1970009503","doi":"https://doi.org/10.1109/bmei.2011.6098753","title":"A recursive algorithm for scheduling of tasks in a heterogeneous distributed environment","display_name":"A recursive algorithm for scheduling of tasks in a heterogeneous distributed environment","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W1970009503","doi":"https://doi.org/10.1109/bmei.2011.6098753","mag":"1970009503"},"language":"en","primary_location":{"id":"doi:10.1109/bmei.2011.6098753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bmei.2011.6098753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 4th International Conference on Biomedical Engineering and Informatics (BMEI)","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/A5062832787","display_name":"Yan Kang","orcid":"https://orcid.org/0000-0001-6969-0562"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yan Kang","raw_affiliation_strings":["Department of Software Engineering School of Software, Yunnan University, Kunming, Yunnan, China","[department of software engineering school of software, yunnan university, Kunming, Yunnan, China]"],"affiliations":[{"raw_affiliation_string":"Department of Software Engineering School of Software, Yunnan University, Kunming, Yunnan, China","institution_ids":["https://openalex.org/I189210763"]},{"raw_affiliation_string":"[department of software engineering school of software, yunnan university, Kunming, Yunnan, China]","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077943592","display_name":"Ying Lin","orcid":"https://orcid.org/0000-0003-4141-1490"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ying Lin","raw_affiliation_strings":["Department of Information Security School of Software, Yunnan University, Kunming, Yunnan, China","Department of Information Security, School of Software, Yunnan University, Kunming, Yunnan, China"],"affiliations":[{"raw_affiliation_string":"Department of Information Security School of Software, Yunnan University, Kunming, Yunnan, China","institution_ids":["https://openalex.org/I189210763"]},{"raw_affiliation_string":"Department of Information Security, School of Software, Yunnan University, Kunming, Yunnan, China","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062832787"],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":0.7002,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.70231734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2099","last_page":"2103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"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":1.0,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.996399998664856,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8328033685684204},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.754111647605896},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.7426647543907166},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.7056574821472168},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.7008861899375916},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.6857879161834717},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5877485275268555},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5839319825172424},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5807256698608398},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5649204254150391},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4782465994358063},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.4628317654132843},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.355904757976532},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34767425060272217},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21029728651046753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09130555391311646},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06133642792701721}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8328033685684204},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.754111647605896},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.7426647543907166},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.7056574821472168},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.7008861899375916},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.6857879161834717},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5877485275268555},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5839319825172424},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5807256698608398},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5649204254150391},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4782465994358063},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.4628317654132843},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.355904757976532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34767425060272217},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21029728651046753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09130555391311646},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06133642792701721}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bmei.2011.6098753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bmei.2011.6098753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 4th International Conference on Biomedical Engineering and Informatics (BMEI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1535233371","https://openalex.org/W1562653311","https://openalex.org/W1819660368","https://openalex.org/W2004988342","https://openalex.org/W2010868970","https://openalex.org/W2019356799","https://openalex.org/W2112998751","https://openalex.org/W2114719509","https://openalex.org/W2118396891","https://openalex.org/W2123408066","https://openalex.org/W2129606970","https://openalex.org/W2143937515","https://openalex.org/W2149294210","https://openalex.org/W2151038512","https://openalex.org/W2152408640","https://openalex.org/W2155951254","https://openalex.org/W2170981054","https://openalex.org/W6679729614"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W2912206708","https://openalex.org/W1935185185","https://openalex.org/W2167574351","https://openalex.org/W2377321505","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W2393789493","https://openalex.org/W2545511463","https://openalex.org/W3184267879"],"abstract_inverted_index":{"Optimal":[0],"scheduling":[1,20,37,52,72,146,157],"of":[2,31,58,65,85,130,138,150],"parallel":[3],"tasks":[4,103,125],"with":[5,153],"some":[6],"precedence":[7],"is":[8,21,38,69,77,79,99,119,134,141],"critical":[9],"for":[10,54,113],"achieving":[11],"high":[12],"performance":[13,137],"in":[14,26,42],"heterogeneous":[15,44,59],"computing":[16],"system.":[17],"The":[18,29,74,95,116,136],"application":[19],"known":[22],"to":[23,39,78,80,92,100,120],"be":[24,40],"NP-complete":[25],"general":[27],"cases.":[28],"complexity":[30],"the":[32,63,82,90,102,105,109,114,123,127,131,139,145,154],"problem":[33],"increase":[34],"when":[35],"task":[36,51,71,87,133],"done":[41],"a":[43,49,55],"environment.":[45],"This":[46],"paper":[47],"presents":[48],"recursive":[50],"algorithm":[53,140],"bounded":[56],"number":[57],"processors":[60,106],"run":[61],"on":[62],"network":[64],"Heterogeneous":[66,159],"systems.":[67],"It":[68],"three-phase":[70],"algorithm.":[73,167],"task-prioritizing":[75],"phase":[76,98,118],"compute":[81],"upward":[83],"rank":[84],"each":[86],"and":[88,163],"assign":[89],"priority":[91],"all":[93,122],"tasks.":[94],"processor":[96],"selection":[97],"schedule":[101],"onto":[104],"that":[107],"give":[108],"latest":[110],"start":[111],"time":[112,129],"task.":[115],"moving":[117],"move":[121],"possible":[124],"until":[126],"starting":[128],"entry":[132],"zero.":[135],"illustrated":[142],"by":[143],"comparing":[144],"length":[147],"ratio,":[148],"frequency":[149],"best":[151],"results":[152],"existing":[155],"effectively":[156],"algorithms,":[158],"Earliest":[160],"Finish":[161],"Time":[162],"Iterative":[164],"List":[165],"Scheduling":[166]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"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":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}