{"id":"https://openalex.org/W2101137193","doi":"https://doi.org/10.1109/hpcc.2011.81","title":"A Fault-Tolerant Workflow Mapping Algorithm under End-to-End Delay Constraint","display_name":"A Fault-Tolerant Workflow Mapping Algorithm under End-to-End Delay Constraint","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W2101137193","doi":"https://doi.org/10.1109/hpcc.2011.81","mag":"2101137193"},"language":"en","primary_location":{"id":"doi:10.1109/hpcc.2011.81","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcc.2011.81","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on High Performance Computing and Communications","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/A5050692367","display_name":"Fei Cao","orcid":"https://orcid.org/0000-0001-9191-4278"},"institutions":[{"id":"https://openalex.org/I110378019","display_name":"Southern Illinois University Carbondale","ror":"https://ror.org/049kefs16","country_code":"US","type":"education","lineage":["https://openalex.org/I110378019","https://openalex.org/I2801502357"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fei Cao","raw_affiliation_strings":["Computer Science Department, Southem Illinois University at Carbondale, Carbondale, IL, USA","Comput. Sci. Dept., Southern Illinois Univ., Carbondale, IL, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Southem Illinois University at Carbondale, Carbondale, IL, USA","institution_ids":["https://openalex.org/I110378019"]},{"raw_affiliation_string":"Comput. Sci. Dept., Southern Illinois Univ., Carbondale, IL, USA#TAB#","institution_ids":["https://openalex.org/I110378019"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108642672","display_name":"Mengxia Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I110378019","display_name":"Southern Illinois University Carbondale","ror":"https://ror.org/049kefs16","country_code":"US","type":"education","lineage":["https://openalex.org/I110378019","https://openalex.org/I2801502357"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mengxia Zhu","raw_affiliation_strings":["Computer Science Department, Southem Illinois University at Carbondale, Carbondale, IL, USA","Comput. Sci. Dept., Southern Illinois Univ., Carbondale, IL, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Southem Illinois University at Carbondale, Carbondale, IL, USA","institution_ids":["https://openalex.org/I110378019"]},{"raw_affiliation_string":"Comput. Sci. Dept., Southern Illinois Univ., Carbondale, IL, USA#TAB#","institution_ids":["https://openalex.org/I110378019"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050692367"],"corresponding_institution_ids":["https://openalex.org/I110378019"],"apc_list":null,"apc_paid":null,"fwci":0.3501,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.63747961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":null,"first_page":"575","last_page":"580"},"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.9994000196456909,"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.9983000159263611,"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.7895560264587402},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5957291126251221},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.5834367871284485},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5818475484848022},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.5794310569763184},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5505892038345337},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5482866168022156},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.5296570658683777},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.48929306864738464},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.45661988854408264},{"id":"https://openalex.org/keywords/end-to-end-principle","display_name":"End-to-end principle","score":0.4535844624042511},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.430209755897522},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.4204234480857849},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41222095489501953},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20573097467422485},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11639994382858276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09168913960456848}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7895560264587402},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5957291126251221},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.5834367871284485},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5818475484848022},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5794310569763184},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5505892038345337},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5482866168022156},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.5296570658683777},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.48929306864738464},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.45661988854408264},{"id":"https://openalex.org/C74296488","wikidata":"https://www.wikidata.org/wiki/Q2527392","display_name":"End-to-end principle","level":2,"score":0.4535844624042511},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.430209755897522},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.4204234480857849},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41222095489501953},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20573097467422485},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11639994382858276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09168913960456848},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcc.2011.81","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcc.2011.81","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on High Performance Computing and Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W77608668","https://openalex.org/W1549134103","https://openalex.org/W1769961177","https://openalex.org/W1911403303","https://openalex.org/W1969636218","https://openalex.org/W1979852771","https://openalex.org/W1997759712","https://openalex.org/W2010868970","https://openalex.org/W2023753260","https://openalex.org/W2040466547","https://openalex.org/W2066684825","https://openalex.org/W2117122170","https://openalex.org/W2118396891","https://openalex.org/W2125441055","https://openalex.org/W2126432586","https://openalex.org/W2147062065","https://openalex.org/W2151537101","https://openalex.org/W2161563409","https://openalex.org/W2163316030","https://openalex.org/W2502248785","https://openalex.org/W2612791945","https://openalex.org/W2616526234","https://openalex.org/W4211190198","https://openalex.org/W4285719527","https://openalex.org/W6603158889","https://openalex.org/W6632683522","https://openalex.org/W6677457521","https://openalex.org/W6682312617","https://openalex.org/W6684090791"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W1998712144","https://openalex.org/W3164774158","https://openalex.org/W2372211403","https://openalex.org/W4297817344","https://openalex.org/W1498463151"],"abstract_inverted_index":{"In":[0,23,110,156],"recent":[1],"years,":[2],"distributed":[3,26],"scientific":[4],"workflows":[5],"structured":[6],"as":[7],"directed":[8],"acyclic":[9],"graph":[10],"(DAG)":[11],"are":[12,35,146,166],"widely":[13],"applied":[14],"to":[15,19,51,73,78,130,150],"various":[16],"research":[17,66],"areas":[18],"enable":[20],"science":[21],"discovery.":[22],"a":[24,83,107,114,171],"heterogeneous":[25],"computing":[27,29],"environment,":[28],"nodes":[30,169],"and":[31,37,48,58,85,104,123,142],"communication":[32,143],"link":[33],"failures":[34],"inevitable":[36],"could":[38],"have":[39,62],"an":[40],"negative":[41],"impact":[42],"on":[43,162],"the":[44,54,59,101,111,132,137,152,157,160,163,181,186,196,203],"applications.":[45],"Efficient":[46],"mapping":[47,84,116],"scheduling":[49,86],"algorithms":[50],"achieve":[52,131],"both":[53,75,100],"low":[55],"end-to-end":[56,134],"delay":[57,103],"high":[60],"reliability":[61,105,176,201],"been":[63],"attracting":[64],"active":[65],"interests.":[67],"However,":[68],"it":[69],"is":[70,128],"not":[71],"possible":[72],"optimize":[74],"objectives":[76],"due":[77],"conflicting":[79],"requirements.":[80],"We":[81],"proposed":[82],"algorithm,":[87],"namely":[88],"Fault-tolerant":[89],"Workflow":[90],"Mapping":[91],"Algorithm":[92],"under":[93,180,202],"End-to-end":[94],"Delay":[95],"Constraint":[96],"(FMEDC),":[97],"which":[98],"considers":[99],"execution":[102,154],"in":[106,170,185],"two-step":[108],"procedure.":[109],"first":[112,187],"step,":[113,159],"hybrid":[115],"algorithm":[117,194],"combining":[118],"recursive":[119],"critical":[120,138],"path":[121],"searching":[122],"layer-based":[124],"priority":[125],"techniques":[126],"(HCPT)":[127],"developed":[129],"minimum":[133],"delay(MED)":[135],"along":[136],"path.":[139],"The":[140],"computation":[141],"failure":[144],"rates":[145],"factored":[147],"into":[148],"equation":[149],"compute":[151],"reliability-enhanced":[153],"time.":[155],"second":[158],"modules":[161],"non-critical":[164],"paths":[165],"rescheduled":[167],"onto":[168],"way":[172],"such":[173],"that":[174,192],"system":[175],"can":[177],"be":[178],"improved":[179],"MED":[182,198],"constraint":[183],"calculated":[184],"step.":[188],"Experimental":[189],"results":[190],"show":[191],"our":[193],"achieves":[195],"lowest":[197],"but":[199],"highest":[200],"same":[204],"time":[205],"constraints":[206],"compared":[207],"with":[208],"some":[209],"representative":[210],"algorithms.":[211]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}