Using HEAPPOOLS to improve performance

Heap pools is an optional storage allocation algorithm for C/C++ applications that is much faster than the normal malloc()/free() algorithm in most circumstances. The algorithm is designed to avoid contention for storage in a multithreaded application, and therefore it is important to investigate if your application can benefit from its use.

The heap pools algorithm allows for between one and twelve sizes of storage cells that are allocated from pools out of the heap. For each size, from one to 255 pools can be created where each pool is used by a portion of the threads for allocating storage. The sizes of the cells, the number of pools for each size and cell pool extents are specified by the HEAPPOOLS runtime option, which is also used to enable the heap pools algorithm.