{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/21336"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/21336","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Structuring real-time systems using performance polymorphism","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Kenny, Kevin Bernard"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Lin, Kwei-Jay"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T13:05:42Z","date_published":"2011-05-07T13:05:42Z","updated_at":"2026-07-22T22:25:17Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1990 Kenny, Kevin Bernard"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9114288","(UMI)AAI9114288"],"render_values":[{"text":"AAI9114288","href":null,"code":true},{"text":"(UMI)AAI9114288","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/21336","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Lin, Kwei-Jay"]},{"key":"dc:creator","label":"Author","values":["Kenny, Kevin Bernard"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:05:42Z","10000-01-01","1990"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1990 Kenny, Kevin Bernard"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9114288","(UMI)AAI9114288","http://hdl.handle.net/2142/21336"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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"]},{"key":"dc:title","label":"Title","values":["Structuring real-time systems using performance polymorphism"]}]}],"canonical_facts":{"dc:contributor":["Lin, Kwei-Jay"],"dc:creator":["Kenny, Kevin Bernard"],"dc:date":["2011-05-07T13:05:42Z","10000-01-01","1990"],"dc:description":["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"],"dc:identifier":["AAI9114288","(UMI)AAI9114288","http://hdl.handle.net/2142/21336"],"dc:language":["eng"],"dc:rights":["Copyright 1990 Kenny, Kevin Bernard"],"dc:subject":["Computer Science"],"dc:title":["Structuring real-time systems using performance polymorphism"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:17Z"}