Structuring real-time systems using performance polymorphism

Sophisticated and flexible real-time systems will often use several versions of a program fragment that performs a particular action. These versions will differ only in their performance parameters, such as the time required, the resources consumed, and the precision of the results. This paper presents a theory of performance polymorphism, whereby the process of selecting a version from the available set is incorporated into the class hierarchy. The binding problem for this new style of polymorphism is discussed, and an equivalent problem of program flow analysis is described. The requirements for a simple implementation of performance polymorphism are presented.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Kenny, Kevin Bernard

Contributors dc:contributor

• Lin, Kwei-Jay

• Computer Science

Statement dc:rights

• Copyright 1990 Kenny, Kevin Bernard

Language dc:language

eng

Identifier

AAI9114288
(UMI)AAI9114288

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/21336