• 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.

      A decoupled local memory allocator

      Thumbnail
      View / Download
      361.4 Kb
      Author
      Diouf, B.
      Hantaş, C.
      Cohen, A.
      Özturk, Ö.
      Palsberg, J.
      Date
      2013
      Source Title
      ACM Transactions on Architecture and Code Optimization
      Print ISSN
      1544-3566
      Publisher
      Association for Computing Machinery
      Volume
      9
      Issue
      4
      Pages
      34:1 - 34:22
      Language
      English
      Type
      Article
      Item Usage Stats
      145
      views
      87
      downloads
      Abstract
      Compilers use software-controlled local memories to provide fast, predictable, and power-efficient access to critical data. We show that the local memory allocation for straight-line, or linearized programs is equivalent to a weighted interval-graph coloring problem. This problem is new when allowing a color interval to "wrap around," and we call it the submarine-building problem. This graph-theoretical decision problem differs slightly from the classical ship-building problem, and exhibits very interesting and unusual complexity properties. We demonstrate that the submarine-building problem is NP-complete, while it is solvable in linear time for not-so-proper interval graphs, an extension of the the class of proper interval graphs. We propose a clustering heuristic to approximate any interval graph into a not-so-proper interval graph, decoupling spill code generation from local memory assignment. We apply this heuristic to a large number of randomly generated interval graphs reproducing the statistical features of standard local memory allocation benchmarks, comparing with state-of-the-art heuristics. © 2013 ACM.
      Keywords
      Compiler
      Local memory
      Memory allocation
      Scratchpad memory
      Coloring problems
      Critical data
      Decision problems
      Interval graph
      Linear time
      Local memories
      NP Complete
      Power efficient
      Proper interval graphs
      Scratch pad memory
      Spill code
      Statistical features
      Graph theory
      Program compilers
      Submarines
      Storage allocation (computer)
      Permalink
      http://hdl.handle.net/11693/21123
      Published Version (Please cite this version)
      http://dx.doi.org/10.1145/2400682.2400693
      Collections
      • Department of Computer Engineering 1421
      Show full item record

      Related items

      Showing items related by title, author, creator and subject.

      • Thumbnail

        Using data compression for increasing memory system utilization 

        Ozturk, O.; Kandemir, M.; Irwin, M. J. (Institute of Electrical and Electronics Engineers, 2009-06)
        The memory system presents one of the critical challenges in embedded system design and optimization. This is mainly due to the ever-increasing code complexity of embedded applications and the exponential increase seen in ...
      • Thumbnail

        A high-performance hybrid memory architecture for embedded CMPs using a convex optimization model 

        Onsori, Salman; Asad, Arghavan; Raahemifar, K.; Fathy, M. (IEEE, 2015-11)
        In this article, we present a convex optimization model to design a stacked hybrid memory system for 3D embedded chip-multiprocessors (eCMP). Our convex model optimizes numbers and placement of SRAM and STT-RAM memories ...
      • Thumbnail

        Thin-film ZnO charge-trapping memory cell grown in a single ALD step 

        Oruc, F. B.; Cimen, F.; Rizk, A.; Ghaffari, M.; Nayfeh, A.; Okyay, Ali Kemal (Institute of Electrical and Electronics Engineers, 2012-10-26)
        A thin-film ZnO-based single-transistor memory cell with a gate stack deposited in a single atomic layer deposition step is demonstrated. Thin-film ZnO is used as channel material and charge-trapping layer for the first ...

      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