{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/19333"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/19333","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"The dependence analysis and synchronization of parallel programs","abstract":"The optimization of programs with explicit--i.e. user specified--parallelism requires the computation of the data dependence relation if optimizations performed by the compiler are to preserve sequential consistency. Shasha and Snir investigated the problem for straight-line code with data accesses performed on scalars. We extend their results to programs with sequential loops and cobegin or doall loop parallelism and data accesses performed on arrays. The array subscript information is used to increase the accuracy of the test in a way analogous to the data dependence tests for sequential programs.","abstract_html":"The optimization of programs with explicit--i.e. user specified--parallelism requires the computation of the data dependence relation if optimizations performed by the compiler are to preserve sequential consistency. Shasha and Snir investigated the problem for straight-line code with data accesses performed on scalars. We extend their results to programs with sequential loops and cobegin or doall loop parallelism and data accesses performed on arrays. The array subscript information is used to increase the accuracy of the test in a way analogous to the data dependence tests for sequential programs.","abstract_has_math":false,"creators":["Midkiff, Samuel Pratt"],"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":2011,"date_issued":"2011-05-07T12:04:14Z","date_published":"2011-05-07T12:04:14Z","updated_at":"2026-07-22T22:25:12Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1992 Midkiff, Samuel Pratt"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9216669","(UMI)AAI9216669"],"render_values":[{"text":"AAI9216669","href":null,"code":true},{"text":"(UMI)AAI9216669","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/19333","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":["Midkiff, Samuel Pratt"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:04:14Z","10000-01-01","1992"]},{"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 1992 Midkiff, Samuel Pratt"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9216669","(UMI)AAI9216669","http://hdl.handle.net/2142/19333"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The optimization of programs with explicit--i.e. user specified--parallelism requires the computation of the data dependence relation if optimizations performed by the compiler are to preserve sequential consistency. Shasha and Snir investigated the problem for straight-line code with data accesses performed on scalars. We extend their results to programs with sequential loops and cobegin or doall loop parallelism and data accesses performed on arrays. The array subscript information is used to increase the accuracy of the test in a way analogous to the data dependence tests for sequential programs.","Once data dependences have been identified synchronization can be used to enforce the orderings specified by the data dependence. The automatic generation of synchronization, and the optimization of synchronization, by a compiler is investigated. Experimental results comparing the effectiveness of different optimization techniques are presented.","Made available in DSpace on 2011-05-07T12:04:14Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9216669.pdf: 6019632 bytes, checksum: 8f0b72b34b2b3e5d32156f6e9bd8b64d (MD5) Previous issue date: 1992","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:36:14Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:14:35-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":["The dependence analysis and synchronization of parallel programs"]}]}],"canonical_facts":{"dc:contributor":["Padua, David A."],"dc:creator":["Midkiff, Samuel Pratt"],"dc:date":["2011-05-07T12:04:14Z","10000-01-01","1992"],"dc:description":["The optimization of programs with explicit--i.e. user specified--parallelism requires the computation of the data dependence relation if optimizations performed by the compiler are to preserve sequential consistency. Shasha and Snir investigated the problem for straight-line code with data accesses performed on scalars. We extend their results to programs with sequential loops and cobegin or doall loop parallelism and data accesses performed on arrays. The array subscript information is used to increase the accuracy of the test in a way analogous to the data dependence tests for sequential programs.","Once data dependences have been identified synchronization can be used to enforce the orderings specified by the data dependence. The automatic generation of synchronization, and the optimization of synchronization, by a compiler is investigated. Experimental results comparing the effectiveness of different optimization techniques are presented.","Made available in DSpace on 2011-05-07T12:04:14Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9216669.pdf: 6019632 bytes, checksum: 8f0b72b34b2b3e5d32156f6e9bd8b64d (MD5) Previous issue date: 1992","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:36:14Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:14:35-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":["AAI9216669","(UMI)AAI9216669","http://hdl.handle.net/2142/19333"],"dc:language":["eng"],"dc:rights":["Copyright 1992 Midkiff, Samuel Pratt"],"dc:subject":["Computer Science"],"dc:title":["The dependence analysis and synchronization of parallel 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:12Z"}