计算机科学
計算機科學
계산궤과학
COMPUTER SCIENCE
2003年
1期
53-56
,共4页
Reliability cost%Real-time system%Real-time scheduling%Heterogeneous distributed systems%Perfor-mance
Reliability cost%Real-time system%Real-time scheduling%Heterogeneous distributed systems%Perfor-mance
Reliability cost%Real-time system%Real-time scheduling%Heterogeneous distributed systems%Perfor-mance
Reliability cost%Real-time system%Real-time scheduling%Heterogeneous distributed systems%Perfor-mance
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.
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.
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.
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.
