Dependable Scheduling for Real-Time Workflows on Cyber-Physical Cloud Systems

Cyber-physical cloud systems (CPCS) are integrations of cyber-physical systems (CPS) and cloud computing infrastructures. Integrating CPS into cloud computing infrastructures could improve the performance in many aspects. However, new reliability and security challenges are also introduced. This fac...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on industrial informatics Ročník 17; číslo 11; s. 7820 - 7829
Hlavní autori: Zhou, Junlong, Sun, Jin, Zhang, Mingyue, Ma, Yue
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 01.11.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Cloud computing
Cyber-physical systems
Cyber–physical cloud systems (CPCS)
Job shop scheduling
Real time
Real-time systems
Reliability
Reliability aspects
Reliability engineering
Scheduling
Security
Security services
slack
Soft errors
soft-error and lifetime reliability
Task analysis
workflow scheduling
Workflow software
ISSN:1551-3203, 1941-0050
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Cyber-physical cloud systems (CPCS) are integrations of cyber-physical systems (CPS) and cloud computing infrastructures. Integrating CPS into cloud computing infrastructures could improve the performance in many aspects. However, new reliability and security challenges are also introduced. This fact highlights the need to develop novel methodologies to tackle these challenges in CPCS. To this end, this article is oriented toward enhancing the soft-error reliability of real-time workflows on CPCS while satisfying the lifetime reliability, security, and real-time constraints. In this article, we propose a dependable algorithm for scheduling workflow applications on CPCS. The proposed algorithm uses slack to recover failed tasks and allows all tasks to share the available slack in the system. To improve soft-error reliability, the algorithm first determines the priority of tasks, then assigns the maximum frequency to each task, and finally assigns the recoveries to tasks dynamically. Slack also can be used to utilize security services for satisfying system security requirements. The lifetime reliability constraint is met by dynamically scaling down the operating frequency of low-priority tasks. Extensive experiments on real-world workflow benchmarks demonstrate that the proposed scheme reduces the probability of failure by up to <inline-formula><tex-math notation="LaTeX">52.1\%</tex-math></inline-formula> and improves the scheduling feasibility by up to <inline-formula><tex-math notation="LaTeX">83.5\%</tex-math></inline-formula> compared to a number of representative approaches.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1551-3203
1941-0050
DOI:10.1109/TII.2020.3011506