Pre-Grant Publication Number: 20080104353
Modified buddy system memory allocation
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application. Peer To Patent forwards the Top 10 most relevant prior art submissions and their annotations to the USPTO.

Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Annotations(0)
#227Tailored-List and Recombination-Delaying Buddy Systems (PDF)
Applies to Claims 1,13,19
Submitted by: Ian ShieldsLast updated: over 3 years ago
0 thumbs up 0 thumbs down
Summary / Description
Summary / DescriptionSee notes under previous prior art submission for this article.
 
Basic Information
Type of Prior ArtPrint Publication
 
Publication Title *ACM Transactions on Programming Languages and Systems (TOPLAS) Vol 6 Issue 1, Jan 1984 (PDF)
 
AuthorArie Kaufman
 
ISBN0164-0925
 
Page Range118-125
 
MediumBook excerpt
 
Publication Date *January 1984
 
URLhttp://portal.acm.org/toc.cfm?i...
 
Notes / To Do
NotesSee notes under previous prior art submission for this article. With luck I have both the reference AND the file uploaded this time.
 
Excerpt
Excerpt
See notes under previous prior art submission for this article.
 
Relevance
Claims
1
An apparatus, comprising:a modified buddy system memory allocator that receives a request for a size of memory;wherein the modified buddy system memory allocator identifies a plurality of contiguous, differently-sized memory blocks that are each smaller than the size of memory from the request;wherein the modified buddy system memory allocator allocates the plurality of contiguous, differently-sized memory blocks to satisfy the request for the size of memory.
Relevance
See notes under previous prior art submission for this article.
See notes under previous prior art submission for this article.
Claim Chart
All
13
A method, comprising the steps of:receiving a request for allocation of a size of memory;identifying a plurality of contiguous, differently-sized memory blocks that are each smaller than the size of memory from the request, wherein the plurality of contiguous, differently-sized memory blocks is organized in a plurality of different buddy system memory allocation free block lists; andallocating the plurality of contiguous, differently-sized memory blocks to satisfy the request for the size of memory.
Relevance
See notes under previous prior art submission for this article.
See notes under previous prior art submission for this article.
Claim Chart
All
19
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; andallocating the first memory block and the second memory block to a client application to satisfy the request for the size of memory.
Relevance
See notes under previous prior art submission for this article.
See notes under previous prior art submission for this article.
Claim Chart
All
0 days left
Activity
Application
Discussion (2)
Prior Art (3)
Research (0)
Subscribe to this Community
Invite a Reviewer
HOW TO USE PEER TO PATENT
Peer To Patent Videos