IP Library Granted Patent US 12,505,154
Granted Patent B1
US 12,505,154 · App. 18/810,720 · Granted Dec 23, 2025

Data storage device and method for video frame link-based management and processing

Inventors: Dharmaraju Marenahally Krishna (Bengaluru, IN); Ramanathan Muthiah (Bangalore, IN)
Assignee: Sandisk Technologies, Inc.
G06F16/48G06F16/41
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,505,154
App. No.
18/810,720
Granted
Dec 23, 2025
Kind
B1
Abstract

A data storage device and method are disclosed for video frame link-based management and processing. In one embodiment, the data storage devices' one or more processors, individually or in combination, are configured to: receive, from a host, a plurality of image frames, at least some of which have been tagged by the host; store the plurality of image frames in the memory; create a data structure that identifies locations in the memory that store the image frames that have been tagged by the host; receive, from the host, a request to perform an operation on the image frames that have been tagged by the host; use the data structure to retrieve, from the memory, the image frames that have been tagged by the host; and perform the operation on the image frames that have been tagged by the host. Other embodiments are provided.

Claims (55)

1 . A data storage device comprising:

a memory; and

one or more processors, individually or in combination, configured to:

receive, from a host, a plurality of image frames, wherein a subset of the plurality of image frames have been tagged by the host;

segregate the subset of the plurality of image frames from the plurality of image frames;

create parity protection for the subset of the plurality of image frames, wherein relatively-stronger parity protection is created for the subset of the plurality of image frames than for-nontagged image frames;

store the plurality of image frames in the memory, wherein the subset of the plurality of image frames are stored in blocks of the memory that have a relatively-higher endurance than blocks of the memory that store the non-tagged image frames;

create a data structure that identifies locations in the memory that store the subset of the plurality of image frames;

use the data structure to prioritize garbage collection of the blocks of the memory that store the subset of the plurality of image frames over the blocks of the memory that store the non-tagged image frames;

receive, from the host, a request to perform an operation on the subset of the plurality of image frames;

perform a read look-ahead process to retrieve the subset of the plurality of image frames by:

using the data structure to identify the blocks in the memory that store the subset of the plurality of images; and

retrieving, from the memory, the subset of the plurality of image frames wherein images in the subset of the plurality of image frames are retrieved from the memory prior to receiving, from the host logical block addresses for those images; and

perform the operation on the subset of the plurality of image frames.

2 . The data storage device of claim 1 , wherein the one or more processors, individually or in combination, are further configured to route the subset of the plurality of image frames to relatively higher-capacity blocks of the memory.

3 . The data storage device of claim 1 , wherein the one or more processors, individually or in combination, are further configured to store the data structure in a control block in the memory.

4 . The data storage device of claim 1 , wherein the data structure comprises a linked list.

5 . The data storage device of claim 1 , wherein the image frames in the subset of the plurality of image frames are tagged with metadata.

6 . The data storage device of claim 1 , wherein the one or more processors, individually or in combination are further configured to predict invalidation of image frames that have not been tagged by the host.

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

8 . The data storage device of claim 1 , wherein the parity protection comprises exclusive-or parity.

9 . The data storage device of claim 1 , wherein the parity protection comprises error correction code parity.

10 . A method comprising:

performing in a data storage device comprising a memory:

receiving, from a host, a plurality of image frames, wherein a subset of the plurality of image frames have been tagged by the host;

segregating the subset of the plurality of image frames from the plurality of image frames;

creating parity protection for the subset of the plurality of image frames, wherein relatively-stronger parity protection is created for the subset of the plurality of image frames than for non-tagged image frames;

storing the plurality of image frames in the memory, wherein the subset of the plurality of image frames are stored in blocks of the memory that have a relatively-higher endurance than blocks of the memory that store the non-tagged image frames;

creating a data structure that identifies locations in the memory that store the subset of the plurality of image frames;

using the data structure to prioritize garbage collection of the blocks of the memo that store the subset of the plurality of image frames over the blocks of the memory that store the non-tagged image frames;

receiving, from the host, a request to perform an operation on the subset of the plurality of image frames;

performing a read look-ahead process to retrieve the subset of the plurality of image frames by:

using the data structure to identify the blocks in the memory that store the subset of the plurality of images; and

retrieving, from the memory, the subset of the plurality of image frames, wherein images in the subset of the plurality of image frames are retrieved from the memory prior to receiving from the host logical block addresses for those images; and

performing the operation on the subset of the plurality of image frames.

11 . The method of claim 10 , further comprising routing the subset of the plurality of image frames to relatively higher-capacity blocks of the memory.

12 . The method of claim 10 , further comprising storing the data structure in a control block in the memory.

13 . The method of claim 10 , wherein the data structure comprises a linked list.

14 . The method of claim 10 , wherein the parity protection comprises exclusive-or parity.

15 . The method of claim 10 , wherein the parity protection comprises error correction code parity.

16 . The method of claim 10 , wherein the memory comprises a three-dimensional memory.

17 . A data storage device comprising:

a memory; and

means for:

receiving from a host, a plurality of image frames, wherein a subset of the plurality of image frames have been tagged by the host;

segregating the subset of the plurality of image frames from the plurality of image frames;

creating parity protection for the subset of the plurality of image frames, wherein relatively-stronger party protection is created for the subset of the plurality of image frames than for non-tagged image frames;

storing the plurality of image frames in the memory, wherein the subset of the plurality of image frames are stored in blocks of the memory that have a relatively-higher endurance than blocks of the memory that store the non-tagged image frames;

creating a data structure that identifies locations in the memory that store the subset of the plurality of image frames;

using the data structure to prioritize garbage collection of the blocks of the memory that store the subset of the plurality of image frames over the blocks of the memory that store the non-tagged image frames;

receiving, from the host, a request to perform an operation on the subset of the plurality of image frames;

performing a read look-ahead process to retrieve the subset of the plurality of image frames by:

using the data structure to identify the blocks in the memory that store the subset of the plurality of images; and

retrieving from the memory, the subset of the plurality of image frames, wherein images in the subset of the plurality of image frames are retrieved from the memory prior to receiving, from the host, logical block addresses for those images; and

performing the operation on the subset of the plurality of image frames.

Assignments (4)
SECURITY AGREEMENT Recorded Apr 25, 2025
From: SANDISK TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 071050/0001 →
PARTIAL RELEASE OF SECURITY INTERESTS Recorded Apr 25, 2025
From: JPMORGAN CHASE BANK, N.A., AS AGENT
To: SANDISK TECHNOLOGIES, INC.
Reel/Frame 071382/0001 →
SECURITY AGREEMENT (SUPPLEMENTAL) Recorded Nov 14, 2024
From: SANDISK TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 069411/0486 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 21, 2024
From: KRISHNA, DHARMARAJU MARENAHALLY; MUTHIAH, RAMANATHAN
To: SANDISK TECHNOLOGIES, INC.
Reel/Frame 068351/0878 →
References Cited (8)
US 7020351B1 · Kumar et al. · 2006 [cited by applicant]
US 9036977B2 · Patten et al. · 2015 [cited by applicant]
US 9251503B2 · Sharma et al. · 2016 [cited by applicant]
US 9600483B2 · Lindley · 2017 [cited by examiner]
US 10841645B1 · Muthiah · 2020 [cited by applicant]
US 10897658B1 · Sethu et al. · 2021 [cited by applicant]
US 20110033115A1 · Shiraishi et al. · 2011 [cited by applicant]
US 20250104380A1 · Matusek · 2025 [cited by examiner]