Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Fast Page-Set Allocation

IP.com Disclosure Number: IPCOM000034514D
Original Publication Date: 1989-Mar-01
Included in the Prior Art Database: 2005-Jan-27
Document File: 2 page(s) / 62K

Publishing Venue

IBM

Related People

Nordstrom, GM: AUTHOR

Abstract

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.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 2

Fast Page-Set Allocation

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. The algorithm receives as input the number of memory pages required to satisfy some request and locates the first available set of contiguous pages that satisfies tht request. The algorithm returns the starting memory address of the first page in that set or returns an invalid memory address to indicate that no satisfactory set is available. The release process combines the subject set with any preceeding or succeeding free pages, forming the largest possible set of free, contiguous pages. Both reservation and release operate on a page reservation table that records the allocation status of all sets of pages in the overall pool of memory pages. This table contains a single integer entry for each page in the pool, plus two additional entries that delineate the boundaries of the table. Initaialization of the table...