IP Library › Granted Patent US 12,681,862
Granted Patent B2
US 12,681,862 · App. 18/772,045 · Granted Jul 14, 2026

Systems and methods for identifying regions of a memory device

Inventors: Michael Wasef (San Jose, CA); Andrew Chang (Los Altos, CA)
Assignee: Samsung Electronics Co., Ltd.
G06F12/0862G06F3/0604G06F3/0655G06F3/0679G06F2212/602
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,681,862
App. No.
18/772,045
Filed
Jul 12, 2024
Granted
Jul 14, 2026
Kind
B2
Art Unit
2139
USPC
711/118
Abstract

Systems and methods for identifying regions of a memory device are disclosed. A storage device comprises a first storage medium, a second storage medium, and a processor configured to: identify a first memory address; identify a first region of the first storage medium based on the first memory address; identify a first criterion associated with the first memory address; based on identification of the first criterion, identify a portion of the first region based on the first memory address; identify a second criterion associated with the portion; and retrieve data associated with the portion from the first storage medium to the second storage medium based on identification of the second criterion.

Claims (53)

1 . A storage device comprising:

a first storage medium associated with a first access latency;

a second storage medium associated with a second access latency lower than the first access latency;

a processor configured to:

identify, based on a request from an application, a first physical memory address of the first storage medium;

identify, based on the request, a first range of physical memory addresses of a first region of the first storage medium based on the first physical memory address;

identify a second range of physical memory addresses of a portion of the first region based on the first physical memory address;

identify a number of memory accesses associated with the portion; and

access the first storage medium over a data interface connection and retrieve data associated with the portion from the first storage medium to the second storage medium based on the number of memory accesses to the portion.

2 . The storage device of claim 1 , wherein the processor being configured to identify the second range of physical memory addresses is based on the first physical memory address being a threshold distance away from a second memory address.

3 . The storage device of claim 1 , wherein the processor is configured to:

identify a second memory address of the second range of physical memory addresses satisfying a third criterion;

identify a third memory address of the second range of physical memory addresses satisfying a fourth criterion; and

retrieve data between the second memory address and the third memory address.

4 . The storage device of claim 1 , wherein the processor is further configured to:

update a counter associated with the portion based on access of the first physical memory address.

5 . The storage device of claim 4 , wherein the processor being configured to identify the number of memory accesses associated with the portion is based on the counter being greater than a threshold value.

6 . The storage device of claim 1 , wherein the processor is further configured to:

maintain a list of identified portions;

determine a number of the identified portions in the list;

determine that the number of the identified portions is less than a threshold number; and

add the portion to the list based on the number of the identified portions being less than the threshold number.

7 . The storage device of claim 6 , wherein the processor being configured to retrieve the data is based on the portion being added to the list.

8 . The storage device of claim 6 , wherein the processor is further configured to:

detect a condition;

based on detecting the condition, identify a third criterion associated with the portion; and

based on identifying the third criterion, remove the portion from the list.

9 . The storage device of claim 8 , wherein the third criterion is based on an access of an address associated with the portion.

10 . A method comprising:

identifying, based on a request from an application, a first physical memory address of a first storage medium;

identifying, based on the request, a first range of physical memory addresses of a first region of a first storage medium based on the first physical memory address;

identifying a second range of physical memory addresses of a portion of the first region based on the first physical memory address;

identifying a number of memory accesses associated with the portion; and

accessing the first storage medium over a data interface connection and retrieving data associated with the portion from the first storage medium to a second storage medium based on the number of memory accesses to the portion, wherein the first storage medium is associated with a first access latency and the second storage medium is associated with a second access latency lower than the first access latency.

11 . The method of claim 10 , wherein the identifying of the second range of physical memory addresses is based on the first physical memory address being a threshold distance away from a second memory address.

12 . The method of claim 10 further comprising:

identifying a second memory address of the second range of physical memory addresses satisfying a third criterion;

identifying a third memory address of the second range of physical memory addresses satisfying a fourth criterion; and

retrieving data between the second memory address and the third memory address.

13 . The method of claim 10 further comprising:

updating a counter associated with the portion based on access of the first physical memory address.

14 . The method of claim 13 , wherein the identifying of the number of memory accesses associated with the portion is based on the counter being greater than a threshold value.

15 . The method of claim 10 further comprising:

maintaining a list of identified portions;

determining a number of the identified portions in the list;

determining that the number of the identified portions is less than a threshold number; and

adding the portion to the list based on the number of the identified portions being less than the threshold number.

16 . The method of claim 15 further comprising retrieving the data based on the portion being added to the list.

17 . The method of claim 15 further comprising:

detecting a condition;

based on detecting the condition, identifying a third criterion associated with the portion; and

based on identifying the third criterion, removing the portion from the list.

18 . The method of claim 17 , wherein the third criterion is based on an access of an address associated with the portion.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 12, 2024
From: WASEF, MICHAEL; CHANG, ANDREW
To: SAMSUNG ELECTRONICS CO., LTD.
Reel/Frame 068568/0503 →
Continuity (2)
Provisional Application 63561504 · Mar 5, 2024
Related Publication 20250284641A1 · Sep 11, 2025
References Cited (54)
US 6910106B2 · Sechrest et al. · 2005 [cited by applicant]
US 7689761B2 · Yim et al. · 2010 [cited by applicant]
US 8838931B1 · Marshak et al. · 2014 [cited by applicant]
US 8838935B2 · Hinton et al. · 2014 [cited by applicant]
US 8935493B1 · Dolan et al. · 2015 [cited by applicant]
US 9026765B1 · Marshak et al. · 2015 [cited by applicant]
US 9189407B2 · Zeidner et al. · 2015 [cited by applicant]
US 9251056B2 · Fang et al. · 2016 [cited by applicant]
US 9582199B2 · Ranjith Reddy et al. · 2017 [cited by applicant]
US 10073656B2 · Zhe Yang et al. · 2018 [cited by applicant]
US 10095624B1 · Visvanathan et al. · 2018 [cited by applicant]
US 10387318B2 · Hooker et al. · 2019 [cited by applicant]
US 10387320B2 · Brekelbaum et al. · 2019 [cited by applicant]
US 10742399B2 · Chen et al. · 2020 [cited by applicant]
US 11321636B2 · Hsu et al. · 2022 [cited by applicant]
US 11829627B2 · Roberts et al. · 2023 [cited by applicant]
US 20100115206A1 · de la Iglesia et al. · 2010 [cited by applicant]
US 20140379995A1 · Kwon et al. · 2014 [cited by applicant]
US 20150106578A1 · Warfield et al. · 2015 [cited by applicant]
US 20160054997A1 · Radhakrishnan et al. · 2016 [cited by applicant]
US 20170010970A1 · Chou · 2017 [cited by applicant]
US 20170091104A1 · Rafacz et al. · 2017 [cited by applicant]
US 20180173631A1 · Sartorius et al. · 2018 [cited by applicant]
US 20190370632A1 · Hashemi et al. · 2019 [cited by applicant]
US 20200371942A1 · Anastasiev et al. · 2020 [cited by applicant]
US 20210019069A1 · Sen et al. · 2021 [cited by applicant]
US 20220019530A1 · Roberts · 2022 [cited by applicant]
US 20220050722A1 · Dugast et al. · 2022 [cited by applicant]
US 20220058132A1 · Roberts et al. · 2022 [cited by applicant]
US 20220222511A1 · Sharma et al. · 2022 [cited by applicant]
US 20220342578A1 · Chen et al. · 2022 [cited by applicant]
US 20230185572A1 · Licht et al. · 2023 [cited by applicant]
US 20230205699A1 · Sha · 2023 [cited by examiner]
US 20230222065A1 · Reed et al. · 2023 [cited by applicant]
US 20230315452A1 · Constable · 2023 [cited by examiner]
US 20240385966A1 · Li · 2024 [cited by examiner]
CN 101853303A · 2010 [cited by applicant]
CN 107391034B · 2019 [cited by applicant]
CN 112799589A · 2021 [cited by applicant]
CN 116991476A · 2023 [cited by applicant]
KR 102031490B1 · 2019 [cited by applicant]
WO WO2023045492A1 · 2023 [cited by applicant]
WO WO2023061567A1 · 2023 [cited by applicant]
WO WO2023061569A1 · 2023 [cited by applicant]
Abts, D., et al., “Age-Based Packet Arbitration in Large-Radix k-ary n-cubes,” SC '07: Proceedings of the 2007 ACM/IEEE Conference on Supercomputing, Reno, NV, USA, Jan. 8, 2010, pp. 1-11, https://ieeexplore.ieee.org/do… [cited by applicant]
Hasan, Maruf, et al., “Practical Memory Disaggregation,” Diss. University of Michigan Library, 2023, 172 pages, https://deepblue.lib.umich.edu/handle/2027.42/177792. [cited by applicant]
Staelin, Carl Hudson, “High-performance file system design,” Princeton University, 1991, 99 pages, https://www.cs.princeton.edu/research/techreps/TR-347-91. [cited by applicant]
Zhang, Teng, et al., “SA-LSM: Optimize Data Layout for LSM-tree Based Storage using Survival Analysis,” Proceedings of the VLDB Endowment 15.10, Jun. 1, 2022, pp. 2161-2174, https://dl.acm.org/doi/abs/10.14778/3547305.3… [cited by applicant]
T. Mohan, B. R. de Supinski, S. A McKee, F. Mueller, A Yoo and M. Schulz, “Identifying and Exploiting Spatial Regularity in Data Memory References,” SC '03: Proceedings of the 2003 ACM/IEEE Conference on Supercomputing,… [cited by applicant]
US Office Action dated Aug. 6, 2025, issued in U.S. Appl. No. 18/772,039 (14 pages). [cited by applicant]
US Office Action dated Nov. 12, 2025, issued in U.S. Appl. No. 18/772,031 (21 pages). [cited by applicant]
US Final Office Action dated Nov. 24, 2025, issued in U.S. Appl. No. 18/772,039 (15 pages). [cited by applicant]
US Office Action dated Mar. 12, 2026, issued in U.S. Appl. No. 18/772,039 (14 pages). [cited by applicant]
US Final Office Action dated Apr. 3, 2026, issued in U.S. Appl. No. 18/772,031 (24 pages). [cited by applicant]