• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      SPM management using markov chain based data access prediction

      Thumbnail
      View / Download
      188.5 Kb
      Author
      Yemliha, T.
      Srikantaiah, S.
      Kandemir, M.
      Öztürk, Özcan
      Date
      2008-11
      Source Title
      IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
      Publisher
      IEEE
      Pages
      566 - 569
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      140
      views
      97
      downloads
      Abstract
      Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is crucial to extract maximum performance from application programs. While regular accesses like scalar values and array expressions with affine subscript functions have been tractable for compiler analysis (to be prefetched into SPM), irregular accesses like pointer accesses and indexed array accesses have not been easily amenable for compiler analysis. This paper presents an SPM management technique using Markov chain based data access prediction for such irregular accesses. Our approach takes advantage of inherent, but hidden reuse in data accesses made by irregular references. We have implemented our proposed approach using an optimizing compiler. In this paper, we also present a thorough comparison of our different dynamic prediction schemes with other SPM management schemes. SPM management using our approaches produces 12.7% to 28.5% improvements in performance across a range of applications with both regular and irregular access patterns, with an average improvement of 20.8%.
      Keywords
      Access patterns
      Application programs
      Compiler analysis
      Data accesses
      Dynamic predictions
      Management schemes
      Management techniques
      Markov chains
      Maximum performances
      Optimizing compilers
      Scalar values
      Scratchpad memories
      Computer aided design
      Embedded systems
      Industrial management
      Integrated circuits
      Markov processes
      Paper
      Program compilers
      Statistical process control
      Self phase modulation
      Permalink
      http://hdl.handle.net/11693/26756
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/ICCAD.2008.4681632
      Collections
      • Department of Computer Engineering 1413
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy