{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81985"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81985","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Compile -Time Performance Prediction of Scientific Programs","abstract":"We use stack distances to quantify locality and we show that the average locality computed using stack distances is a very reliable metric. A new algorithm for stack processing, that is 30% faster than the best know algorithm on the suite of programs traced, is also presented.","abstract_html":"We use stack distances to quantify locality and we show that the average locality computed using stack distances is a very reliable metric. A new algorithm for stack processing, that is 30% faster than the best know algorithm on the suite of programs traced, is also presented.","abstract_has_math":false,"creators":["Cascaval, Gheorghe Calin"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Padua, David A."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:21:18Z","date_published":"2015-09-25T20:21:18Z","updated_at":"2026-07-22T22:26:17Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI9989955"],"render_values":[{"text":"(MiAaPQ)AAI9989955","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81985","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Padua, David A."]},{"key":"dc:creator","label":"Author","values":["Cascaval, Gheorghe Calin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:21:18Z","2000"]},{"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"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81985","(MiAaPQ)AAI9989955"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We use stack distances to quantify locality and we show that the average locality computed using stack distances is a very reliable metric. A new algorithm for stack processing, that is 30% faster than the best know algorithm on the suite of programs traced, is also presented.","Made available in DSpace on 2015-09-25T20:21:18Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9989955.pdf: 5612324 bytes, checksum: 2b3ee6aaab528e67b63da61d6363477b (MD5) Previous issue date: 2000","Embargo set by: Seth Robbins for item 83266 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Open Restriction set for Item 83266 on 2018-04-17T14:42:18Z with date null by nrhodes3@illinois.edu.","Open Restriction set for Item 83266 on 2018-04-17T14:42:21Z with date null by nrhodes3@illinois.edu.","Open","124 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000."]},{"key":"dc:title","label":"Title","values":["Compile -Time Performance Prediction of Scientific Programs"]}]}],"canonical_facts":{"dc:contributor":["Padua, David A."],"dc:creator":["Cascaval, Gheorghe Calin"],"dc:date":["2015-09-25T20:21:18Z","2000"],"dc:description":["We use stack distances to quantify locality and we show that the average locality computed using stack distances is a very reliable metric. A new algorithm for stack processing, that is 30% faster than the best know algorithm on the suite of programs traced, is also presented.","Made available in DSpace on 2015-09-25T20:21:18Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9989955.pdf: 5612324 bytes, checksum: 2b3ee6aaab528e67b63da61d6363477b (MD5) Previous issue date: 2000","Embargo set by: Seth Robbins for item 83266 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Open Restriction set for Item 83266 on 2018-04-17T14:42:18Z with date null by nrhodes3@illinois.edu.","Open Restriction set for Item 83266 on 2018-04-17T14:42:21Z with date null by nrhodes3@illinois.edu.","Open","124 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000."],"dc:identifier":["http://hdl.handle.net/2142/81985","(MiAaPQ)AAI9989955"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Compile -Time Performance Prediction of Scientific 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:26:17Z"}