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.展开更多
Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we re...Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we represent those two goals as the minimization of the average response time and the average task laxity.To achieve this,we propose a genetic-based algorithm with problem-specific and efficient genetic operators.Adaptive control parameters are also employed in our work to improve the genetic algorithms' efficiency.The simulation results show that our proposed algorithm outperforms its counterpart considerably by up to 36% and 35% in terms of the average response time and the average task laxity,respectively.展开更多
文摘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.
文摘Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we represent those two goals as the minimization of the average response time and the average task laxity.To achieve this,we propose a genetic-based algorithm with problem-specific and efficient genetic operators.Adaptive control parameters are also employed in our work to improve the genetic algorithms' efficiency.The simulation results show that our proposed algorithm outperforms its counterpart considerably by up to 36% and 35% in terms of the average response time and the average task laxity,respectively.
