Fast Page-Set Allocation
Original Publication Date: 1989-Mar-01
Included in the Prior Art Database: 2005-Jan-27
This article describes a technique for fast, first-fit memory allocation in which the memory units are of uniform size. The allocation and release algorithms utilize simple integer arithmetic and require only a small reservation table proportional in size to the number of memory units. This reservation table maintains all status and linkage in (Image Omitted) formation. For these reasons, this technique is well suited to applications that have limited processor storage, very simple instruction set processors, or in which the controlling processor cannot physically access the subject memory. This algorithm performs dynamic reservation (allocation) and release (de-allocation) of uniform units, or pages, of memory belonging to a pool of pages.