{"id":"https://openalex.org/W2183512850","doi":null,"title":"A Study on Task Scheduling Algorithms in Cloud Computing","display_name":"A Study on Task Scheduling Algorithms in Cloud Computing","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2183512850","mag":"2183512850"},"language":"en","primary_location":{"id":"pmh:oai:share.osf.io:E0066-000-AF2","doi":null,"is_oa":false,"landing_page_url":"http://api.osf.io/v2/nodes/7hjg6/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401127","display_name":"OSF Preprints (OSF Preprints)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799848540","host_organization_name":"Center for Open Science","host_organization_lineage":["https://openalex.org/I2799848540"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"project"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"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/A5039560433","display_name":"Vijayalakshmi A. Lepakshi","orcid":"https://orcid.org/0000-0002-0899-0892","observed_orcids":["https://orcid.org/0000-0002-0899-0892"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vijayalakshmi A. Lepakshi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5039560433"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9883000254631042,"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.9883000254631042,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.010099999606609344,"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/T14098","display_name":"Energy Efficiency in Computing","score":0.00019999999494757503,"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/task-scheduling-algorithms","display_name":"task scheduling algorithms","score":0.8830000162124634},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"cloud computing","score":1.0},{"id":"https://openalex.org/keywords/heterogeneous-computing","display_name":"heterogeneous computing","score":0.6809999942779541},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.875},{"id":"https://openalex.org/keywords/parallel-application-scheduling","display_name":"parallel program scheduling","score":0.8870000243186951},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.7860000133514404},{"id":"https://openalex.org/keywords/resource-availability-uncertainty","display_name":"resource availability uncertainty","score":0.7720000147819519},{"id":"https://openalex.org/keywords/network-latency","display_name":"network latency","score":0.7129999995231628}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8590548634529114},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.8144252300262451},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7240606546401978},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5688951015472412},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5109581351280212},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.48790881037712097},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4586939215660095},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4463662803173065},{"id":"https://openalex.org/C85106507","wikidata":"https://www.wikidata.org/wiki/Q1188445","display_name":"Utility computing","level":4,"score":0.4216420650482178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41442573070526123},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17691001296043396},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.1447492241859436},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12222260236740112},{"id":"https://openalex.org/C184842701","wikidata":"https://www.wikidata.org/wiki/Q370563","display_name":"Cloud computing security","level":3,"score":0.11617854237556458},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.06793785095214844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06667977571487427}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:share.osf.io:E0066-000-AF2","doi":null,"is_oa":false,"landing_page_url":"http://api.osf.io/v2/nodes/7hjg6/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401127","display_name":"OSF Preprints (OSF Preprints)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799848540","host_organization_name":"Center for Open Science","host_organization_lineage":["https://openalex.org/I2799848540"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"project"},{"id":"mag:2183512850","doi":null,"is_oa":false,"landing_page_url":"http://www.ijeit.com/vol%202/Issue%2011/IJEIT1412201305_25.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1534830325","https://openalex.org/W1548121165","https://openalex.org/W2004305199","https://openalex.org/W2016024987","https://openalex.org/W2017743431","https://openalex.org/W2023936724","https://openalex.org/W2032284732","https://openalex.org/W2043331236","https://openalex.org/W2064535847","https://openalex.org/W2147069423","https://openalex.org/W2150058384","https://openalex.org/W2531997392","https://openalex.org/W3142851257"],"related_works":["https://openalex.org/W2736233485","https://openalex.org/W4311223083","https://openalex.org/W2806841918","https://openalex.org/W3012696884","https://openalex.org/W2623741009","https://openalex.org/W4220877471","https://openalex.org/W2512391381","https://openalex.org/W2779118688","https://openalex.org/W2921252385","https://openalex.org/W4379932923"],"abstract_inverted_index":{"Cloud":[0,19],"computing":[1,5,20,111,117,121,142],"is":[2,77],"a":[3,72,78,124],"new":[4],"model":[6],"using":[7],"which":[8,113],"applications,":[9],"data":[10,22],"and":[11,23,134],"IT":[12],"services":[13,25],"are":[14,114],"provided":[15],"over":[16],"the":[17,31,39,51,57,89,93,146,158],"Internet.":[18],"shares":[21],"offers":[24],"transparently":[26],"among":[27],"its":[28],"users.":[29],"With":[30],"increase":[32],"in":[33,56,88],"number":[34,82],"of":[35,37,47,74,83,99,103,127],"users":[36],"cloud":[38,48,110,120,141,165],"tasks":[40],"to":[41,91,109,131],"be":[42,107],"scheduled":[43],"increases.":[44],"The":[45,153],"performance":[46],"depends":[49],"on":[50],"task":[52,137,160],"scheduling":[53,58,138,161],"algorithms":[54,84,105,139,162],"used":[55],"components":[59],"or":[60],"brokering":[61],"components.":[62],"Scheduling":[63],"parallel":[64],"applications":[65],"modeled":[66],"by":[67,149],"Directed":[68],"Acyclic":[69],"Graphs":[70],"onto":[71],"network":[73,98,135],"heterogeneous":[75,97,116],"computers":[76],"NP-Complete":[79],"problem.":[80],"A":[81],"have":[85,123],"been":[86],"proposed":[87],"past":[90],"solve":[92],"task-scheduling":[94],"problem":[95],"for":[96,140,164],"computers.":[100],"However,":[101],"none":[102],"these":[104],"can":[106],"extended":[108],"systems":[112,122,143],"also":[115],"systems.":[118],"Since":[119],"high":[125],"degree":[126],"unpredictability":[128],"with":[129],"respect":[130],"resource":[132,151],"availability":[133],"bandwidth,":[136],"should":[144],"incorporate":[145],"latency":[147],"caused":[148],"unpredictable":[150],"availability.":[152],"present":[154],"study":[155],"involves":[156],"surveying":[157],"different":[159],"developed":[163],"environment.":[166]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}