{"id":"https://openalex.org/W2414459484","doi":"https://doi.org/10.1142/s0129626416500092","title":"On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints","display_name":"On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2414459484","doi":"https://doi.org/10.1142/s0129626416500092","mag":"2414459484"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626416500092","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626416500092","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5100322850","display_name":"Yang Wang","orcid":"https://orcid.org/0000-0002-9721-4923"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang Wang","raw_affiliation_strings":["Center for Cloud Computing, Shenzhen Institute of Advanced Technology, Chinese Academy of Science, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Cloud Computing, Shenzhen Institute of Advanced Technology, Chinese Academy of Science, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Wei Shi","orcid":null},"institutions":[{"id":"https://openalex.org/I39470171","display_name":"Ontario Tech University","ror":"https://ror.org/016zre027","country_code":"CA","type":"education","lineage":["https://openalex.org/I39470171"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Wei Shi","raw_affiliation_strings":["Faculty of Business and I.T., University of Ontario Institute of Technology, Oshawa, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Business and I.T., University of Ontario Institute of Technology, Oshawa, ON, Canada","institution_ids":["https://openalex.org/I39470171"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067605823","display_name":"Kenneth B. Kent","orcid":"https://orcid.org/0000-0003-2764-823X"},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kenneth B. Kent","raw_affiliation_strings":["Faculty of Computer Science, University of New Brunswick, Fredericton, NB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, University of New Brunswick, Fredericton, NB, Canada","institution_ids":["https://openalex.org/I106938459"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5666,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70885857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"26","issue":"02","first_page":"1650009","last_page":"1650009"},"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.9998999834060669,"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.9998999834060669,"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/T11986","display_name":"Scientific Computing and Data Management","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9983000159263611,"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.7857664823532104},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.6504379510879517},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6050599813461304},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5502795577049255},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46491557359695435},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45522579550743103},{"id":"https://openalex.org/keywords/provisioning","display_name":"Provisioning","score":0.4324072003364563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3408634662628174},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33771613240242004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15452322363853455}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7857664823532104},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.6504379510879517},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6050599813461304},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5502795577049255},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46491557359695435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45522579550743103},{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.4324072003364563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3408634662628174},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33771613240242004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15452322363853455},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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":1,"locations":[{"id":"doi:10.1142/s0129626416500092","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626416500092","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320323028","display_name":"Atlantic Canada Opportunities Agency","ror":"https://ror.org/03jp5g380"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1983833794","https://openalex.org/W2013344760","https://openalex.org/W2037496036","https://openalex.org/W2086168649","https://openalex.org/W2089898547","https://openalex.org/W2117963990","https://openalex.org/W2119381135","https://openalex.org/W2128548442","https://openalex.org/W2135814502","https://openalex.org/W4245364960"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W3177799343","https://openalex.org/W2785227142","https://openalex.org/W572531444","https://openalex.org/W2945962340"],"abstract_inverted_index":{"In":[0],"this":[1,97,115],"paper,":[2],"we":[3,46,92],"consider":[4,93],"optimal":[5,48],"scheduling":[6,58],"algorithms":[7,49,64],"for":[8,53],"scientific":[9],"workows":[10,55],"with":[11,56],"two":[12],"typical":[13],"structures,":[14],"fork&join":[15],"and":[16,27],"tree,":[17],"on":[18],"a":[19,35,41,61,124],"set":[20],"of":[21,78,96,107],"provisioned":[22],"(virtual)":[23],"machines":[24],"under":[25],"budget":[26,37,70],"deadline":[28,106],"constraints":[29],"in":[30,50,80,89],"cloud":[31],"computing.":[32],"First,":[33],"given":[34],"total":[36,69],"B,":[38],"by":[39,75],"leveraging":[40],"bi-step":[42],"dynamic":[43],"programming":[44],"technique,":[45],"propose":[47],"pseudo-polynomial":[51],"time":[52],"both":[54],"minimum":[57],"length":[59],"as":[60],"goal.":[62],"Our":[63],"are":[65],"efficient":[66],"if":[67],"the":[68,76,86,94,102,105,108,118],"B":[71],"is":[72,84,111],"polynomially":[73],"bounded":[74],"number":[77],"jobs":[79],"respective":[81],"workows,":[82],"which":[83],"usually":[85],"common":[87],"case":[88],"practice.":[90],"Second,":[91],"dual":[95],"optimization":[98],"problem":[99,116,122],"to":[100],"minimize":[101],"cost":[103],"when":[104],"computation":[109],"D":[110],"fixed.":[112],"We":[113],"change":[114],"into":[117],"standard":[119],"multiple-choice":[120],"knapsack":[121],"via":[123],"parallel":[125],"transformation.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}