Peer To Patent

View Prior Art for Claim 00019

A method, comprising the steps of:receiving a request for allocation of a size of memory;

identifying a first memory block in a first modified buddy system memory allocation free block list of a first modified buddy system memory allocator, wherein a size of the first memory block is smaller than the size of memory from the request;

searching a second modified buddy system memory allocation free block list of a second modified buddy system memory allocator for a second memory block that is contiguous with the first memory block;

identifying the second memory block in the second modified buddy system memory allocation free block list, wherein a size of the second memory block is different from the size of the first memory block and is smaller than the size of memory from the request; and

allocating the first memory block and the second memory block to a client application to satisfy the request for the size of memory.

#225Tailored-List and Recombination-Delaying Buddy Systems

Applies to Claims 1,13,19

Submitted by: Ian ShieldsLast updated: almost 4 years ago

Title ACM Transactions on Programming Languages and Systems (TOPLAS) Vol 6 Issue 1, Jan 1984

ISBN 0164-0925

Description

1984 paper describing two variants of the buddy system for memory allocation.

1 thumb up 0 thumbs down

View Full Prior Art >

Annotations(0)

#226Tailored-List and Recombination-Delaying Buddy Systems (PDF)