{"id":"https://openalex.org/W2739573032","doi":"https://doi.org/10.1145/3090354.3090367","title":"Impact of Selecting Virtual Machine with Least Load on Tasks Scheduling Algorithms in Cloud Computing","display_name":"Impact of Selecting Virtual Machine with Least Load on Tasks Scheduling Algorithms in Cloud Computing","publication_year":2017,"publication_date":"2017-03-29","ids":{"openalex":"https://openalex.org/W2739573032","doi":"https://doi.org/10.1145/3090354.3090367","mag":"2739573032"},"language":"en","primary_location":{"id":"doi:10.1145/3090354.3090367","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3090354.3090367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd international Conference on Big Data, Cloud 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/A5014578103","display_name":"Tahani Aladwani","orcid":null},"institutions":[{"id":"https://openalex.org/I199693650","display_name":"Umm al-Qura University","ror":"https://ror.org/01xjqrm90","country_code":"SA","type":"education","lineage":["https://openalex.org/I199693650"]}],"countries":["SA"],"is_corresponding":true,"raw_author_name":"Tahani Aladwani","raw_affiliation_strings":["Department of Computer Science & Engineering, Umm Al-Qura University, Mecca, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Umm Al-Qura University, Mecca, Saudi Arabia","institution_ids":["https://openalex.org/I199693650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014578103"],"corresponding_institution_ids":["https://openalex.org/I199693650"],"apc_list":null,"apc_paid":null,"fwci":2.9929,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.92700306,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"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.9998000264167786,"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.9998000264167786,"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.998199999332428,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9944000244140625,"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.8606109619140625},{"id":"https://openalex.org/keywords/virtual-machine","display_name":"Virtual machine","score":0.6520330905914307},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.646064043045044},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5965359807014465},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5958579778671265},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5604537725448608},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5571616291999817},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5560140013694763},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5511778593063354},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.545276939868927},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5344305038452148},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.49298807978630066},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4305281937122345},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.42378753423690796},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.1975274682044983},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1412028670310974},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.13774991035461426},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06763359904289246}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8606109619140625},{"id":"https://openalex.org/C25344961","wikidata":"https://www.wikidata.org/wiki/Q192726","display_name":"Virtual machine","level":2,"score":0.6520330905914307},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.646064043045044},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5965359807014465},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5958579778671265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5604537725448608},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5571616291999817},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5560140013694763},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5511778593063354},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.545276939868927},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5344305038452148},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.49298807978630066},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4305281937122345},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.42378753423690796},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.1975274682044983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1412028670310974},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.13774991035461426},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06763359904289246},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3090354.3090367","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3090354.3090367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd international Conference on Big Data, Cloud and Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5400000214576721,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W769129622","https://openalex.org/W1607867326","https://openalex.org/W1817214139","https://openalex.org/W2016244009","https://openalex.org/W2045287414","https://openalex.org/W2078516141","https://openalex.org/W2114851664","https://openalex.org/W2134242245","https://openalex.org/W2169145071","https://openalex.org/W2200453386","https://openalex.org/W2309561981","https://openalex.org/W2320548149","https://openalex.org/W2326565172","https://openalex.org/W2332675749","https://openalex.org/W2399112534","https://openalex.org/W2472694212","https://openalex.org/W2552359053","https://openalex.org/W4205821171","https://openalex.org/W4238068542","https://openalex.org/W4248132479","https://openalex.org/W4253200348"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4386128920","https://openalex.org/W4300092030","https://openalex.org/W2167574351","https://openalex.org/W4390711911","https://openalex.org/W2172075652","https://openalex.org/W2007437247","https://openalex.org/W2076947091","https://openalex.org/W4390711951","https://openalex.org/W2225350526"],"abstract_inverted_index":{"Tasks":[0],"scheduling":[1,22,64,87,137,152],"algorithms":[2,91],"consider":[3],"the":[4,11,29,102,122],"first":[5],"and":[6,52,55,93,150],"basic":[7],"factors":[8],"in":[9,82,105,110],"controlling":[10],"cloud":[12,57],"computing":[13,58],"performance.":[14,59],"In":[15,118],"this":[16,126],"paper,":[17],"we":[18],"attempt":[19,61],"to":[20,34,45,62,89,116,120],"improve":[21,63,90],"algorithm's":[23,65],"performance":[24,66,92,123],"by":[25,67,125],"a":[26,69,133],"focus":[27],"on":[28,37,100,132],"load":[30,77,96,104],"balance":[31],"factor":[32],"due":[33],"its":[35,95],"impact":[36],"distributing":[38],"tasks":[39,114],"across":[40],"multiple":[41],"virtual":[42],"machine":[43],"(VMs)":[44],"get":[46],"best":[47],"resources":[48],"utilization,":[49],"reducing":[50],"waiting":[51],"execution":[53],"time":[54],"enhancing":[56],"This":[60],"proposing":[68],"new":[70],"strategy":[71],"called":[72],"selecting":[73],"VM":[74,107],"with":[75,84],"least":[76],"(SVLL)":[78],"can":[79],"be":[80,130],"applied":[81,131],"conjunction":[83],"any":[85],"task":[86],"algorithm":[88],"increase":[94],"balance.":[97],"SVLL":[98],"based":[99],"calculating":[101],"total":[103],"each":[106],"without":[108],"taking":[109],"consideration":[111],"number":[112],"of":[113,135],"assigned":[115],"it.":[117],"order":[119],"measure":[121],"achieved":[124],"method,":[127],"it":[128],"will":[129],"set":[134],"simple":[136],"algorithms,":[138],"such":[139],"as":[140],"First":[141,143,148],"Come":[142],"Service":[144],"(FCFS),":[145],"Shortest":[146],"Job":[147],"(SJF),":[149],"Max-Min":[151],"algorithms.":[153]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}