Dynamic tuning of garbage threshold to reduce unreclaimable garbage overhead
US-2024126689-A1 · Apr 18, 2024 · US
US9336137B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9336137-B2 |
| Application number | US-201213591734-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 22, 2012 |
| Priority date | Sep 2, 2011 |
| Publication date | May 10, 2016 |
| Grant date | May 10, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
An object that is not linked to a root object of a data model is identified. A first instruction comprising a fingerprint and a request to delete the object from memory is transmitted to a plurality of user devices. A second instruction to undo the first instruction is received from one of the plurality of user devices, and, in response to the second instruction, a third instruction comprising the fingerprint and a request to execute and delete any instruction that includes the fingerprint is transmitted to the plurality of user devices.
Opening claim text (preview).
The invention claimed is: 1. A method of managing data storage among a plurality of user devices, the method comprising: identifying an object that is not linked to a root object of a data model; transmitting to a plurality of user devices a first instruction comprising a fingerprint and a request to delete the object from memory; deleting, at each of the plurality of user devices, the object; generating, at each of the plurality of user devices, a reverse instruction that contains the fingerprint; receiving, substantially simultaneously from each of two of the plurality of user devices, a second instruction to undo the first instruction; and in response to the second instruction, transmitting to the plurality of user devices a third instruction comprising the fingerprint and a request to execute and delete any instruction that includes the fingerprint. 2. The method of claim 1 , further comprising: deleting the object from the data model. 3. The method of claim 1 , wherein the identifying step and the transmitting step are performed while performing a background garbage collection function. 4. The method of claim 1 , wherein the data model comprises an object constructed using one of a list, a map, and a primitive. 5. A non-transitory computer readable medium having program instructions stored thereon, the instructions capable of execution by a processor and defining the steps of: identifying an object that is not linked to a root object of a data model; transmitting to a plurality of user devices a first instruction comprising a fingerprint and a request to delete the object from memory; deleting, at each of the plurality of user devices, the object; generating, at each of the plurality of user devices, a reverse instruction that contains the fingerprint; receiving, substantially simultaneously from each of two of the plurality of user devices, a second instruction to undo the first instruction; and in response to the second instruction, transmitting to the plurality of user devices a third instruction comprising the fingerprint and a request to execute and delete any instruction that includes the fingerprint. 6. The non-transitory computer readable medium of claim 5 , further comprising instructions defining the step of: deleting the object from the data model. 7. The non-transitory computer readable medium of claim 5 , wherein the identifying step and the transmitting step are performed while performing a background garbage collection function. 8. The non-transitory computer readable medium of claim 5 , wherein the data model comprises an object constructed using one of a list, a map, and a primitive.
Garbage collection, i.e. reclamation of unreferenced memory · CPC title
Information retrieval; Database structures therefor; File system structures therefor · CPC title
Arrangements for program control, e.g. control units (program control for peripheral devices G06F13/10) · CPC title
Editing, e.g. inserting or deleting · CPC title
Indexing; Data structures therefor; Storage structures · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.