A subspace optimizing data parallel complier
Name
52043955-MIT.pdf
Description
Full printable version
Size
5.04 MB
Format
Adobe PDF
Checksum (MD5)
5f2a48be62c7b8d592d6b98224cb3487
Author(s)
Dampier, Todd O. (Todd Orion)
Advisor(s)
William J. Dally.
Date Issued
1995
Publisher
Massachusetts Institute of Technology
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.
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).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
