A fault-tolerant workflow mapping algorithm under end-to-end delay constraint

Keyphrases

• End-to-end Delay Bound 100%
• Mapping Algorithm 100%
• Workflow Mapping 100%
• Fault-tolerant 100%
• Scheduling Algorithm 40%
• High Reliability 40%
• Communication Failure 40%
• Negative Impact 20%
• Execution Time 20%
• Efficient Scheduling 20%
• Heterogeneous Distributed Computing 20%
• Execution Delay 20%
• Two-step Procedure 20%
• Computing Node 20%
• Distributed Computing Environment 20%
• System Reliability 20%
• Scientific Workflows 20%
• Hybrid Mapping 20%
• Failure Rate 20%
• Node-Link 20%
• Directed Acyclic Graph 20%
• Lower End 20%
• Conflicting Requirements 20%
• Layered Structure 20%
• Path Search 20%
• Time Constraints 20%
• Active Research 20%
• Efficient Mapping 20%

Computer Science

• Mapping Algorithm 100%
• Fault Tolerant 100%
• End-to-end Delay Constraint 100%
• End-to-End Delay 60%
• Critical Path 60%
• Scheduling Algorithm 40%
• High Reliability 40%
• Experimental Result 20%
• Execution Time 20%
• Scientific Workflow 20%
• Negative Impact 20%
• Active Research 20%
• Directed Acyclic Graph 20%
• Distributed Computing Environment 20%
• Communication Link 20%
• Time Constraint 20%