Method and Apparatus for Allocating Client Resources to Multiple Applications
US-2019073149-A1 · Mar 7, 2019 · US
US9104686B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9104686-B2 |
| Application number | US-201113341785-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 30, 2011 |
| Priority date | Dec 16, 2008 |
| Publication date | Aug 11, 2015 |
| Grant date | Aug 11, 2015 |
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.
A method and system of managing data in a storage device is provided. The method includes receiving a request to store content in a storage device. If the content is discardable content, the content is divided into a plurality of discardable data objects, each associated with at least one type of discarding priority data. The discardable data objects in the storage device are managed based on the discarding priority data associated with each discardable data object. Management of discardable objects may include selection and deletion of discardable objects based on discarding priority data, as well as further subdivision of existing discardable objects, to maintain a desired amount of free space on the storage device. The system may include a host having a processor and a storage device interface configured to execute the method, or a storage device having a processor configured to execute the disclosed methods.
Opening claim text (preview).
What is claimed is: 1. A method for host management of a non-volatile memory, the method comprising: in a host to which a non-volatile memory is operatively coupled: in response to a request to store at least a portion of content in the non-volatile memory, dividing the at least a portion of the content into a plurality of discardable data objects and associating each discardable data object with discarding priority data; and in response to a request to store new data or new discardable content when the non-volatile memory has less than a predetermined amount of free space to accommodate the new data or new discardable content: subdividing at least one of the plurality of discardable data objects into new discardable data objects; arranging a list of the discardable data objects and new discardable data objects for automatic deletion, the arranged list having an order based on respective discarding priority data; and identifying for deletion discardable data objects or new discardable data objects in the arranged list sufficient to achieve the predetermined amount of free space. 2. The method of claim 1 , wherein associating each discardable data object with discarding priority data comprises associating at least one discardable data object of the content with different discarding priority data than discarding priority data of a discardable data object of different content. 3. The method of claim 1 , further comprising updating an existing discarding priority data of at least one discardable data object. 4. The method of claim 3 , wherein associating each discardable data object with a discarding priority data comprises assigning a first of a sequence of discardable data objects of the discardable content discarding priority data such that the first of the sequence has a lower likelihood of deletion than any remaining discardable data objects of the content. 5. The method of claim 3 , where updating the existing discarding priority data comprises updating the existing discarding priority data with different discarding priority data than that of another discardable data object of the content. 6. The method of claim 5 , wherein updating the existing discarding priority data of at least one discardable data object comprises changing the existing discarding priority data based on at least one dynamic priority criteria determined when the at least one discardable data object is accessed. 7. The method of claim 6 , wherein the at least one dynamic priority criteria comprises a time of last access of the discardable data object. 8. The method of claim 1 , wherein identifying for deletion comprises selectively identifying for deletion, based on respective discarding priority data for the discardable data objects, one or more discardable data objects without identifying all discardable data objects for the content in order to free space in the non-volatile memory. 9. The method of claim 1 , wherein identifying for deletion comprises selectively identifying for deletion one or more discardable data objects of a first content, without identifying all discardable data objects for the first content, in response to receipt of another content wherein a number of discardable data objects of different content is maximized. 10. A host system for managing a non-volatile memory, the host system comprising: a host processor and a non-volatile memory interface configured for communication with the non-volatile memory; wherein the host processor is configured to: in response to a request to store at least a portion of content in the non-volatile memory, divide the at least a portion of the content into a plurality of discardable data objects and associate each discardable data object with discarding priority data; and in response to a request to store new data or new discardable content when in the non-volatile memory has less than a predetermined amount of free space to accommodate the new data or new discardable content: subdivide at least one of the plurality of discardable data objects into new discardable data objects; arrange a list of the discardable data objects and new discardable data objects for automatic deletion, the arranged list having an order based on respective discarding priority data; and identify for deletion discardable data objects or new discardable data objects in the arranged list sufficient to achieve the predetermined amount of free space. 11. The host system of claim 10 , wherein the host processor is configured to associate at least one discardable data object of the content with different discarding priority data than the discarding priority data of another discardable data object of the content. 12. The host system of claim 11 , wherein the host processor is configured to associate a first of a sequence of discardable data objects of the content with discarding priority data such that the first of the sequence has a lower likelihood of deletion than any remaining discardable data objects of the content. 13. The host system of claim 10 , wherein the host processor is configured to update existing discarding priority data of at least one discardable data object. 14. The host system of claim 13 , wherein the host processor is configured to update existing discarding priority data based on at least one dynamic priority criteria determined when the at least one discardable data object is accessed. 15. The host system of claim 14 , wherein the at least one dynamic priority criteria comprises an age of the discardable data object. 16. The host system of claim 10 , wherein the host processor is configured to maximize a number of discardable data objects of different contents. 17. A method for managing a non-volatile memory of a memory system operatively coupled with a host, the method comprising: in a processor of the memory system, where the processor is in communication with non-volatile memory, the processor: in response to a request to store at least a portion of content in the non-volatile memory, dividing the at least a portion of the content into a plurality of discardable data objects and associating each discardable data object with discarding priority data; and in response to a request to store new data or new discardable content when a predetermined amount of free space is unavailable in the non-volatile memory to accommodate the new data or new discardable content: subdividing at least one of the plurality of discardable data objects into new discardable data objects; arranging a list of the discardable data objects and new discardable data objects for automatic deletion, the arranged list having an order based on respective discarding priority data; and deleting discardable data objects or new discardable data objects in the arranged list sufficient to achieve the predetermined amount of free space. 18. The method of claim 17 , wherein associating each discardable data object with discarding priority data comprises associating at least one discardable data object of the content with different discarding priority data than discarding priority data of a discardable data object of different content. 19. The method of claim 17 , further comprising updating an existing discarding priority data of at least one discardable data object. 20. The method of claim 19 , wherein associating each discardable data object with a discarding priority data comprises assigning a first of a sequence of discardable data objects of the discardable content discarding priority data such that the first of the se
Physics · mapped topic
for reducing power consumption or coping with limited storage space, e.g. in mobile devices (saving storage space on storage devices G06F3/0608; power saving in storage systems G06F3/0625) · CPC title
Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket · CPC title
Management of blocks · CPC title
Improving or facilitating administration, e.g. storage management · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.