43
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Geometric Memory Management

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          In this report we discuss the concepts of geometric memory align- ment, geometric memory allocation and geometric memory mapping. We introduce block trees as an efficient data structure for representing geo- metrically aligned block allocation states. We introduce niche maps as an efficient means to find the right place to allocate a chunk of a given size whilst maintaining good packing and avoiding fragmentation. We intro- duce ledging as a process to deal with chunk sizes that are not a power of two. We discuss using block trees for memory mapping in the context of virtual memory management. We show how ledging can also be applied at the level of virtual memory in order to create fixed size virtual mem- ory spaces. Finally we discuss implementation of both geometric memory allocation as well as geometric memory mapping in hardware.

          Related collections

          Author and article information

          Journal
          2015-12-31
          2016-02-17
          Article
          1512.09358
          7b5901ef-78da-45a4-923e-64ae3a859a8e

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          History
          Custom metadata
          60K30
          This is a draft version of the report, future updates are planned
          cs.DS

          Data structures & Algorithms
          Data structures & Algorithms

          Comments

          Comment on this article