{"id":"https://openalex.org/W2890946851","doi":"https://doi.org/10.4149/cai_2018_4_838","title":"Cost-Efficient Scheduling for Deadline Constrained Grid Workflows","display_name":"Cost-Efficient Scheduling for Deadline Constrained Grid Workflows","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2890946851","doi":"https://doi.org/10.4149/cai_2018_4_838","mag":"2890946851"},"language":"en","primary_location":{"id":"doi:10.4149/cai_2018_4_838","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_4_838","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.4149/cai_2018_4_838","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007355723","display_name":"Alireza Dehlaghi-Ghadim","orcid":"https://orcid.org/0000-0001-5332-1033"},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Alireza Dehlaghi-Ghadim","raw_affiliation_strings":["School of Electrical and Computer Engineering, University of Tehran"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Tehran","institution_ids":["https://openalex.org/I23946033"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014010310","display_name":"Reza Entezari\u2010Maleki","orcid":"https://orcid.org/0000-0003-3356-661X"},"institutions":[{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Reza Entezari-Maleki","raw_affiliation_strings":["School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran","institution_ids":["https://openalex.org/I4210146419"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089228487","display_name":"Ali Movaghar","orcid":"https://orcid.org/0000-0002-6803-6750"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ali Movaghar","raw_affiliation_strings":["Department of Computer Engineering, Sharif University of Technology, Tehran"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sharif University of Technology, Tehran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007355723"],"corresponding_institution_ids":["https://openalex.org/I23946033"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11759187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"37","issue":"4","first_page":"838","last_page":"864"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9994000196456909,"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":0.9994000196456909,"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.9976000189781189,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.968500018119812,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8719162940979004},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.6207680106163025},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6100497245788574},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5978115200996399},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5735067129135132},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.562787652015686},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.526475191116333},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5114485025405884},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.4863005578517914},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.46225494146347046},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4488457143306732},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42628639936447144},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.4188844859600067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32648569345474243},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2793855667114258},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10631385445594788},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08002033829689026}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8719162940979004},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.6207680106163025},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6100497245788574},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5978115200996399},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5735067129135132},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.562787652015686},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.526475191116333},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5114485025405884},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.4863005578517914},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.46225494146347046},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4488457143306732},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42628639936447144},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.4188844859600067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32648569345474243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2793855667114258},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10631385445594788},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08002033829689026},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4149/cai_2018_4_838","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_4_838","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4149/cai_2018_4_838","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_4_838","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2245286458","https://openalex.org/W2184166483","https://openalex.org/W2076947091","https://openalex.org/W4300092030","https://openalex.org/W2172075652","https://openalex.org/W2167574351","https://openalex.org/W2367142822","https://openalex.org/W2007437247","https://openalex.org/W172774100","https://openalex.org/W2393789493"],"abstract_inverted_index":{"Cost":[0],"optimization":[1],"for":[2,146],"workflow":[3,54,63,183],"scheduling":[4,23,142,151,184],"while":[5],"meeting":[6],"deadline":[7,46,119],"is":[8,28,45,56,115,159],"one":[9],"of":[10,36,62,76,133,149],"the":[11,34,53,86,105,122,128,141,147,156,166,176],"fundamental":[12],"problems":[13],"in":[14,39,52,111],"utility":[15],"computing.":[16],"In":[17,85,104],"this":[18],"paper,":[19],"a":[20,96,150],"two-phase":[21],"cost-efficient":[22],"algorithm":[24,32,123,152,158,178],"called":[25],"critical":[26,59,74],"chain":[27,66],"presented.":[29],"The":[30,42],"proposed":[31,157,177],"uses":[33,67],"concept":[35],"slack":[37,68,108],"time":[38,69,109],"both":[40],"phases.":[41],"first":[43],"phase":[44,88],"distribution":[47],"over":[48],"all":[49],"tasks":[50,77,135],"existing":[51,163,182],"which":[55],"done":[57],"considering":[58,101,165],"path":[60],"properties":[61],"graphs.":[64],"Critical":[65],"to":[70,82,94,98,117,125],"iteratively":[71],"select":[72],"most":[73],"sequence":[75],"and":[78,130,155],"then":[79],"assigns":[80],"sub-deadlines":[81],"those":[83],"tasks.":[84],"second":[87],"named":[89],"mapping":[90,106],"step,":[91,107],"it":[92],"tries":[93,124],"allocate":[95],"server":[97],"each":[99],"task":[100,114],"task's":[102],"sub-deadline.":[103],"priority":[110],"selecting":[112],"ready":[113],"used":[116],"reduce":[118],"violation.":[120],"Furthermore,":[121],"locally":[126],"optimize":[127],"computation":[129],"communication":[131],"costs":[132],"sequential":[134],"exploiting":[136],"dynamic":[137],"programming.":[138],"After":[139],"proposing":[140],"algorithm,":[143],"three":[144],"measures":[145],"superiority":[148],"are":[153],"introduced,":[154],"compared":[160],"with":[161],"other":[162],"algorithms":[164],"measures.":[167],"Results":[168],"obtained":[169],"from":[170],"simulating":[171],"various":[172],"systems":[173],"show":[174],"that":[175],"outperforms":[179],"four":[180],"well-known":[181],"algorithms.":[185]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}