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.
|Number of pages||3|
|Journal||Real-Time Technology and Applications - Proceedings|
|Publication status||Published - 2001 Jan 1|
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Computer Networks and Communications