给出针对普通任务图带通信限制的基于复制调度算法TDMSCL。
Proposed a duplication based task scheduling algorithm with communication limits for general task graph, TDMSCL.
任何一种基于复制的调度算法都可以和它结合使用。
Any duplication based task scheduling algorithm can integrate it easily.
目前的调度算法大多是基于任务复制的，没有充分考虑前驱任务与其后继任务间的相关性。
The present scheduling algorithms are mostly based on task duplication, and the dependence between the predecessor tasks and successor tasks is not well taken into account.
与以往容错调度算法不同的是，此算法是在被动进程复制模式下、适合于异构分布式系统的容错调度算法。
And the algorithms 'complexity is presented. Different from the previous work, the new fault-tolerant process model is based on the passive process replica model.
与以往容错调度算法不同的是，此算法是在被动进程复制模式下、适合于异构分布式系统的容错调度算法。
And the algorithms 'complexity is presented. Different from the previous work, the new fault-tolerant process model is based on the passive process replica model.
应用推荐