TY - GEN
T1 - Structuring large real-time systems with performance polymorphism
AU - Kenny, Kevin B.
AU - Lin, Kwei Jay
PY - 1990
Y1 - 1990
N2 - Sophisticated and flexible red-time systems may use several versions of a program fragment that performs a particular computation. These versions differ only in their performance parameters, such as the time required, the resources consumed, and the precision of the results. This paper presents a model of performance polymorphism, whereby the process of selecting a version from among the available set is automated. It discusses the binding problem for this new model of polymorphism and the problem of allocating resources among computations that all support performance polymorphism.
AB - Sophisticated and flexible red-time systems may use several versions of a program fragment that performs a particular computation. These versions differ only in their performance parameters, such as the time required, the resources consumed, and the precision of the results. This paper presents a model of performance polymorphism, whereby the process of selecting a version from among the available set is automated. It discusses the binding problem for this new model of polymorphism and the problem of allocating resources among computations that all support performance polymorphism.
UR - https://www.scopus.com/pages/publications/84880853723
U2 - 10.1109/REAL.1990.128754
DO - 10.1109/REAL.1990.128754
M3 - 会议稿件
AN - SCOPUS:84880853723
SN - 0818621125
SN - 9780818621123
T3 - Proceedings - Real-Time Systems Symposium
SP - 238
EP - 246
BT - 1990 Proceedings 11th Real-Time Systems Symposium, RTSS 1990
T2 - 1990 11th Real-Time Systems Symposium, RTSS 1990
Y2 - 5 December 1990 through 7 December 1990
ER -