In this paper, we describe a two-phase scheme to determine a scheduling of tasks with precedence con-straints that employ a reliability measure as one of the objectives in a Real-Time and heterogeneous distributed sys...In this paper, we describe a two-phase scheme to determine a scheduling of tasks with precedence con-straints that employ a reliability measure as one of the objectives in a Real-Time and heterogeneous distributed sys-tem. The simulation results show that, for task graphs with precedence constraints in a heterogeneous Real-Timesystem, the method performs significantly better than the two algorithms presented that do not consider reliabilitycost. Furthermore, the results suggest that higher computational heterogeneity is conducive to improving the schedu-lability of the reliability cost-driven (RCD)algorithm, while the opposite is true for the two non-RCD algorithms.展开更多
在对网格计算的研究中,有人考虑了计算资源中服务质量(QoS)因素,在对传统的 Min Min算法加以改进的基础上,提出了QoS Guided Min Min算法。在此基础上,本文提出一种新的扩展型算法,以进一步提高网格资源的利用率。最后,本文对以上三种...在对网格计算的研究中,有人考虑了计算资源中服务质量(QoS)因素,在对传统的 Min Min算法加以改进的基础上,提出了QoS Guided Min Min算法。在此基础上,本文提出一种新的扩展型算法,以进一步提高网格资源的利用率。最后,本文对以上三种算法的实验结果进行了比较分析。展开更多
文摘In this paper, we describe a two-phase scheme to determine a scheduling of tasks with precedence con-straints that employ a reliability measure as one of the objectives in a Real-Time and heterogeneous distributed sys-tem. The simulation results show that, for task graphs with precedence constraints in a heterogeneous Real-Timesystem, the method performs significantly better than the two algorithms presented that do not consider reliabilitycost. Furthermore, the results suggest that higher computational heterogeneity is conducive to improving the schedu-lability of the reliability cost-driven (RCD)algorithm, while the opposite is true for the two non-RCD algorithms.
