Scheduling hard real-time systems: a review
Software Engineering Journal - Special issue on real-time software
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Energy-efficient soft real-time CPU scheduling for mobile multimedia systems
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Communications of the ACM - Security in the Browser
Cyber-physical systems: the next computing revolution
Proceedings of the 47th Design Automation Conference
Proceedings of the 47th Design Automation Conference
SKG '10 Proceedings of the 2010 Sixth International Conference on Semantics, Knowledge and Grids
Semantic linking through spaces for cyber-physical-socio intelligence: A methodology
Artificial Intelligence
Development of Grid e-Infrastructure in South-Eastern Europe
Journal of Grid Computing
Resources and Services of the EGEE Production Infrastructure
Journal of Grid Computing
Towards Real-Time, Volunteer Distributed Computing
CCGRID '11 Proceedings of the 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing
Maintaining data temporal consistency in distributed real-time systems
Real-Time Systems
Probabilistic Resource Space Model for Managing Resources in Cyber-Physical Society
IEEE Transactions on Services Computing
| Hi-index | 0.00 |
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.