{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/37046"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/37046","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"A subspace optimizing data parallel complier","abstract":"Scientific programs with large data sets are an important class of computer application, requiring large amounts of memory and computational power. Massively parallel processing hardware and data parallel programming techniques are increasingly used to meet these requirements. A new approach to data parallel compilation, the Subspace compilation model, is introduced. This model is based on the idea that the shapes of data objects and how these shapes change represent higher-level performance considerations that the alignment of individual data elements. This model also removes the ad hoc restrictions of the prevalent Single Program, Multiple Data (SPMD) model. A Subspace compiler is designed based on the Subspace model, employing subspace trees as its program representation. A significant part of this compiler is implemented, with the CM-5 CM Fortran platform as its target. The implementation is tested on benchmark code, and the results discussed.","abstract_html":"Scientific programs with large data sets are an important class of computer application, requiring large amounts of memory and computational power. Massively parallel processing hardware and data parallel programming techniques are increasingly used to meet these requirements. A new approach to data parallel compilation, the Subspace compilation model, is introduced. This model is based on the idea that the shapes of data objects and how these shapes change represent higher-level performance considerations that the alignment of individual data elements. This model also removes the ad hoc restrictions of the prevalent Single Program, Multiple Data (SPMD) model. A Subspace compiler is designed based on the Subspace model, employing subspace trees as its program representation. A significant part of this compiler is implemented, with the CM-5 CM Fortran platform as its target. The implementation is tested on benchmark code, and the results discussed.","abstract_has_math":false,"creators":["Dampier, Todd O. (Todd Orion)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["William J. Dally."],"committee_chairs":[],"committee_members":[],"year":1995,"date_issued":"1995","date_published":"1995","updated_at":"2026-07-22T22:22:07Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/37046","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["William J. Dally."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Dampier, Todd O. (Todd Orion)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2007-04-03T17:05:17Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2007-04-03T17:05:17Z"]},{"key":"dc:date.issued","label":"Date","values":["1995"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/37046"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M.Eng. and B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, June 1995.","Includes bibliographical references (p. 96)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Scientific programs with large data sets are an important class of computer application, requiring large amounts of memory and computational power. Massively parallel processing hardware and data parallel programming techniques are increasingly used to meet these requirements. A new approach to data parallel compilation, the Subspace compilation model, is introduced. This model is based on the idea that the shapes of data objects and how these shapes change represent higher-level performance considerations that the alignment of individual data elements. This model also removes the ad hoc restrictions of the prevalent Single Program, Multiple Data (SPMD) model. A Subspace compiler is designed based on the Subspace model, employing subspace trees as its program representation. A significant part of this compiler is implemented, with the CM-5 CM Fortran platform as its target. The implementation is tested on benchmark code, and the results discussed."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng.and B.S."]},{"key":"dc:title","label":"Title","values":["A subspace optimizing data parallel complier"]}]}],"canonical_facts":{"dc:contributor.advisor":["William J. Dally."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Dampier, Todd O. (Todd Orion)"],"dc:date.accessioned":["2007-04-03T17:05:17Z"],"dc:date.available":["2007-04-03T17:05:17Z"],"dc:date.issued":["1995"],"dc:description":["Thesis (M.Eng. and B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, June 1995.","Includes bibliographical references (p. 96)."],"dc:description.abstract":["Scientific programs with large data sets are an important class of computer application, requiring large amounts of memory and computational power. Massively parallel processing hardware and data parallel programming techniques are increasingly used to meet these requirements. A new approach to data parallel compilation, the Subspace compilation model, is introduced. This model is based on the idea that the shapes of data objects and how these shapes change represent higher-level performance considerations that the alignment of individual data elements. This model also removes the ad hoc restrictions of the prevalent Single Program, Multiple Data (SPMD) model. A Subspace compiler is designed based on the Subspace model, employing subspace trees as its program representation. A significant part of this compiler is implemented, with the CM-5 CM Fortran platform as its target. The implementation is tested on benchmark code, and the results discussed."],"dc:description.degree":["M.Eng.and B.S."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/37046"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["A subspace optimizing data parallel complier"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:07Z"}