{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/76998"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/76998","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Performance analysis of cache oblivious Algorithms in the Fresh Breeze memory model","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_html":"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_has_math":false,"creators":["Slocum, Joshua Foster"],"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":["Jack B. Dennis."],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011","date_published":"2011","updated_at":"2026-07-22T22:22:26Z","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/76998","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Jack B. Dennis."]},{"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":["Slocum, Joshua Foster"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-02-14T15:36:38Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-02-14T15:36:38Z"]},{"key":"dc:date.issued","label":"Date","values":["2011"]},{"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/76998"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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)."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Performance analysis of cache oblivious Algorithms in the Fresh Breeze memory model"]}]}],"canonical_facts":{"dc:contributor.advisor":["Jack B. Dennis."],"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":["Slocum, Joshua Foster"],"dc:date.accessioned":["2013-02-14T15:36:38Z"],"dc:date.available":["2013-02-14T15:36:38Z"],"dc:date.issued":["2011"],"dc:description":["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)."],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/76998"],"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":["Performance analysis of cache oblivious Algorithms in the Fresh Breeze memory model"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:26Z"}