Fault-tolerant scheduling under time and resource constraints

Lih Chyun Shu, Michal Young

研究成果: Article


The sufficient schedulability condition was derived when the stack resource policy of Baker was combined with the basic time redundancy approach of Ghosh. It was shown that a higher priority task could be blocked for a duration. This duration was not longer than the maximum of worst-case blocking caused by the stack resource policy and retry overhead caused by basic time redundancy approach. Retry overheads were also factored into schedulability formulas.

頁(從 - 到)117-119
期刊Real-Time Technology and Applications - Proceedings
出版狀態Published - 2001 一月 1

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

指紋 深入研究「Fault-tolerant scheduling under time and resource constraints」主題。共同形成了獨特的指紋。

  • 引用此