{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81887"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81887","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Theory, Techniques, and Experiments in Solving Recurrences in Computer Programs","abstract":"The study of theoretical and practical issues in automatic parallelization across application and language boundaries is an appropriate and timely task. In this work, we discuss theory and techniques that we have determined useful in solving recurrences in computer programs. In chapter two we present a framework for understanding parallelism in computer applications based on an approach which models loop bodies as coalescing loop operators. In chapter three, we perform a case study of a modern C$\\sp{++}$ semantic retrieval application drawn from the digital library field based on the model presented in chapter two. In the fourth chapter we present a summary of several techniques that we believe can be applied in the automatic recognition and solution of recurrences. The techniques have been developed through performing a manual analysis of applications from benchmark suites which include sparse, irregular, and regular Fortran codes. In chapter five we discuss the application of the techniques developed in chapter four on a suite of Fortran codes representative of sparse and irregular computations which we have developed as part of this work. In the sixth chapter, we consider the application of these same techniques focused on obtaining parallelism in outer time-stepping loops. In the final chapter, we draw this work to a conclusion and discuss future directions in parallelizing compiler technology.","abstract_html":"The study of theoretical and practical issues in automatic parallelization across application and language boundaries is an appropriate and timely task. In this work, we discuss theory and techniques that we have determined useful in solving recurrences in computer programs. In chapter two we present a framework for understanding parallelism in computer applications based on an approach which models loop bodies as coalescing loop operators. In chapter three, we perform a case study of a modern C$\\sp{++}$ semantic retrieval application drawn from the digital library field based on the model presented in chapter two. In the fourth chapter we present a summary of several techniques that we believe can be applied in the automatic recognition and solution of recurrences. The techniques have been developed through performing a manual analysis of applications from benchmark suites which include sparse, irregular, and regular Fortran codes. In chapter five we discuss the application of the techniques developed in chapter four on a suite of Fortran codes representative of sparse and irregular computations which we have developed as part of this work. In the sixth chapter, we consider the application of these same techniques focused on obtaining parallelism in outer time-stepping loops. In the final chapter, we draw this work to a conclusion and discuss future directions in parallelizing compiler technology.","abstract_has_math":true,"creators":["Pottenger, William Morton"],"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:20:52Z","date_published":"2015-09-25T20:20:52Z","updated_at":"2026-07-22T22:26:17Z","subjects":["Information Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI9737225"],"render_values":[{"text":"(MiAaPQ)AAI9737225","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81887","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":["Pottenger, William Morton"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:20:52Z","10000-01-01","1997"]},{"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":["Information 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/81887","(MiAaPQ)AAI9737225"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The study of theoretical and practical issues in automatic parallelization across application and language boundaries is an appropriate and timely task. In this work, we discuss theory and techniques that we have determined useful in solving recurrences in computer programs. In chapter two we present a framework for understanding parallelism in computer applications based on an approach which models loop bodies as coalescing loop operators. In chapter three, we perform a case study of a modern C$\\sp{++}$ semantic retrieval application drawn from the digital library field based on the model presented in chapter two. In the fourth chapter we present a summary of several techniques that we believe can be applied in the automatic recognition and solution of recurrences. The techniques have been developed through performing a manual analysis of applications from benchmark suites which include sparse, irregular, and regular Fortran codes. In chapter five we discuss the application of the techniques developed in chapter four on a suite of Fortran codes representative of sparse and irregular computations which we have developed as part of this work. In the sixth chapter, we consider the application of these same techniques focused on obtaining parallelism in outer time-stepping loops. In the final chapter, we draw this work to a conclusion and discuss future directions in parallelizing compiler technology.","Made available in DSpace on 2015-09-25T20:20:52Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9737225.pdf: 5819964 bytes, checksum: 842df849781ee5dc4dfea49513490e1f (MD5) Previous issue date: 1997","Embargo set by: Seth Robbins for item 83168 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","147 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997."]},{"key":"dc:title","label":"Title","values":["Theory, Techniques, and Experiments in Solving Recurrences in Computer Programs"]}]}],"canonical_facts":{"dc:contributor":["Padua, David A."],"dc:creator":["Pottenger, William Morton"],"dc:date":["2015-09-25T20:20:52Z","10000-01-01","1997"],"dc:description":["The study of theoretical and practical issues in automatic parallelization across application and language boundaries is an appropriate and timely task. In this work, we discuss theory and techniques that we have determined useful in solving recurrences in computer programs. In chapter two we present a framework for understanding parallelism in computer applications based on an approach which models loop bodies as coalescing loop operators. In chapter three, we perform a case study of a modern C$\\sp{++}$ semantic retrieval application drawn from the digital library field based on the model presented in chapter two. In the fourth chapter we present a summary of several techniques that we believe can be applied in the automatic recognition and solution of recurrences. The techniques have been developed through performing a manual analysis of applications from benchmark suites which include sparse, irregular, and regular Fortran codes. In chapter five we discuss the application of the techniques developed in chapter four on a suite of Fortran codes representative of sparse and irregular computations which we have developed as part of this work. In the sixth chapter, we consider the application of these same techniques focused on obtaining parallelism in outer time-stepping loops. In the final chapter, we draw this work to a conclusion and discuss future directions in parallelizing compiler technology.","Made available in DSpace on 2015-09-25T20:20:52Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9737225.pdf: 5819964 bytes, checksum: 842df849781ee5dc4dfea49513490e1f (MD5) Previous issue date: 1997","Embargo set by: Seth Robbins for item 83168 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","147 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997."],"dc:identifier":["http://hdl.handle.net/2142/81887","(MiAaPQ)AAI9737225"],"dc:language":["eng"],"dc:subject":["Information Science"],"dc:title":["Theory, Techniques, and Experiments in Solving Recurrences in Computer 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"}