Pre-Grant Publication Number: 20070118712
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 United States Patent and Trademark Office.
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.
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
Summary / Description
| Summary / Description | Method for dynamic storage allocation |
Basic Information
| Type of Prior Art | Print Publication |
| Publication Title * | The Art of Computer Programing |
| Author | Donald E. Knuth |
| ISBN | 0-201-03809-9 |
| Page Range | Section 2.5 pages 435-451 |
| Medium | Book excerpt |
| Publication Date * | 1973 |
| URL | |
Notes / To Do
| Notes | |
Excerpt
Excerpt |
Relevance
Claims
1
A method for allocating memory freed by applications in a computer system having an operating system (O/S), said method comprising:
a) designating a status of said one or more freed memory units previously associated with an application as available for reuse;
b) organizing one or more freed memory units having said available for reuse status into one or more free memory pools, wherein freed memory units in a pool are directly allocated to an application requiring backing physical memory store without the O/S deleting data in the freed memory units.
Relevance
Section 2.5 in Kunth's book describes this process along with algorithm and pseudo code.
Section 2.5 in Kunth's book describes this process along with algorithm and pseudo code.
Claim Chart
All
0 days left
