Enhancements made to the NewBSD Operating System to improve system performance by sharing memory between processes.

This research paper shows prior art for specialised memory allocators. In particular this is relevant as it teaches us prior art for policy based allocators as claimed by the disclosure.

This research paper describes an advanced memory allocator that exhibits many of the novel claims made by the disclosure.

A parallel memory scheduler for execution on a high speed highly parallel multiprocessor architecture. The operating system software provides intelligence and efficiency in swapping out process images to facilitate swapping in another process. The splitting and coalescing of data segments are used to fit segments in to current free memory even though a single contiguous space of sufficient size does not exist. Mapping these splits through data control register sets retains the user's contiguous view of the address space. The existence of dual images and partial swapping allows efficient, high speed swapping

AIX base technical reference for the disclaim subroutine which allows one to mark memory for reuse without freeing the memory.

Method for dynamic storage allocation

Kernel based memory allocator using pools and avoiding initializing memory on free.

IBM Mainframe software environment, with "getmain" and "freemain" on pages 106-109 of the physical PDF. Likely available in print as well. Prior edition published 1999 (doc ID SC09-4461-05).