{"id":"https://openalex.org/W2135190791","doi":"https://doi.org/10.1109/ccgrid.2007.56","title":"Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation","display_name":"Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation","publication_year":2007,"publication_date":"2007-05-01","ids":{"openalex":"https://openalex.org/W2135190791","doi":"https://doi.org/10.1109/ccgrid.2007.56","mag":"2135190791"},"language":"en","primary_location":{"id":"doi:10.1109/ccgrid.2007.56","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccgrid.2007.56","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","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/A5113679796","display_name":"Joerg Decker","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Joerg Decker","raw_affiliation_strings":["Technische Universitat Berlin, Germany","Tech. Univ. Berlin, Berlin"],"affiliations":[{"raw_affiliation_string":"Technische Universitat Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Tech. Univ. Berlin, Berlin","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062665265","display_name":"Joerg Schneider","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Joerg Schneider","raw_affiliation_strings":["Technische Universitat Berlin, Germany","Tech. Univ. Berlin, Berlin"],"affiliations":[{"raw_affiliation_string":"Technische Universitat Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Tech. Univ. Berlin, Berlin","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113679796"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":6.3991,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.9671315,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"335","last_page":"342"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.996399998664856,"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"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9930999875068665,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8677422404289246},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.7576635479927063},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.675735354423523},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6651017665863037},{"id":"https://openalex.org/keywords/grid-computing","display_name":"Grid computing","score":0.6466591358184814},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6245381832122803},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.619053065776825},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.47672238945961},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4722535014152527},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23278674483299255},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09421765804290771},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09246161580085754}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8677422404289246},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7576635479927063},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.675735354423523},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6651017665863037},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.6466591358184814},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6245381832122803},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.619053065776825},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.47672238945961},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4722535014152527},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23278674483299255},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09421765804290771},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09246161580085754},{"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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ccgrid.2007.56","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccgrid.2007.56","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.259.3278","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.259.3278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.user.tu-berlin.de/komm/paper/CCGrid07-heuristic-workflow-scheduling.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1489899996","https://openalex.org/W1497299081","https://openalex.org/W1508297467","https://openalex.org/W1584927062","https://openalex.org/W1693765438","https://openalex.org/W1859598804","https://openalex.org/W1917789337","https://openalex.org/W1973531467","https://openalex.org/W2018100839","https://openalex.org/W2026899276","https://openalex.org/W2033676590","https://openalex.org/W2043331236","https://openalex.org/W2057108708","https://openalex.org/W2092333800","https://openalex.org/W2097911714","https://openalex.org/W2113087727","https://openalex.org/W2114603764","https://openalex.org/W2131363892","https://openalex.org/W2149065651","https://openalex.org/W2149294210","https://openalex.org/W2150055106","https://openalex.org/W2152408640","https://openalex.org/W2159139478","https://openalex.org/W6630438185","https://openalex.org/W6635066771"],"related_works":["https://openalex.org/W2099515653","https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W3003077338","https://openalex.org/W2225350526","https://openalex.org/W1545991362"],"abstract_inverted_index":{"Applications":[0],"to":[1,34,40,52,133,139,159],"be":[2,53],"executed":[3],"in":[4,131],"grid":[5,36,150,181],"computing":[6],"environments":[7],"become":[8],"more":[9,11,127],"and":[10,13,47,69,76,102,107,161],"complex":[12],"usually":[14],"consist":[15],"of":[16,23,43,67,118,165,173],"multiple":[17],"interdependent":[18],"tasks.":[19],"The":[20],"coordinated":[21],"execution":[22],"such":[24],"tightly":[25],"or":[26],"loosely":[27],"coupled":[28],"tasks":[29],"often":[30,78],"requires":[31],"simultaneous":[32],"access":[33],"different":[35],"resources.":[37],"This":[38],"leads":[39],"the":[41,59,72,77,115,123,140,163,170],"problem":[42],"resource":[44,74,82,109],"co-allocation.":[45],"Efficient":[46],"robust":[48],"scheduling":[49,91,100,177],"algorithms":[50,92,144],"have":[51,145],"developed":[54],"that":[55,93],"can":[56],"cope":[57],"with":[58,137],"Grid's":[60],"large-":[61],"scale":[62],"distribution,":[63],"a":[64,97,149],"high":[65],"number":[66],"competing":[68],"demanding":[70],"applications,":[71],"inherent":[73],"heterogeneity":[75],"limited":[79],"view":[80],"on":[81,96],"availability.":[83],"In":[84],"this":[85],"paper,":[86],"we":[87],"present":[88],"two":[89],"heuristic":[90],"are":[94],"based":[95],"well-known":[98],"list":[99,120,176],"algorithm":[101,113],"both":[103,166],"support":[104],"co-":[105],"allocation":[106],"advance":[108],"reservation.":[110],"Our":[111],"first":[112],"preserves":[114],"run-time":[116],"efficiency":[117],"greedy":[119],"schedulers":[121],"while":[122],"second":[124],"approach":[125],"incorporates":[126],"sophisticated":[128],"search":[129],"techniques":[130],"order":[132],"achieve":[134],"better":[135],"results":[136],"respect":[138],"performance":[141,164],"metrics.":[142],"Both":[143],"been":[146],"implemented":[147],"within":[148,179],"simulation":[151,155],"framework.":[152],"An":[153],"extensive":[154],"study":[156],"was":[157],"conducted":[158],"evaluate":[160],"compare":[162],"algorithms.":[167],"It":[168],"showed":[169],"general":[171],"suitability":[172],"our":[174],"enhanced":[175],"heuristics":[178],"heterogeneous":[180],"environments.":[182]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}