Data storage device and method for handling write commands in zoned storage

Patent metadata

Field	Value
Publication number	US-12124377-B2
Application number	US-202318222034-A
Country	US
Kind code	B2
Filing date	Jul 14, 2023
Priority date	Oct 26, 2022
Publication date	Oct 22, 2024
Grant date	Oct 22, 2024

Abstract

Zoned memory typically requires write commands to be sent from a host to a data storage device in logical block address (LBA) sequential order. Instead of rejecting out-of-order write commands, the data storage device can execute those commands and internally deal with the out-of-order problem. For example, the data storage device can use a special zone logical-to-physical address table, use a temporary zone data buffer, and/or store a data's LBA in a header for later matching.

First claim

What is claimed is:

1. A data storage device comprising:
a memory; and
a controller coupled with the memory and configured to:
receive, from a host, a write command comprising data and a logical block address in a zone of the memory;
determine that the logical block address does not match an expected logical block address; and
in response to determining that the logical block address does not match the expected logical block address:
write the data to a physical address in the zone of the memory, wherein the data is stored out-of-order with respect to other data stored in the zone of the memory; and
maintain a logical-to-physical address map for the zone that maps the logical block address to the physical address.

2. The data storage device of claim 1 , wherein the controller is further configured to:
receive a read command comprising the logical block address;
use the logical-to-physical address map to identify the physical address in the memory that stores the data; and
read the data from the physical address.

3. The data storage device of claim 1 , wherein the expected logical block address is pointed to by a write pointer.

4. The data storage device of claim 1 , wherein a queue depth is greater than one.

5. The data storage device of claim 1 , wherein the controller is further configured to provide a recommendation to the host to perform garbage collection in response to determining that the logical block address does not match the expected logical block address.

6. The data storage device of claim 1 , wherein the controller is further configured to re-write the data in the zone so that the data is not out-of-order with respect to the other data stored in the zone.

7. The data storage device of claim 1 , wherein the memory comprises a three-dimensional memory.

8. In a data storage device comprising a non-volatile memory, a method comprising:
receiving, from a host, a write command comprising data and a logical block address in a zone of the non-volatile memory;
determining that the logical block address does not match an expected logical block address; and
in response to determining that the logical block address does not match the expected logical block address:
writing the data in a temporary buffer;
creating a logical-to-physical address map that maps the logical block address to a physical address in the non-volatile memory; and
using the logical-to-physical address map to copy the data from the temporary buffer to the physical address in the non-volatile memory.

9. The method of claim 8 , wherein the temporary buffer is part of the non-volatile memory.

10. The method of claim 8 , wherein the expected logical block address is pointed to by a write pointer.

11. The method of claim 8 , wherein a queue depth is greater than one.

12. The method of claim 8 , further comprising
in response to determining that the logical block address does not match the expected logical block address, providing a recommendation to the host to perform garbage collection.

13. The method of claim 8 , further comprising:
re-writing the data in the zone so that the data is not out-of-order with respect to the other data stored in the zone.

14. A data storage device comprising:
a memory;
means for storing, in a zone of the memory, data and a logical block address of the data, wherein the logical block address is stored in a header of the data;
means for reading the data from the zone of the memory in response to receiving a read command comprising a requested logical block address; and
means for finding, in the memory, data that corresponds to the requested logical block address in the read command in response to determining that the logical block address read from the zone of the memory does not match the requested logical block address in the read command.

15. The data storage device of claim 14 , wherein the data is stored in the memory even if the logical block address of the data does not match an expected logical block address.

16. The data storage device of claim 14 , further comprising means for re-writing the data in an expected order in the memory during idle time, wherein the re-writing is transparent to the host.

17. The data storage device of claim 14 , further comprising means for providing a recommendation to the host to perform garbage collection in response to determining that the logical block address read from the memory does not match the requested logical block address in the read command.

18. The data storage device of claim 14 , wherein the expected logical block address is pointed to by a write pointer.

19. The data storage device of claim 14 , wherein a queue depth is greater than one.

20. The data storage device of claim 14 , wherein the memory comprises a three-dimensional memory.

Assignees

• Western Digital Tech Inc
• Sandisk Technologies Inc

Inventors

• Sela Rotem
• Oshinsky Hadas
• Zilberstein Einav

Classifications

• G06F3/0679

  Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP] · CPC title

• G06F3/0644

  Management of space entities, e.g. partitions, extents, pools · CPC title

• G06F3/0604

  Improving or facilitating administration, e.g. storage management · CPC title

• G06F12/0253

  Garbage collection, i.e. reclamation of unreferenced memory · CPC title

• G06F12/123

  with age lists, e.g. queue, most recently used [MRU] list or least recently used [LRU] list · CPC title