Partial Program Admission

13 years 9 months ago
Partial Program Admission
Abstract—Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most commonly used to bound program execution time. While bounding a program’s WCET statically is possible, computing its true WCET is difficult without significant semantic knowledge. We present a new technique we call partial program admission, a means of statically enforcing an otherwise untrusted assertion of WCET without requiring semantic knowledge and without adding runtime overhead, by means of code duplication. We apply this technique to real programs from the virtual networking arena, and present the results.
Michael Wilson, Ron Cytron, Jonathan S. Turner
Added 21 May 2010
Updated 21 May 2010
Type Conference
Year 2009
Where RTAS
Authors Michael Wilson, Ron Cytron, Jonathan S. Turner
Comments (0)