2026-09-20T06:37:49Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/21336 2023-07-10 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Lin, Kwei-Jay Kenny, Kevin Bernard 2011-05-07T13:05:42Z 2011-05-07T13:05:42Z 10000-01-01 1990 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. Made available in DSpace on 2011-05-07T13:05:42Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9114288.pdf: 4812345 bytes, checksum: c8b63f286d79126880b20ae485ea1342 (MD5) Previous issue date: 1990 Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:50:05Z Item is restricted indefinitely. Restriction data tranferred 2014-07-01T11:22:51-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission ETDs are only available to UIUC Users without author permission U of I Only AAI9114288 (UMI)AAI9114288 http://hdl.handle.net/2142/21336 eng Copyright 1990 Kenny, Kevin Bernard Computer Science Structuring real-time systems using performance polymorphism text Dissertation Ph.D. Computer Science Computer Science University of Illinois at Urbana-Champaign