A subspace optimizing data parallel complier

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

1995

Author dc:creator

• Dampier, Todd O. (Todd Orion)

Advisor dc:contributor.advisor

• William J. Dally.

• Electrical Engineering and Computer Science.

Statement 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/37046

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/37046