{"id":"https://openalex.org/W2013451666","doi":null,"title":"RASA-A New Grid Task Scheduling Algorithm.","display_name":"RASA-A New Grid Task Scheduling Algorithm.","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2013451666","mag":"2013451666"},"language":"en","primary_location":{"id":"mag:2013451666","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/jdcta/jdcta3.html#ParsaE09","pdf_url":null,"source":{"id":"https://openalex.org/S112686501","display_name":"International Journal of Digital Content Technology and its Applications","issn_l":"1975-9339","issn":["1975-9339","2233-9310"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322758553","host_organization_name":"Advanced Institute of Convergence Information Technology Research Center","host_organization_lineage":["https://openalex.org/P4322758553"],"host_organization_lineage_names":["Advanced Institute of Convergence Information Technology Research Center"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Digital Content Technology and its Applications","raw_type":null},"volume":null,"type":"article","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/A5039758530","display_name":"Saeed Alipour Parsa","orcid":"https://orcid.org/0000-0003-4381-2773","observed_orcids":["https://orcid.org/0000-0003-4381-2773"]},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Saeed Parsa","raw_affiliation_strings":["Iran University of Science and Technology"],"raw_orcid":"https://orcid.org/0000-0003-4381-2773","affiliations":[{"raw_affiliation_string":"Iran University of Science and Technology","institution_ids":["https://openalex.org/I67009956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014010310","display_name":"Reza Entezari\u2010Maleki","orcid":"https://orcid.org/0000-0003-3356-661X","observed_orcids":["https://orcid.org/0000-0003-3356-661X"]},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Reza Entezari\u2010Maleki","raw_affiliation_strings":["Iran University of Science and Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iran University of Science and Technology","institution_ids":["https://openalex.org/I67009956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I67009956"],"apc_list":null,"apc_paid":null,"fwci":5.6301,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.95376011,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"3","issue":null,"first_page":"91","last_page":"99"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.0,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/grid-task-scheduling","display_name":"grid task scheduling","score":0.8569999933242798},{"id":"https://openalex.org/keywords/min-min-scheduling","display_name":"min-min scheduling","score":0.8090000152587891},{"id":"https://openalex.org/keywords/max-min-scheduling","display_name":"max-min scheduling","score":0.9980000257492065},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.8119999766349792},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.49000000953674316},{"id":"https://openalex.org/keywords/independent-tasks","display_name":"independent tasks","score":0.6439999938011169},{"id":"https://openalex.org/keywords/concurrency","display_name":"concurrency","score":0.3050000071525574}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.905990481376648},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.633890688419342},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6174722909927368},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6051976084709167},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.5605869889259338},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5258148908615112},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4630802571773529},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4607364535331726},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.43407002091407776},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24792179465293884},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.06566205620765686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.059283673763275146},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.048763155937194824},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.04584944248199463},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2013451666","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/jdcta/jdcta3.html#ParsaE09","pdf_url":null,"source":{"id":"https://openalex.org/S112686501","display_name":"International Journal of Digital Content Technology and its Applications","issn_l":"1975-9339","issn":["1975-9339","2233-9310"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322758553","host_organization_name":"Advanced Institute of Convergence Information Technology Research Center","host_organization_lineage":["https://openalex.org/P4322758553"],"host_organization_lineage_names":["Advanced Institute of Convergence Information Technology Research Center"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Digital Content Technology and its Applications","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1968036292","https://openalex.org/W1988133139","https://openalex.org/W1996689181","https://openalex.org/W2003722640","https://openalex.org/W2025397485","https://openalex.org/W2045259716","https://openalex.org/W2075243474","https://openalex.org/W2098172017","https://openalex.org/W2105554094","https://openalex.org/W2121517929","https://openalex.org/W2135938932","https://openalex.org/W2137059783"],"related_works":["https://openalex.org/W2188905909","https://openalex.org/W7100835704","https://openalex.org/W142260494","https://openalex.org/W1896158609","https://openalex.org/W2029194229","https://openalex.org/W1488602162","https://openalex.org/W2538850974","https://openalex.org/W1848660176","https://openalex.org/W2133573162","https://openalex.org/W400909941"],"abstract_inverted_index":{"In":[0,80],"this":[1,81],"paper,":[2],"a":[3,26],"new":[4],"task":[5,35],"scheduling":[6,36,131],"algorithm":[7,22],"called":[8],"RASA,":[9],"considering":[10],"the":[11,45,58,62,67,74,85,93,98,105,108,116,119,138],"distribution":[12],"and":[13,29,39,48,71,76,96,111,121],"scalability":[14],"characteristics":[15],"of":[16,31,44,61,66,107,118,127,140],"grid":[17,69,135],"resources,":[18,70],"is":[19,23],"proposed.":[20],"The":[21],"built":[24],"through":[25],"comprehensive":[27],"study":[28],"analysis":[30],"two":[32],"well":[33],"known":[34],"algorithms,":[37,78],"Min-min":[38,77,86],"Max-min.":[40],"RASA":[41,55,83,129,141],"takes":[42],"advantages":[43],"both":[46],"algorithms":[47],"avoids":[49],"their":[50],"drawbacks.":[51],"To":[52],"achieve":[53],"this,":[54],"firstly":[56],"estimates":[57],"completion":[59],"time":[60],"tasks":[63,91,110,133],"on":[64,130],"each":[65],"available":[68],"then":[72],"applies":[73,97],"Maxmin":[75,99],"alternatively.":[79],"respect,":[82],"uses":[84],"strategy":[87,100],"to":[88,101,112],"execute":[89],"small":[90,122],"before":[92],"large":[94,109,120],"ones,":[95],"avoid":[102],"delays":[103],"in":[104,115,142],"execution":[106,117],"support":[113],"concurrency":[114],"tasks.":[123],"Our":[124],"experimental":[125],"results":[126],"applying":[128],"independent":[132],"within":[134],"environments":[136],"demonstrate":[137],"applicability":[139],"achieving":[143],"schedules":[144],"with":[145],"comparatively":[146],"lower":[147],"makespan.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}