US 2024/0192889 A1 · DE-FRAGMENTATION ACCELERATION USING OVERLAP TABLE

Abstract

The present disclosure generally relates to improved fragment processing while command fetching is on-going. Rather than stopping command fetching, the controller uses a short fragment list, while command fetching can continue, to add a fragment. The controller first adds new fragments to the short list with the fragment information. The information is then checked for size. If the fragment information is smaller than the short fragment list, then the fragment list is updated during command fetching. As a command arrives, the controller does a binary search of a sorted fragment list. The results are stored and later scanned by the controller for matches with the short fragment list. If there are no matches in the short list, then the controller uses the stored results to update the search result. If there is a match in the short list then the controller uses the new results to update the search list.

Claims20

Dependent claims

A data storage device, comprising:

a memory device;
and
a controller coupled to the memory device, wherein the controller is configured to:
maintain a defragmentation table;
receive a request to add a fragment to the defragmentation table;
store the added fragment in a fragment list, wherein the fragment list is distinct from the defragmentation table;
and
update the defragmentation table with entries from the fragment list;
and
clear the fragment list.

7 more elements

Dependencies are inferred from the claim text.

De-fragmentation acceleration using overlap table

Life of this patent

De-fragmentation acceleration using overlap table

Life of this patent

Abstract

Claims20