Derivation of the Hard Deadlines of Multi-Sampled Tasks

スポンサーリンク

概要

• 論文の詳細を見る

• When a failure or upset occurring in a controller computer induces a task failure durable for a substantial period, system dynamics apparently deviates from its desirable sample paths, and loses its stability in an extreme case for the period to exceed the hard deadline in a real-time control system. In the paper, we propose an algorithm to combine the deadlines of all elementary tasks (derived formerly by our work [1]) executed in several operation modes with multi-sampling periods. This results in computing the hard deadline of the entire system through modifying task-state equations to capture the effects of task failures and inter-correlations among tasks.

• 一般社団法人電子情報通信学会の論文
• 2000-06-25

著者

• Kim H

  The Authors Are With The Department Of Electrical And Computer Engineering Yonsei University

• Kim Hagbae

  The Authors Are With The Department Of Electrical And Computer Engineering Yonsei University

• WOO Chunhee

  The authors are with the Department of Electrical and Computer Engineering, Yonsei University

• LEE Daehyun

  The authors are with the Department of Electrical and Computer Engineering, Yonsei University

• Woo Chunhee

  The Authors Are With The Department Of Electrical And Computer Engineering Yonsei University

関連論文

• An Optimal Load Balancing Method for the Web-Server Cluster Based on the ANFIS Model(Computer Systems)
• On Reconfiguration Latency in Fault-Tolerant Systems
• Derivation of the Hard Deadlines of Multi-Sampled Tasks

スポンサーリンク