Structuring large real-time systems with performance polymorphism
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 238-246
- https://doi.org/10.1109/real.1990.128754
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- FLEX: towards flexible real-time programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Expressing and maintaining timing constraints in FLEXPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A language and system for the construction and tuning of parallel programsIEEE Transactions on Software Engineering, 1988
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- An Improved Algorithm for Computing the Singular Value DecompositionACM Transactions on Mathematical Software, 1982
- The Knapsack Sharing ProblemOperations Research, 1979
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- Binding time optimization in programming languagesPublished by Association for Computing Machinery (ACM) ,1976
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974