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 | This research paper describes an advanced memory allocator that exhibits many of the novel claims made by the disclosure. |
Basic Information
| Type of Prior Art | Online Publication |
| URL | |
| Author/Creator | Emery D. Berger, Kathryn S. McKinleyy, Robert D. Blumofe, Paul R. Wilson |
| Title | Hoard: A Scalable Memory Allocator |
| Publication Date | November 15, 2000 |
| Publisher | |
| Directions to Document Location | |
| Additional Information | |
Notes / To Do
| Notes | In particular, section 3.1 "Bounding Blowup" specifically describes a caching allocator that does not return memory to the Operating System once it has been freed by an application. The paper also describes the Hoard allocator scheme such that s |
Excerpt
Excerpt Each heap “owns” a number of superblocks. When there is no
memory available in any superblock on a thread’s heap, Hoard
obtains a superblock from the global heap if one is available. If the global heap is also empty, Hoard creates a new superblock by requesting virtual memory from the operating system and adds it to the thread’s heap. Hoard does not currently return empty superblocks to the operating system. It instead makes these superblocks
available for reuse. |
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
From the paper we learn that there is prior art for maintaining memory in heaps and that not returning the memory to the Operating System can increase performance. Furthermore we can learn that there is prior art for maintaining separate heaps on a per thread/processor basis in addition to a system wide heap.
From the paper we learn that there is prior art for maintaining memory in heaps and that not returning the memory to the Operating System can increase performance. Furthermore we can learn that there is prior art for maintaining separate heaps on a per thread/processor basis in addition to a system wide heap.
Claim Chart
All
0 days left
