2026-09-19T03:47:14Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1060062026-06-06T00:55:03Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Armando Solar-Lezama.
Sharpe, Jeremy Edward
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2016-12-22T15:18:18Z
2016-12-22T15:18:18Z
2015
2015
http://hdl.handle.net/1721.1/106006
965799703
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (page 63).
In this thesis, I expanded the programming model implemented by the Sketch language to supplement its distributed memory parallelism with shared memory parallelism that uses the popular fork-join model. The primary contribution of this thesis is the means by which the code is assured to be free of race conditions. Sketch uses constraint satisfaction analysis to ensure it synthesizes code the functions properly for all inputs, and I demonstrate how assertions can be generated and inserted into the analysis to guarantee freedom from race conditions. This expanded programming model is then evaluated using test cases to ensure correct operation and benchmarks to examine overall performance.
by Jeremy Edward Sharpe.
M.Eng.
63 pages
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Expanding the synthesis of distributed memory implementations
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="8a41614e-6617-4a89-a236-cdc177c2b794">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Expanding the synthesis of distributed memory implementations</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2015</PublicationDate>
<Authors>
<Author>
<DisplayName>Sharpe, Jeremy Edward</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>In this thesis, I expanded the programming model implemented by the Sketch language to supplement its distributed memory parallelism with shared memory parallelism that uses the popular fork-join model. The primary contribution of this thesis is the means by which the code is assured to be free of race conditions. Sketch uses constraint satisfaction analysis to ensure it synthesizes code the functions properly for all inputs, and I demonstrate how assertions can be generated and inserted into the analysis to guarantee freedom from race conditions. This expanded programming model is then evaluated using test cases to ensure correct operation and benchmarks to examine overall performance.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>