Partial program admission

Michael Wilson; Ron Cytron; Jonathan Turner

doi:10.1109/RTAS.2009.33

Partial program admission

Michael Wilson
, Ron Cytron
, Jonathan Turner

Department of Computer Science & Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.We present a new technique we call partial program admission, a means of statically enforcing an otherwise untrusted assertion of WCET 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.

Original language	English
Title of host publication	Proceedings - 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009
Pages	295-304
Number of pages	10
DOIs	https://doi.org/10.1109/RTAS.2009.33
State	Published - 2009
Event	15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009 - San Francisco, CA, United States Duration: Apr 14 2009 → Apr 16 2009

Publication series

Name	Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS
ISSN (Print)	1545-3421

Conference

Conference	15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009
Country/Territory	United States
City	San Francisco, CA
Period	04/14/09 → 04/16/09

Access to Document

10.1109/RTAS.2009.33

Cite this

@inproceedings{9470caac6bb04776baf9e0bb5146295a,

title = "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.We present a new technique we call partial program admission, a means of statically enforcing an otherwise untrusted assertion of WCET 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.",

author = "Michael Wilson and Ron Cytron and Jonathan Turner",

year = "2009",

doi = "10.1109/RTAS.2009.33",

language = "English",

isbn = "9780769536361",

series = "Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS",

pages = "295--304",

booktitle = "Proceedings - 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009",

note = "15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009 ; Conference date: 14-04-2009 Through 16-04-2009",

}

Wilson, M, Cytron, R & Turner, J 2009, Partial program admission. in Proceedings - 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009., 4840590, Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS, pp. 295-304, 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009, San Francisco, CA, United States, 04/14/09. https://doi.org/10.1109/RTAS.2009.33

Partial program admission. / Wilson, Michael; Cytron, Ron; Turner, Jonathan.
Proceedings - 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009. 2009. p. 295-304 4840590 (Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Partial program admission

AU - Wilson, Michael

AU - Cytron, Ron

AU - Turner, Jonathan

PY - 2009

Y1 - 2009

N2 - 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.We present a new technique we call partial program admission, a means of statically enforcing an otherwise untrusted assertion of WCET 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.

AB - 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.We present a new technique we call partial program admission, a means of statically enforcing an otherwise untrusted assertion of WCET 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.

UR - https://www.scopus.com/pages/publications/67650245535

U2 - 10.1109/RTAS.2009.33

DO - 10.1109/RTAS.2009.33

M3 - Conference contribution

AN - SCOPUS:67650245535

SN - 9780769536361

T3 - Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS

SP - 295

EP - 304

BT - Proceedings - 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009

T2 - 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009

Y2 - 14 April 2009 through 16 April 2009

ER -

Partial program admission

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this