MEMORY SYSTEM WITH TIERED QUEUING AND METHOD OF OPERATION THEREOF

• US 20120203993A1
• Filed: 02/07/2012
• Published: 08/09/2012
• Est. Priority Date: 02/08/2011
• Status: Abandoned Application

• Current Assignee: SanDisk Technologies LLC (Western Digital Corporation)
• Original Assignee: Smart Storage Systems Incorporated (Western Digital Corporation)
• Inventors: Jones, Ryan, Virgin, Theron
• Application Number:
  US13/368,224
• Publication Number:
  US 20120203993A1
• Time in Patent Office: Days
• US Class Current: 711/165
• CPC Class Codes: G06F 12/0246 in block erasable memory, e.g. flash memory
• CPC Class Codes: G06F 2212/7211 Wear leveling

Abstract

A method of operation of a memory system includes: providing a memory array having a dynamic queue and a static queue; and grouping user data by a temporal locality of reference having more frequently handled data in the dynamic queue and less frequently handled data in the static queue.

Claims

1. A method of operation of a memory system comprising:

providing a memory array having a dynamic queue and a static queue; and

grouping user data by a temporal locality of reference having more frequently handled data in the dynamic queue and less frequently handled data in the static queue.

2. The method as claimed in claim 1 further comprising moving the user data from the dynamic queue to the static queue when a threshold of time per read has been reached, of available memory blocks for the dynamic queue has been reached, or a combination thereof.

3. The method as claimed in claim 1 further comprising:

recycling a worn memory block from the static queue; and

allocating the worn memory block to the dynamic queue or the static queue.

4. The method as claimed in claim 1 wherein:

providing the memory array includes providing the memory array having an n^th queue with a lower priority for recycling than the static queue and the dynamic queue; and

further providing;

recycling a freed memory block from the n^th queue to the dynamic queue.

5. The method as claimed in claim 1 further comprising remapping a fresh memory block of the dynamic queue to the static queue when a threshold is met or exceeded and the fresh memory block has no invalid memory pages.

6. A method of operation of a memory system comprising:

providing a memory array having a dynamic queue and a static queue;

grouping user data by a temporal locality of reference having more frequently handled data in the dynamic queue and less frequently handled data in the static queue for display of real world physical objects on a display block;

allocating a fresh memory block to the dynamic queue with a dynamic pool block; and

allocating a worn memory block to the static queue with a static pool block.

7. The method as claimed in claim 6 further comprising coupling a controller block to the memory array and the controller block physically containing the dynamic pool block and the static pool block.

8. The method as claimed in claim 6 further comprising recycling the fresh memory block or the worn memory block when all memory pages of the fresh memory block or the worn memory block are designated as invalid.

9. The method as claimed in claim 6 further comprising mapping new data to a dynamic head of the dynamic queue.

10. The method as claimed in claim 6 wherein:

providing the memory array includes providing the memory array having an n^th queue with a lower priority for recycling than the static queue and the dynamic queue; and

further comprising;

mapping updated data from the n^th queue to the static queue.

11. A memory system comprising:

a memory array having;

a dynamic queue, and

a static queue coupled to the dynamic queue and with user data grouped by a temporal locality of reference having more frequently handled data in the dynamic queue and less frequently handled data in the static queue.

12. The system as claimed in claim 11 wherein the memory array is for allocating the user data from the dynamic queue to the static queue when a threshold of time per read has been reached, of available memory blocks for the dynamic queue has been reached, or a combination thereof.

13. The system as claimed in claim 11 further comprising a worn memory block recycled from the static queue and allocated to the dynamic queue or the static queue.

14. The system as claimed in claim 11 wherein:

the memory array having an n^th queue therein and the n^th queue having a lower priority for recycling than the static queue and the dynamic queue; and

further comprising;

a freed memory block recycled from the n^th queue mapped to the dynamic queue.

15. The system as claimed in claim 11 further comprising a fresh memory block of the dynamic queue remapped to the static queue when a threshold is met or exceeded and the fresh memory block has no invalid memory pages.

16. The system as claimed in claim 11 further comprising:

a fresh memory block mapped to the dynamic queue;

a worn memory block mapped to the static queue;

a dynamic pool block for allocating the fresh memory block to the dynamic queue; and

a static pool block for allocating the worn memory block to the static queue.

17. The system as claimed in claim 16 further comprising a controller block coupled to the memory array and the controller block physically containing the dynamic pool block and the static pool block.

18. The system as claimed in claim 16 wherein the fresh memory block or the worn memory block are recycled when all memory pages of the fresh memory block or the worn memory block are designated as invalid.

19. The system as claimed in claim 16 wherein the dynamic queue has a dynamic head and new data is mapped to the dynamic head.

20. The system as claimed in claim 16 wherein the memory array includes an n^th queue therein, and the n^th queue having a lower priority for recycling than the static queue and the dynamic queue, and data contained on the n^th queue is placed in the static queue when updated.