MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Electrical Engineering and Computer Sciences
  • Electrical Engineering and Computer Sciences - Master's degree
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Electrical Engineering and Computer Sciences
  • Electrical Engineering and Computer Sciences - Master's degree
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Analysis of recursive cache-adaptive algorithms

Author(s)
Lincoln, Andrea (Andrea I.)
Thumbnail
DownloadFull printable version (299.4Kb)
Alternative title
Advances in cache analysis for algorithms
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Erik Demaine.
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
Metadata
Show full item record
Abstract
The performance and behavior of caches is becoming increasingly important to the overall performance of systems. As a result, there has been extensive study of caching in theoretical computer science. The traditionally studied model was the external-memory model [AV88]. In this model cache misses cost O(1) and operations on the CPU are free [AV88]. In 1999 Frigo, Leiserson, Prokop and Ramachandran proposed the cache-oblivious model [FLPR99]. In this model algorithms don't have access to cache information, like the size of the cache. However, neither model captures the fact that an algorithm's available cache can change over time, which can effect its efficiency. In 2014, the cache-adaptive model was proposed [BEF+14]. The cache-adaptive model is a model where the cache can change in size when a cache miss occurs [BEF+14]. In more recent work, to be published, methods for analysis in the cache-adaptive context are proposed [MABM]. In this thesis we analyze the efficiency of recursive algorithms in the cache-adaptive model. Specifically, we present lower bounds on progress per cache miss and upper bounds on the total number of cache misses in an execution. The algorithms we analyze are divide and conquer algorithms that follow the recurrence T(N) = aT (N=b) + Nc. For divide and conquer algorithms of this form, there is a method for calculating within a constant factor the number of cache misses incurred. This provides a theorem analogues to the Master Theorem, but applicable to the cache-adaptive model.
Description
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.
 
Title as it appears in MIT Commencement Exercises program, June 5, 2015: Advances in cache analysis for algorithms. Cataloged from student-submitted PDF version of thesis.
 
Includes bibliographical references (pages 33-34).
 
Date issued
2015
URI
http://hdl.handle.net/1721.1/100630
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Electrical Engineering and Computer Sciences - Master's degree
  • Electrical Engineering and Computer Sciences - Master's degree

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.