Pre-Grant Publication Number: 20070118712
Collaborate on the process of community review for this application. Posting will not be forwarded to the USPTO. Flagging a post as an ACTION ITEM signals further research. Flagging SPAM and ABUSE helps to manage discussion. Placing double brackets around a reference to a claim or prior art will create a hyperlink to the original ex. [[claim 1]] and [[prior art 2]].

Please review the Community Code of Conduct prior to posting

Discussion (15)
  Facilitator's Comment     Action Item
  Show without Noise

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.


Paul McKenney (about 1 year ago)
Regarding Claim 00002: Again, see the paper entitled "Hoard: A Scalable Memory Allocator for Multithreaded Applications" ( This reference has already been associated with this patent application (Prior Art Reference 45).

Figure 1 & Section 3.2 shows how heaps (groups of memory blocks) are associated with threads, which in turn on UNIX systems (as noted in Section 5) are associated with applications.

Therefore, Prior Art Reference 45 anticipates this claim.