Fast Efficient Fixed-Size Memory Pool: No Loops and No Overhead

Abstract

In this paper, we examine a ready-to-use, robust, and computationally fast fixed-size memory pool manager with no-loops and no-memory overhead that is highly suited towards time-critical systems such as games. The algorithm achieves this by exploiting the unused memory slots for bookkeeping in combination with a trouble-free indexing scheme. We explain how it works in amalgamation with straightforward step-by-step examples. Furthermore, we compare just how much faster the memory pool manager is when compared with a system allocator (e.g., malloc) over a range of allocations and sizes.

Citation

Ben Kenwright "Fast Efficient Fixed-Size Memory Pool: No Loops and No Overhead".  Computation Tools 2012. The Third International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking, .

Supplemental Material

Preview

Note: This file is about ~5-30 MB in size.

This paper appears in:
Date of Release:
Author(s): Ben Kenwright.
Computation Tools 2012. The Third International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking
Page(s):
Product Type: Conference/Journal Publications

 

Thought Convolving Softbox Garments Fabrics Impact Important Design 7 Gallery Tested Sequential Interactive Through Framework Guides Particular Behaviors Overall Implicit Practice 56 China 19491966 Chicago 1 Expression Dynamics Reconstruction Person Detection Maximum Several Significantly Functions Counts 59 Variables Permutation Columns Variability Typically Template Connectivity Explicit Detection Remeshing Usefulness Alignment Resulting Fields 0 Algorithmic Beauty Plants Dimension Motivated Sphere Shearing Strucutures Applied Demation Coherent 79 Draping Scalable Discretization Enable Function Result Problem Unconstrained Trivial Clearly Likely Shapes Simple Defined Conflicts 1 Failure Comparable Contact Collisions Friction Treatment Animation Method Classes Applicable Object Geometric Variability 75 Subjectively Becomes Creation Animation Important Similar Stitched Layers Bottom 33 Approach Outperms Effectiveness Methods Demonstrating Nonlinearities Multiple Fitting Linear Models Material Magnitudes Examines Demation Calculated 7 Exploratory Would Require Tasks Nature Tool One Wish Impose Resulting System Surfa Near Spd Second 17 Parameters Permance Experiments Halfedge Compatible Quantity Resolution Timing Memory Increases Linearly Slight Contact 5 Shadowdraw Shadowguided Inputting Interface Designed Sketches Specially Drawing Thoroughly Interested Largerscale System Modeling Subdivision Interactive 9 Value Level Heat Its Surfa Trajectory Reversed Order Footstep Flexibility Can Pulum Planning Some System 4 Generative Developing Models Meshes Designed Concept Specially Shadowdraw Interface Sketches Inputting Drawing Geometry Experiment Aligned 82 Snapshots Our Compact Wellpreserved With With With Expressive Wellpreserved With With And Compact And With 4 Moreover Displacement Generate Vector Vectors Inverse Kinematics Mulate Problem Reference Consider Conventional Resulting Velocities 5 Captured Parameterization Sucsive Bijectivity Surface Implies Ground Ensures Velocity Convergence Projection Variable Algorithm Slightly Finger 2 Assignments That Players Most Notably Extraurban 20 Pointnet Special Edgeconv Anation Motion Planner Parameters Extracted Models Descriptors Framework Computing Characterizing Propose 37 Usually Sampling Horizon Evaluate Surface Important Distinction Definition Operators 83