Fault-tolerant scheduling under time and resource constraints

Lih Chyun Shu, Michal Young

Research output: Contribution to journalArticle


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.

Original languageEnglish
Pages (from-to)117-119
Number of pages3
JournalReal-Time Technology and Applications - Proceedings
Publication statusPublished - 2001 Jan 1

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Fingerprint Dive into the research topics of 'Fault-tolerant scheduling under time and resource constraints'. Together they form a unique fingerprint.

  • Cite this