{"id":"https://openalex.org/W2954758040","doi":"https://doi.org/10.3233/jifs-179299","title":"A novel task scheduling algorithm integrated with priority and greedy strategy in cloud computing","display_name":"A novel task scheduling algorithm integrated with priority and greedy strategy in cloud computing","publication_year":2019,"publication_date":"2019-06-27","ids":{"openalex":"https://openalex.org/W2954758040","doi":"https://doi.org/10.3233/jifs-179299","mag":"2954758040"},"language":"en","primary_location":{"id":"doi:10.3233/jifs-179299","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-179299","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy 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/A5100359921","display_name":"Zhou Zhou","orcid":"https://orcid.org/0000-0002-4787-9660"},"institutions":[{"id":"https://openalex.org/I198357462","display_name":"Changsha University","ror":"https://ror.org/011d8sm39","country_code":"CN","type":"education","lineage":["https://openalex.org/I198357462"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhou ZHOU","raw_affiliation_strings":["School of Computer Engineering and Applied Mathematics, Changsha University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering and Applied Mathematics, Changsha University, Changsha, China","institution_ids":["https://openalex.org/I198357462"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023044955","display_name":"Houliang Xie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Houliang Xie","raw_affiliation_strings":["Information Engineering Department, Zhangjiajie Institute of Aeronautical Engineering, Zhangjiajie, China"],"affiliations":[{"raw_affiliation_string":"Information Engineering Department, Zhangjiajie Institute of Aeronautical Engineering, Zhangjiajie, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081333552","display_name":"Fangmin Li","orcid":"https://orcid.org/0000-0002-8612-1756"},"institutions":[{"id":"https://openalex.org/I198357462","display_name":"Changsha University","ror":"https://ror.org/011d8sm39","country_code":"CN","type":"education","lineage":["https://openalex.org/I198357462"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Fangmin Li","raw_affiliation_strings":["School of Computer Engineering and Applied Mathematics, Changsha University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering and Applied Mathematics, Changsha University, Changsha, China","institution_ids":["https://openalex.org/I198357462"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081333552"],"corresponding_institution_ids":["https://openalex.org/I198357462"],"apc_list":null,"apc_paid":null,"fwci":2.374,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90970024,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"37","issue":"4","first_page":"4647","last_page":"4655"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9972000122070312,"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"}},"topics":[{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9972000122070312,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9922000169754028,"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/T12761","display_name":"Data Stream Mining Techniques","score":0.9666000008583069,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8110312223434448},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.604023277759552},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.5813504457473755},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.5796706676483154},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5744896531105042},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5731294751167297},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5000731945037842},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.46412280201911926},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.45425158739089966},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44696685671806335},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.4436872899532318},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.43911775946617126},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.4180782437324524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41423895955085754},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3382211923599243},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2812332510948181},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12553223967552185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10067647695541382},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06910496950149536}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8110312223434448},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.604023277759552},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.5813504457473755},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.5796706676483154},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5744896531105042},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5731294751167297},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5000731945037842},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.46412280201911926},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.45425158739089966},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44696685671806335},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.4436872899532318},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.43911775946617126},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.4180782437324524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41423895955085754},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3382211923599243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2812332510948181},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12553223967552185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10067647695541382},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06910496950149536},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jifs-179299","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-179299","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W2009168408","https://openalex.org/W2017799101","https://openalex.org/W2040009164","https://openalex.org/W2045287414","https://openalex.org/W2102916293","https://openalex.org/W2152744490","https://openalex.org/W2171552940","https://openalex.org/W2261339442","https://openalex.org/W2282752563","https://openalex.org/W2410213821","https://openalex.org/W2551000267","https://openalex.org/W2635110787","https://openalex.org/W2750846724","https://openalex.org/W2752687741","https://openalex.org/W2783939240","https://openalex.org/W2806964477","https://openalex.org/W2883054131","https://openalex.org/W2884353925","https://openalex.org/W2888904922","https://openalex.org/W2893020490","https://openalex.org/W2893449734"],"related_works":["https://openalex.org/W2364408853","https://openalex.org/W2385139534","https://openalex.org/W2377321505","https://openalex.org/W2464659810","https://openalex.org/W2108793785","https://openalex.org/W2164476817","https://openalex.org/W1591946588","https://openalex.org/W2393027083","https://openalex.org/W1827860574","https://openalex.org/W2962323017"],"abstract_inverted_index":{"To":[0,80],"deal":[1],"with":[2,28,105,133],"the":[3,34,38,41,44,60,75,82,88,92,96,106,111,115,126,138,142,153],"problem":[4,76],"of":[5,36,47,77,86,122,149],"unbalanced":[6,78],"load":[7],"and":[8,30,52,56,108,119,124,135,146,151,157],"ignoring":[9],"task":[10,14,21,39,55,58,61,94],"priority":[11,29,90],"in":[12,59],"previous":[13],"scheduling":[15,22],"algorithms,":[16],"this":[17],"paper":[18],"proposes":[19],"a":[20],"algorithm":[23,42,89,113,140],"named":[24],"P-Min-Min-Max,":[25],"which":[26],"combines":[27],"greedy":[31,50],"strategy.":[32],"Under":[33],"condition":[35],"considering":[37],"priority,":[40],"leverages":[43],"execution":[45,128],"time":[46,85,129,156],"tasks":[48],"for":[49,130],"strategy,":[51],"binding":[53],"large":[54],"small":[57,93],"list":[62],"to":[63,67,72],"form":[64],"\u201ctask":[65,97],"pair\u201d":[66],"perform":[68],"scheduling,":[69],"so":[70],"as":[71],"effectively":[73],"solve":[74],"load.":[79],"reduce":[81],"average":[83,158],"response":[84,159],"tasks,":[87],"schedules":[91],"from":[95],"pair\u201d.":[98],"The":[99],"experimental":[100],"results":[101],"show":[102],"that,":[103],"compared":[104],"Min-Min":[107],"P-Min-Min":[109],"algorithm,":[110,137],"proposed":[112,139],"improves":[114,141],"system":[116,143],"resource":[117,144],"utilization":[118,145],"service":[120,147],"quality":[121,148],"user,":[123,150],"saves":[125],"total":[127,154],"tasks.":[131],"Compared":[132],"Max-Min":[134],"P-Max-Min":[136],"reduces":[152],"completion":[155],"time.":[160]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}