{"id":"https://openalex.org/W2605734361","doi":"https://doi.org/10.1504/ijcc.2017.10004748","title":"De-centralised dynamic task scheduling using hill climbing algorithm in cloud computing environments","display_name":"De-centralised dynamic task scheduling using hill climbing algorithm in cloud computing environments","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2605734361","doi":"https://doi.org/10.1504/ijcc.2017.10004748","mag":"2605734361"},"language":"en","primary_location":{"id":"doi:10.1504/ijcc.2017.10004748","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcc.2017.10004748","pdf_url":null,"source":{"id":"https://openalex.org/S4210172516","display_name":"International Journal of Cloud Computing","issn_l":"2043-9989","issn":["2043-9989","2043-9997"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Cloud Computing","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/A5049209645","display_name":"Mona Mohammadi","orcid":null},"institutions":[{"id":"https://openalex.org/I155419210","display_name":"Islamic Azad University, Science and Research Branch","ror":"https://ror.org/03187yj51","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I155419210"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mona Mohammadi","raw_affiliation_strings":["Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran","institution_ids":["https://openalex.org/I155419210"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021772077","display_name":"Amir Masoud Rahmani","orcid":"https://orcid.org/0000-0001-8641-6119"},"institutions":[{"id":"https://openalex.org/I155419210","display_name":"Islamic Azad University, Science and Research Branch","ror":"https://ror.org/03187yj51","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I155419210"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Amir Masoud Rahmani","raw_affiliation_strings":["Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran","institution_ids":["https://openalex.org/I155419210"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049209645"],"corresponding_institution_ids":["https://openalex.org/I155419210"],"apc_list":null,"apc_paid":null,"fwci":1.4509,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8611934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":"1","first_page":"79","last_page":"79"},"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.9929999709129333,"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.9929999709129333,"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.9587000012397766,"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.8289919495582581},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.627080500125885},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.6164707541465759},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5932323932647705},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5897558331489563},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5459583401679993},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5223725438117981},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.4879743456840515},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.47809216380119324},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4366520643234253},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.43054574728012085},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4288191497325897},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16394886374473572},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10107383131980896},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09977766871452332},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07031229138374329}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8289919495582581},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.627080500125885},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.6164707541465759},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5932323932647705},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5897558331489563},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5459583401679993},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5223725438117981},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4879743456840515},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.47809216380119324},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4366520643234253},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.43054574728012085},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4288191497325897},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16394886374473572},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10107383131980896},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09977766871452332},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07031229138374329},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijcc.2017.10004748","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcc.2017.10004748","pdf_url":null,"source":{"id":"https://openalex.org/S4210172516","display_name":"International Journal of Cloud Computing","issn_l":"2043-9989","issn":["2043-9989","2043-9997"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Cloud Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4300092030","https://openalex.org/W2167574351","https://openalex.org/W3184267879","https://openalex.org/W1545991362","https://openalex.org/W2545511463","https://openalex.org/W2404383452","https://openalex.org/W2106332846","https://openalex.org/W2978148977","https://openalex.org/W2172075652"],"abstract_inverted_index":{"There":[0],"are":[1,66],"many":[2],"tasks":[3,58,87,99],"in":[4,31],"cloud":[5,32],"computing":[6,33],"that":[7,63,75,111],"should":[8],"be":[9],"executed":[10],"by":[11],"available":[12,60,101],"resources":[13,25,61,102],"to":[14,43,59,82,100,103],"acquire":[15],"high":[16],"performance,":[17],"reduce":[18],"task":[19,28],"completion":[20,84,120],"time,":[21],"increase":[22],"utilisation":[23,92],"of":[24,56,86,93,122],"etc.":[26],"Since":[27],"scheduling":[29,41,52,73],"problem":[30],"is":[34,49,53],"an":[35,39],"NP-hard":[36],"problem,":[37],"designing":[38],"efficient":[40],"strategy":[42],"achieve":[44,104,115],"the":[45,54,112],"intentions":[46],"listed":[47],"above":[48],"challenging.":[50],"Task":[51],"process":[55],"allocating":[57],"such":[62],"performance":[64],"metrics":[65],"improved.":[67],"This":[68,95],"paper":[69],"proposes":[70],"a":[71],"dynamic":[72],"algorithm":[74,96,113],"uses":[76],"hill":[77],"climbing":[78],"algorithm.":[79],"It":[80],"tries":[81],"minimise":[83],"time":[85,121],"while":[88],"maximising":[89],"throughput":[90],"and":[91,118],"resources.":[94],"allocates":[97],"independent":[98],"load":[105,116],"balance.":[106],"The":[107],"simulation":[108],"results":[109],"show":[110],"can":[114],"balance":[117],"reduces":[119],"tasks.":[123]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}