2026-09-19T04:57:36Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/769982022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Jack B. Dennis.
Slocum, Joshua Foster
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2013-02-14T15:36:38Z
2013-02-14T15:36:38Z
2011
2011
http://hdl.handle.net/1721.1/76998
825556711
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 31-32).
The Fresh Breeze program execution model was designed for easy, reliable and massively scalable parallel performance. The model achieves these goals by combining a radical memory model with efficient fine-grain parallelsim and managing both in hardware. This presents a unique opportunity for studying program execution in a system whose memory behavior is not well understood. In this thesis, I studied the behavior of cache-oblivious algorithms within the Fresh Breeze model by designing and implementing a cache-oblivious matrix multiply within the Fresh Breeze programming framework, as well as a cache-naive algorithm for comparison. The algorithms were implemented in C, using the Fresh Breeze run-time libraries, and profiled on a simulated Fresh Breeze processor. I profiled both programs across a range of problem sizes, memory speeds and memory types in order to best understand their behavior and accurately characterize their performance.
by Joshua Foster Slocum.
M.Eng.
32 p.
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.
Performance analysis of cache oblivious Algorithms in the Fresh Breeze memory model
performance analysis of the Fresh Breeze computing system with a parallel, cache-oblivious matrix multiply
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="f244768d-732b-4eb8-9692-6f3690151d0c">
<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>Performance analysis of cache oblivious Algorithms in the Fresh Breeze memory model</Title>
<Subtitle>performance analysis of the Fresh Breeze computing system with a parallel, cache-oblivious matrix multiply</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2011</PublicationDate>
<Authors>
<Author>
<DisplayName>Slocum, Joshua Foster</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>The Fresh Breeze program execution model was designed for easy, reliable and massively scalable parallel performance. The model achieves these goals by combining a radical memory model with efficient fine-grain parallelsim and managing both in hardware. This presents a unique opportunity for studying program execution in a system whose memory behavior is not well understood. In this thesis, I studied the behavior of cache-oblivious algorithms within the Fresh Breeze model by designing and implementing a cache-oblivious matrix multiply within the Fresh Breeze programming framework, as well as a cache-naive algorithm for comparison. The algorithms were implemented in C, using the Fresh Breeze run-time libraries, and profiled on a simulated Fresh Breeze processor. I profiled both programs across a range of problem sizes, memory speeds and memory types in order to best understand their behavior and accurately characterize their performance.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>