{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81885"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81885","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Compiling for Distributed Memory Multiprocessors Based on Access Region Analysis","abstract":"This dissertation explores the applicability of fully automatic parallelizing techniques for distributed memory multiprocessors. In the research, an ordinary Fortran 77 program is assumed as input, and no information is required from the programmers. Only the abilities of the compiler are used to detect parallelism from the input program, to distribute data, and to control communication in the system. To achieve this goal, a variety of compiler techniques are used, including traditional compiling techniques and new techniques developed specifically with distributed memory architectures as the target. Combining these traditional and new techniques, various sequential benchmark programs are tested on one of the distributed memory machines.","abstract_html":"This dissertation explores the applicability of fully automatic parallelizing techniques for distributed memory multiprocessors. In the research, an ordinary Fortran 77 program is assumed as input, and no information is required from the programmers. Only the abilities of the compiler are used to detect parallelism from the input program, to distribute data, and to control communication in the system. To achieve this goal, a variety of compiler techniques are used, including traditional compiling techniques and new techniques developed specifically with distributed memory architectures as the target. Combining these traditional and new techniques, various sequential benchmark programs are tested on one of the distributed memory machines.","abstract_has_math":false,"creators":["Paek, Yunheung"],"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:51Z","date_published":"2015-09-25T20:20:51Z","updated_at":"2026-07-22T22:26:17Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI9737215"],"render_values":[{"text":"(MiAaPQ)AAI9737215","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81885","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":["Paek, Yunheung"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:20:51Z","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":["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/81885","(MiAaPQ)AAI9737215"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This dissertation explores the applicability of fully automatic parallelizing techniques for distributed memory multiprocessors. In the research, an ordinary Fortran 77 program is assumed as input, and no information is required from the programmers. Only the abilities of the compiler are used to detect parallelism from the input program, to distribute data, and to control communication in the system. To achieve this goal, a variety of compiler techniques are used, including traditional compiling techniques and new techniques developed specifically with distributed memory architectures as the target. Combining these traditional and new techniques, various sequential benchmark programs are tested on one of the distributed memory machines.","Made available in DSpace on 2015-09-25T20:20:51Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9737215.pdf: 5455769 bytes, checksum: 540c1d5d1aab2c2d3b2e54105d657402 (MD5) Previous issue date: 1997","Embargo set by: Seth Robbins for item 83166 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","125 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997."]},{"key":"dc:title","label":"Title","values":["Compiling for Distributed Memory Multiprocessors Based on Access Region Analysis"]}]}],"canonical_facts":{"dc:contributor":["Padua, David A."],"dc:creator":["Paek, Yunheung"],"dc:date":["2015-09-25T20:20:51Z","10000-01-01","1997"],"dc:description":["This dissertation explores the applicability of fully automatic parallelizing techniques for distributed memory multiprocessors. In the research, an ordinary Fortran 77 program is assumed as input, and no information is required from the programmers. Only the abilities of the compiler are used to detect parallelism from the input program, to distribute data, and to control communication in the system. To achieve this goal, a variety of compiler techniques are used, including traditional compiling techniques and new techniques developed specifically with distributed memory architectures as the target. Combining these traditional and new techniques, various sequential benchmark programs are tested on one of the distributed memory machines.","Made available in DSpace on 2015-09-25T20:20:51Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9737215.pdf: 5455769 bytes, checksum: 540c1d5d1aab2c2d3b2e54105d657402 (MD5) Previous issue date: 1997","Embargo set by: Seth Robbins for item 83166 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","125 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997."],"dc:identifier":["http://hdl.handle.net/2142/81885","(MiAaPQ)AAI9737215"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Compiling for Distributed Memory Multiprocessors Based on Access Region Analysis"],"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"}