{"id":"https://openalex.org/W2148673664","doi":"https://doi.org/10.1109/hpcsim.2011.5999812","title":"A hybrid scheduling technique for grid workflows in advance reservation environments","display_name":"A hybrid scheduling technique for grid workflows in advance reservation environments","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2148673664","doi":"https://doi.org/10.1109/hpcsim.2011.5999812","mag":"2148673664"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2011.5999812","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2011.5999812","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on High Performance Computing & Simulation","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/A5004581637","display_name":"Jawad Ashraf","orcid":null},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jawad Ashraf","raw_affiliation_strings":["Department of Computer Science, University of Leicester, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester, UK","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["Department of Computer Science, University of Leicester, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester, UK","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004581637"],"corresponding_institution_ids":["https://openalex.org/I153648349"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20100962,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":null,"first_page":"98","last_page":"106"},"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.9980999827384949,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9970999956130981,"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/computer-science","display_name":"Computer science","score":0.8139950037002563},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.7253658175468445},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6672120094299316},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6437464952468872},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6028454899787903},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.594143807888031},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.5606350898742676},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5314204692840576},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.516913652420044},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.509711742401123},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4963544011116028},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.4927683174610138},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3298264741897583},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26054877042770386},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1730836033821106},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.088369220495224},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06619665026664734},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.06442958116531372},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06394407153129578}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8139950037002563},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.7253658175468445},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6672120094299316},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6437464952468872},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6028454899787903},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.594143807888031},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.5606350898742676},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5314204692840576},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.516913652420044},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.509711742401123},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4963544011116028},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.4927683174610138},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3298264741897583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26054877042770386},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1730836033821106},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.088369220495224},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06619665026664734},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.06442958116531372},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06394407153129578},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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.1109/hpcsim.2011.5999812","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2011.5999812","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on High Performance Computing & Simulation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"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":22,"referenced_works":["https://openalex.org/W1564502119","https://openalex.org/W1588462524","https://openalex.org/W1805675064","https://openalex.org/W1859598804","https://openalex.org/W1973131489","https://openalex.org/W2009646009","https://openalex.org/W2046255109","https://openalex.org/W2057392949","https://openalex.org/W2103128343","https://openalex.org/W2116319227","https://openalex.org/W2140617484","https://openalex.org/W2149294210","https://openalex.org/W2153829863","https://openalex.org/W2164340292","https://openalex.org/W2168761098","https://openalex.org/W2169528473","https://openalex.org/W2531284070","https://openalex.org/W3150630553","https://openalex.org/W6633904738","https://openalex.org/W6638559422","https://openalex.org/W6677417246","https://openalex.org/W6684780599"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2372008037","https://openalex.org/W3036719625","https://openalex.org/W2225350526","https://openalex.org/W2106332846","https://openalex.org/W2978148977","https://openalex.org/W4390711934","https://openalex.org/W2167574351","https://openalex.org/W4390722068"],"abstract_inverted_index":{"Scheduling":[0],"workflows":[1],"in":[2,112],"Grids":[3],"with":[4,93,118],"the":[5,9,23,28,42,46,86,101,104,124],"goal":[6],"of":[7,45,58,88,103,132],"minimizing":[8],"completion":[10],"time":[11],"is":[12,121],"a":[13,55,75],"challenging":[14],"optimisation":[15],"problem.":[16],"Communication":[17],"times":[18,65],"between":[19,66],"dependent":[20,67],"tasks":[21,29,68],"affect":[22],"schedule":[24],"length":[25],"only":[26],"if":[27],"are":[30],"scheduled":[31,47],"on":[32,85,136],"different":[33,82],"resources,":[34],"and":[35,98],"this":[36,51],"makes":[37],"it":[38,120],"difficult":[39],"to":[40,134,140],"predict":[41],"critical":[43,59],"path":[44,60],"workflow.":[48],"To":[49],"address":[50],"difficulty,":[52],"we":[53,73],"introduce":[54],"new":[56],"variation":[57],"scheduling":[61,77,111,127],"that":[62,79,123],"ignores":[63],"communication":[64],"under":[69],"certain":[70],"conditions.":[71],"Furthermore,":[72],"propose":[74],"hybrid":[76,126],"method":[78,128],"computes":[80],"five":[81],"schedules,":[83],"based":[84],"combination":[87],"two":[89],"resource":[90],"selection":[91,96],"rules":[92],"four":[94],"job":[95],"rules,":[97],"then":[99],"uses":[100],"best":[102],"five.":[105],"In":[106],"simulation":[107],"experiments":[108],"for":[109],"workflow":[110],"an":[113],"advance":[114],"reservation":[115],"environment":[116],"conducted":[117],"GridSim,":[119],"shown":[122],"proposed":[125],"achieves":[129],"makespan":[130],"improvements":[131],"up":[133],"25.5%":[135],"benchmark":[137],"workflows,":[138],"compared":[139],"previous":[141],"methods.":[142]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}