Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Performance analysis of cache oblivious Algorithms in the Fresh Breeze memory model

Performance analysis of cache oblivious Algorithms in the Fresh Breeze memory model

Thumbnail Image
Download
Name

825556711-MIT.pdf

Description
Full printable version
Size

2.11 MB

Format

Adobe PDF

Checksum (MD5)

2884ca7a60b6e3c34d0f1b67cb5df9a9

Author(s)
Slocum, Joshua Foster
Advisor(s)
Jack B. Dennis.
Alternative Title
performance analysis of the Fresh Breeze computing system with a parallel, cache-oblivious matrix multiply
Date Issued
2011
Publisher
Massachusetts Institute of Technology
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.
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).
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.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/76998
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.