  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.
