{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/21582"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/21582","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Optimization of object-oriented and concurrent programs","abstract":"High level programming language features have long been seen as improving programmer efficiency at some cost in program efficiency. When features such as object-orientation and fine-grained concurrency, which greatly simplify expression of complex programs, are used parsimoniously, their effectiveness is mitigated. It is my thesis that these features can be implemented efficiently through interprocedural analysis and transformation. By specializing their implementation to the contexts in which they are used, the program's efficiency is not adversely affected by the flexibility of the language. The specific contributions herein are: (1) an adaptive flow analysis for practical precise analysis of object-oriented programs, (2) a cloning algorithm for building specialized versions of general abstractions, (3) a set of optimizations for removing object-oriented and fine-grained concurrency overhead, and (4) a hybrid sequential-parallel execution model which adapts to the availability of data. The effectiveness of this framework has been empirically validated on standard benchmarks. It is publicly available as part of the Illinois Concert system (http://www-csag.cs.uiuc.edu).","abstract_html":"High level programming language features have long been seen as improving programmer efficiency at some cost in program efficiency. When features such as object-orientation and fine-grained concurrency, which greatly simplify expression of complex programs, are used parsimoniously, their effectiveness is mitigated. It is my thesis that these features can be implemented efficiently through interprocedural analysis and transformation. By specializing their implementation to the contexts in which they are used, the program's efficiency is not adversely affected by the flexibility of the language. The specific contributions herein are: (1) an adaptive flow analysis for practical precise analysis of object-oriented programs, (2) a cloning algorithm for building specialized versions of general abstractions, (3) a set of optimizations for removing object-oriented and fine-grained concurrency overhead, and (4) a hybrid sequential-parallel execution model which adapts to the availability of data. The effectiveness of this framework has been empirically validated on standard benchmarks. It is publicly available as part of the Illinois Concert system (http://www-csag.cs.uiuc.edu).","abstract_has_math":false,"creators":["Plevyak, John Bradley"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Chien, Andrew"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T13:12:56Z","date_published":"2011-05-07T13:12:56Z","updated_at":"2026-07-22T22:25:18Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1996 Plevyak, John Bradley"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["9780591200379","AAI9712408","(UMI)AAI9712408"],"render_values":[{"text":"9780591200379","href":null,"code":true},{"text":"AAI9712408","href":null,"code":true},{"text":"(UMI)AAI9712408","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/21582","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Chien, Andrew"]},{"key":"dc:creator","label":"Author","values":["Plevyak, John Bradley"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:12:56Z","10000-01-01","1996"]},{"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 1996 Plevyak, John Bradley"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["9780591200379","AAI9712408","(UMI)AAI9712408","http://hdl.handle.net/2142/21582"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["High level programming language features have long been seen as improving programmer efficiency at some cost in program efficiency. When features such as object-orientation and fine-grained concurrency, which greatly simplify expression of complex programs, are used parsimoniously, their effectiveness is mitigated. It is my thesis that these features can be implemented efficiently through interprocedural analysis and transformation. By specializing their implementation to the contexts in which they are used, the program's efficiency is not adversely affected by the flexibility of the language. The specific contributions herein are: (1) an adaptive flow analysis for practical precise analysis of object-oriented programs, (2) a cloning algorithm for building specialized versions of general abstractions, (3) a set of optimizations for removing object-oriented and fine-grained concurrency overhead, and (4) a hybrid sequential-parallel execution model which adapts to the availability of data. The effectiveness of this framework has been empirically validated on standard benchmarks. It is publicly available as part of the Illinois Concert system (http://www-csag.cs.uiuc.edu).","Made available in DSpace on 2011-05-07T13:12:56Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9712408.pdf: 10869073 bytes, checksum: b4556f3a8f1161607f1a91f5c4a2d907 (MD5) Previous issue date: 1996","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:51:45Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:23:47-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":["Optimization of object-oriented and concurrent programs"]}]}],"canonical_facts":{"dc:contributor":["Chien, Andrew"],"dc:creator":["Plevyak, John Bradley"],"dc:date":["2011-05-07T13:12:56Z","10000-01-01","1996"],"dc:description":["High level programming language features have long been seen as improving programmer efficiency at some cost in program efficiency. When features such as object-orientation and fine-grained concurrency, which greatly simplify expression of complex programs, are used parsimoniously, their effectiveness is mitigated. It is my thesis that these features can be implemented efficiently through interprocedural analysis and transformation. By specializing their implementation to the contexts in which they are used, the program's efficiency is not adversely affected by the flexibility of the language. The specific contributions herein are: (1) an adaptive flow analysis for practical precise analysis of object-oriented programs, (2) a cloning algorithm for building specialized versions of general abstractions, (3) a set of optimizations for removing object-oriented and fine-grained concurrency overhead, and (4) a hybrid sequential-parallel execution model which adapts to the availability of data. The effectiveness of this framework has been empirically validated on standard benchmarks. It is publicly available as part of the Illinois Concert system (http://www-csag.cs.uiuc.edu).","Made available in DSpace on 2011-05-07T13:12:56Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9712408.pdf: 10869073 bytes, checksum: b4556f3a8f1161607f1a91f5c4a2d907 (MD5) Previous issue date: 1996","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:51:45Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:23:47-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":["9780591200379","AAI9712408","(UMI)AAI9712408","http://hdl.handle.net/2142/21582"],"dc:language":["eng"],"dc:rights":["Copyright 1996 Plevyak, John Bradley"],"dc:subject":["Computer Science"],"dc:title":["Optimization of object-oriented and concurrent programs"],"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:18Z"}