Effective real-time scheduling algorithm for cyber physical systems society

CPS (Cyber Physical Systems) tightly couple their cyber factor and physical factor in distributed computing or Grids environments to provide real-time services such as avionics, transportation, manufacturing processes, energy, healthcare, etc. We need to consider not only the cyber space (CPU, network, storage systems, etc.) and the physical space (location, migration, etc.) but also the socio space and mental space for the precise analysis and useful services. In this paper, real-time scheduling algorithms, namely ELST (Effective Least Slack Time First) and H-ELST (Heuristic-Effective Least Slack Time First), are presented for CPS, where servicing node needs to move to serviced node for real-time services. We measure the real-time performance in terms of deadline meet ratio by mathematical analysis and simulations. The results show that our algorithms reduce a deadline miss ratio approximately up to 50% and 20% compared to the conventional real-time scheduling algorithm, FIFO (First In First Out) and LST (Least Slack Time First), respectively.