GoodSpread: Criticality-Aware Static Scheduling of CPS with Multi-QoS Resources

Author(s):  
Debayan Roy ◽  
Sumana Ghosh ◽  
Qi Zhu ◽  
Marco Caccamo ◽  
Samarjit Chakraborty
Keyword(s):  
Author(s):  
Jianyi Cheng ◽  
Lana Josipovic ◽  
George A. Constantinides ◽  
Paolo Ienne ◽  
John Wickerson

Author(s):  
Chafik Arar ◽  
Mohamed Salah Khireddine

The paper proposes a new reliable fault-tolerant scheduling algorithm for real-time embedded systems. The proposed algorithm is based on static scheduling that allows to include the dependencies and the execution cost of tasks and data dependencies in its scheduling decisions. Our scheduling algorithm is dedicated to multi-bus heterogeneous architectures with multiple processors linked by several shared buses. This scheduling algorithm is considering only one bus fault caused by hardware faults and compensated by software redundancy solutions. The proposed algorithm is based on both active and passive backup copies to minimize the scheduling length of data on buses. In the experiments, the proposed methods are evaluated in terms of data scheduling length for a set of DSP benchmarks. The experimental results show the effectiveness of our technique.


2009 ◽  
Vol 16-19 ◽  
pp. 743-747
Author(s):  
Yu Wu ◽  
Xin Cun Zhuang ◽  
Cong Xin Li

Solve the flexible dynamic scheduling problem by using “dynamic management & static scheduling” method. Aim at the property of flexible Manufacturing systems, the dynamic scheduling methods are analyzed and a coding method based on working procedure is improved in this paper. Thus it can be efficiently solve the problem of multiple working routes selection under the active distribution principle. On the other hand, the self-adaptive gene is provided and the parameters of the genetic algorithm are defined. In such a solution, the scheduling is confirmed to be simple and efficient.


Sign in / Sign up

Export Citation Format

Share Document