Memory management: Fast Efficient Fixed-Sized Memory Pools

Speaker:  Benjamin Kenwright – Leicester, United Kingdom
Topic(s):  Computational Theory, Algorithms and Mathematics

Abstract

This lecture discusses the importance of memory in the context of performance.  We examine and present 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 video games. The algorithm achieves this by exploiting the unused memory slots for book-keeping 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.

About this Lecture

Number of Slides:  31
Duration:  60 minutes
Languages Available:  English
Last Updated: 

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.