Home // COMPUTATION TOOLS 2012, The Third International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking // View article

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

Authors:
Ben Kenwright

Keywords: memory pools; real-time; memory allocation; memory manager; memory de-allocation; dynamic memory

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.

Pages: 1 to 6

Copyright: Copyright (c) IARIA, 2012

Publication date: July 22, 2012

Published in: conference

ISSN: 2308-4170

ISBN: 978-1-61208-222-6

Location: Nice, France

Dates: from July 22, 2012 to July 27, 2012