Structuring large real-time systems with performance polymorphism

Sophisticated and flexible real-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. A model is presented of performance polymorphism, whereby the process of selecting a version from the available set is automated. The binding problem for this new model of polymorphism and the problem of allocating resources among computations that all support performance polymorphisms are discussed.<
>