{"id":"https://openalex.org/W2066786310","doi":"https://doi.org/10.1109/grid.2010.5697955","title":"Cost-driven scheduling of grid workflows using Partial Critical Paths","display_name":"Cost-driven scheduling of grid workflows using Partial Critical Paths","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2066786310","doi":"https://doi.org/10.1109/grid.2010.5697955","mag":"2066786310"},"language":"en","primary_location":{"id":"doi:10.1109/grid.2010.5697955","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grid.2010.5697955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 11th IEEE/ACM International Conference on Grid Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/1c8dc1ab-5560-4027-b3d8-68ebeca24ec2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087227170","display_name":"Saeid Abrishami","orcid":"https://orcid.org/0000-0003-1421-5179"},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Saeid Abrishami","raw_affiliation_strings":["Ferdowsi University of Mashhad, Mashhad, Iran","Ferdowsi University of Mashhad, IRAN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ferdowsi University of Mashhad, Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]},{"raw_affiliation_string":"Ferdowsi University of Mashhad, IRAN","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000670364","display_name":"Mahmoud Naghibzadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mahmoud Naghibzadeh","raw_affiliation_strings":["Ferdowsi University of Mashhad, Mashhad, Iran","Ferdowsi University of Mashhad, IRAN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ferdowsi University of Mashhad, Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]},{"raw_affiliation_string":"Ferdowsi University of Mashhad, IRAN","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049227990","display_name":"Dick Epema","orcid":"https://orcid.org/0000-0002-1015-0075"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Dick Epema","raw_affiliation_strings":["Delft University of Technnology, Delft, Netherlands","Delft University of Technology, The Netherlands;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Delft University of Technnology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, The Netherlands;","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":47,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"81","last_page":"88"},"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.9976999759674072,"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.9962000250816345,"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.8548990488052368},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.7356761693954468},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.7049190998077393},{"id":"https://openalex.org/keywords/provisioning","display_name":"Provisioning","score":0.6469835638999939},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6126143336296082},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6114728450775146},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.5369967818260193},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5352974534034729},{"id":"https://openalex.org/keywords/workflow-management-system","display_name":"Workflow management system","score":0.4880141317844391},{"id":"https://openalex.org/keywords/grid-computing","display_name":"Grid computing","score":0.44112277030944824},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4286339282989502},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3375122547149658},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19736802577972412},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.15069440007209778},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06539544463157654}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8548990488052368},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7356761693954468},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.7049190998077393},{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.6469835638999939},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6126143336296082},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6114728450775146},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.5369967818260193},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5352974534034729},{"id":"https://openalex.org/C140824633","wikidata":"https://www.wikidata.org/wiki/Q2808660","display_name":"Workflow management system","level":3,"score":0.4880141317844391},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.44112277030944824},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4286339282989502},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3375122547149658},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19736802577972412},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.15069440007209778},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06539544463157654},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/grid.2010.5697955","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grid.2010.5697955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 11th IEEE/ACM International Conference on Grid Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire/1c8dc1ab-5560-4027-b3d8-68ebeca24ec2","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/1c8dc1ab-5560-4027-b3d8-68ebeca24ec2","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abrishami, S, Naghibzadeh, M & Epema, D H J 2010, Cost-driven scheduling of grid workflows using partial critical paths. in Proceedings of the 11th IEEE/ACM International Conference on Grid Computing (GRID 2010, Brussels, Belgium, October 25-28, 2011). Institute of Electrical and Electronics Engineers, pp. 81-88. https://doi.org/10.1109/GRID.2010.5697955","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/1c8dc1ab-5560-4027-b3d8-68ebeca24ec2","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/1c8dc1ab-5560-4027-b3d8-68ebeca24ec2","pdf_url":"https://research.tue.nl/nl/publications/1c8dc1ab-5560-4027-b3d8-68ebeca24ec2","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 11th IEEE/ACM International Conference on Grid Computing (GRID 2010, Brussels, Belgium, October 25-28, 2011), 81 - 88","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:719111","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=719111","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.849.9305","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.849.9305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://alexandria.tue.nl/openaccess/Metis255877.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:719111","is_oa":false,"landing_page_url":"http://repository.tue.nl/719111","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/1c8dc1ab-5560-4027-b3d8-68ebeca24ec2","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/1c8dc1ab-5560-4027-b3d8-68ebeca24ec2","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abrishami, S, Naghibzadeh, M & Epema, D H J 2010, Cost-driven scheduling of grid workflows using partial critical paths. in Proceedings of the 11th IEEE/ACM International Conference on Grid Computing (GRID 2010, Brussels, Belgium, October 25-28, 2011). Institute of Electrical and Electronics Engineers, pp. 81-88. https://doi.org/10.1109/GRID.2010.5697955","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W101943479","https://openalex.org/W157714560","https://openalex.org/W1970072150","https://openalex.org/W1973485348","https://openalex.org/W1984483497","https://openalex.org/W1998082182","https://openalex.org/W2003379648","https://openalex.org/W2011039300","https://openalex.org/W2014438294","https://openalex.org/W2025577327","https://openalex.org/W2027929673","https://openalex.org/W2040466547","https://openalex.org/W2095930915","https://openalex.org/W2099389501","https://openalex.org/W2100550451","https://openalex.org/W2105172797","https://openalex.org/W2105908337","https://openalex.org/W2112943392","https://openalex.org/W2114719509","https://openalex.org/W2122410182","https://openalex.org/W2125269358","https://openalex.org/W2129666400","https://openalex.org/W2137296062","https://openalex.org/W2147062065","https://openalex.org/W2148532168","https://openalex.org/W2149294210","https://openalex.org/W2151784270","https://openalex.org/W2151975141","https://openalex.org/W2152862405","https://openalex.org/W2154155617","https://openalex.org/W2157825676","https://openalex.org/W2162528252","https://openalex.org/W2163838422","https://openalex.org/W2164340292","https://openalex.org/W2171872029","https://openalex.org/W2476096155","https://openalex.org/W2536216700","https://openalex.org/W2737433120","https://openalex.org/W4248761227"],"related_works":["https://openalex.org/W2017432143","https://openalex.org/W1973694374","https://openalex.org/W2983574358","https://openalex.org/W2370475531","https://openalex.org/W4385924768","https://openalex.org/W4256551238","https://openalex.org/W2610550183","https://openalex.org/W2914112812","https://openalex.org/W3011443213","https://openalex.org/W2098886869"],"abstract_inverted_index":{"Recently,":[0],"utility":[1,47],"grids":[2,48],"have":[3],"emerged":[4],"as":[5,59,61],"a":[6,36,73,81,97,114],"new":[7,74],"model":[8],"of":[9,27,41,55,65,109,124],"service":[10],"provisioning":[11],"in":[12,46],"heterogeneous":[13],"distributed":[14],"systems.":[15],"In":[16,68],"this":[17,69],"model,":[18],"users":[19],"negotiate":[20],"with":[21],"providers":[22],"on":[23,30,80],"their":[24],"required":[25],"Quality":[26],"Service":[28,37],"and":[29],"the":[31,42,53,63,92,107,122],"corresponding":[32],"price":[33],"to":[34,105],"reach":[35],"Level":[38],"Agreement.":[39],"One":[40],"most":[43],"challenging":[44],"problems":[45],"is":[49,127],"workflow":[50,66,76,110],"scheduling,":[51],"i.e.,":[52],"problem":[54],"satisfying":[56],"users'":[57],"QoS":[58],"well":[60],"minimizing":[62],"cost":[64,108],"execution.":[67],"paper,":[70],"we":[71],"propose":[72],"QoS-based":[75],"scheduling":[77],"algorithm":[78,89,103,126],"based":[79],"novel":[82],"concept":[83],"called":[84],"Partial":[85],"Critical":[86],"Path.":[87],"This":[88],"recursively":[90],"schedules":[91],"critical":[93],"path":[94],"ending":[95],"at":[96],"recently":[98],"scheduled":[99],"node.":[100],"The":[101,117],"proposed":[102],"tries":[104],"minimize":[106],"execution":[111],"while":[112],"meeting":[113],"user-defined":[115],"deadline.":[116],"simulation":[118],"results":[119],"show":[120],"that":[121],"performance":[123],"our":[125],"very":[128],"promising.":[129]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}