IP Library › Granted Patent US 12,386,559
Granted Patent B2
US 12,386,559 · App. 18/432,946 · Granted Aug 12, 2025

Access tracking in memory

Inventors: Cagdas Dirik (Indianola, WA); Robert M. Walker (Raleigh, NC); Elliott C. Cooper-Balis (San Jose, CA)
Assignee: Micron Technology, Inc.
G06F3/0659G06F3/0604G06F3/0653G06F3/0679G06F12/0246G06F12/12
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,386,559
App. No.
18/432,946
Granted
Aug 12, 2025
Kind
B2
Abstract

An access tracker configured to receive a request to access a page, determine whether a page identification (ID) associated with the page is in the access tracker, increment an access count of the page in response to determining the page ID is in the access tracker, sort a number of page IDs based on an access count of each page ID, and determine whether a different page is hot or cold in response to sorting the number of page IDs.

Claims (43)

1. An apparatus, comprising:

a first access tracker;

a second access tracker; and

a processor configured to:

determine an access count of a page ID with a lowest access count in the first access tracker;

erase a page associated with the lowest access count;

transmit the access count of the page ID with the lowest access count to the second access tracker in response to determining the page ID has the lowest access count; and

perform a hash function on the page ID with the lowest access count.

2. The apparatus of claim 1 , wherein the processor is configured to remove the access count of the page ID with the lowest access count from the first access tracker.

3. The apparatus of claim 1 , wherein the processor is configured to sort a number of page IDs in the first access tracker based on access counts to determine the access count of the page ID with the lowest access count in the first access tracker.

4. The apparatus of claim 1 , comprising a memory sub-system controller comprising the first access tracker and the second access tracker.

5. The apparatus of claim 4 , comprising a first memory device coupled to the memory sub-system controller.

6. The apparatus of claim 5 , comprising a second memory device coupled to the memory sub-system controller.

7. The apparatus of claim 6 , wherein the processor is configured to store the page associated with the lowest access count in the second memory device.

8. An apparatus, comprising:

a first access tracker;

a second access tracker; and

a processor configured to:

receive a first access count at the first access tracker;

remove a second access count of a page ID with a lowest access count in the first access tracker in response to the first access tracker being full;

erase a page associated with the lowest access count;

transmit the second access count of the page ID with the lowest access count to the second access tracker in response to the first access tracker being full; and

perform a hash function on the page ID with the lowest access count.

9. The apparatus of claim 8 , wherein the processor is configured to replace the second access count of the page ID with the lowest access count with the first access count in the first access tracker.

10. The apparatus of claim 8 , wherein the first access count is received at the first access tracker in response to receiving a request to access a page.

11. The apparatus of claim 10 , wherein the first access count is transmitted from the second access tracker.

12. The apparatus of claim 8 , wherein the processor is configured to increment the first access count.

13. The apparatus of claim 8 , wherein the processor is configured to enter the second access count of the page ID with the lowest access count into the second access tracker.

14. A system, comprising:

a host; and

a memory sub-system comprising a controller, wherein the controller is configured to receive commands from the host, and wherein the controller comprises:

a first access tracker;

a second access tracker; and

a processor configured to:

remove an access count of a page ID with a lowest access count in the first access tracker in response to the first access tracker being full;

erase a page associated with the lowest access count;

transmit the access count of the page ID with the lowest access count to the second access tracker in response to the first access tracker being full; and

perform a hash function on the page ID with the lowest access count.

15. The system of claim 14 , wherein the second access tracker is configured to receive the access count of the page ID with the lowest access count.

16. The system of claim 14 , wherein the processor is configured to store the access count of the page ID with the lowest access count in an array of counters.

17. The system of claim 14 , wherein the memory sub-system further comprises:

a first memory device configured to erase a page associated with the lowest access count; and

a second memory device configured to store the page associated with the lowest access count.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 6, 2024
From: DIRIK, CAGDAS; WALKER, ROBERT M.; COOPER-BALIS, ELLIOTT C.
To: MICRON TECHNOLOGY, INC.
Reel/Frame 066393/0664 →
Continuity (2)
Continuation 17412077 · Aug 25, 2021
Related Publication 20240176547A1 · May 30, 2024
References Cited (21)
US 7496711B2 · Bartley et al. · 2009 [cited by applicant]
US 9330736B2 · Michalak · 2016 [cited by applicant]
US 9940286B2 · Duluk et al. · 2018 [cited by applicant]
US 11237981B1 · Habusha · 2022 [cited by examiner]
US 11467960B1 · Dimond · 2022 [cited by examiner]
US 20080052488A1 · Fritz · 2008 [cited by examiner]
US 20080177951A1 · Bartley et al. · 2008 [cited by applicant]
US 20120023300A1 · Tremaine et al. · 2012 [cited by applicant]
US 20120272029A1 · Zhang · 2012 [cited by applicant]
US 20130326154A1 · Haswell · 2013 [cited by applicant]
US 20140281110A1 · Duluk, Jr. · 2014 [cited by examiner]
US 20160103765A1 · Rastogi · 2016 [cited by applicant]
US 20180046383A1 · Gates · 2018 [cited by examiner]
US 20180136838A1 · White · 2018 [cited by applicant]
US 20190095109A1 · Zhou · 2019 [cited by applicant]
US 20200192809A1 · Mappouras · 2020 [cited by applicant]
US 20210263862A1 · Gupta · 2021 [cited by examiner]
US 20210365371A1 · Dong · 2021 [cited by applicant]
US 20220214825A1 · Ganguly · 2022 [cited by applicant]
D. Park and D. H. C. Du, “Hot data identification for flash-based storage systems using multiple bloom filters,” 2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST), Denver, CO, USA, 2011, pp. 1-11,… [cited by examiner]
Mayank Goswami et al., Buffered Count-Min Sketch on SSD: Theory and Experiments, arXiv, European Symposium on Algorithms (ESA 2018), pp. 1-14 https://arxiv.org/abs/1804.10673 (Year: 2018). [cited by examiner]