IP Library Granted Patent US 11,061,622
Granted Patent B2
US 11,061,622 · App. 16/122,524 · Granted Jul 13, 2021

Tiering data strategy for a distributed storage system

Inventors: Maor Ben Dayan (Tel Aviv, IL); Omri Palmon (Tel Aviv, IL); Liran Zvibel (Tel Aviv, IL); Kanael Arditti (Tel Aviv, IL)
G06F3/0662G06F3/0604G06F3/064G06F3/067G06F3/0649G06F3/0652
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 11,061,622
App. No.
16/122,524
Granted
Jul 13, 2021
Kind
B2
Abstract

A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. The storage devices may be assigned to one of a plurality of memory tiers, and the data in a storage device may be reassigned to another storage device in a different memory tier.

Claims (38)

1. A system comprising:

a plurality of storage devices, wherein:

each storage device of the plurality of storage devices is assigned to one of: an upper tier and a lower tier;

each storage device of the plurality of storage devices is operable to store one or more data blocks; and

each of the one or more data blocks is associated with a state, wherein the state comprises a plurality of deletion states;

a processor configured to read a current state associated with a particular data block in a first storage device of the plurality of storage devices, wherein, according to the current state, the processor is configured to perform one of:

a demotion of the particular data block to a second storage device in the lower tier; and

a deletion of the particular data block from a read cache; and

circuitry configured to count to a retention period, wherein:

if counting to the retention period is finished, the each of the data blocks not at a highest deletion state is incremented to a next higher deletion state, and

if a read access is made to one of the data blocks, the one of the data blocks is reset to a lowest deletion state.

2. The system of claim 1 , wherein the state comprises a plurality of demotion states.

3. The system of claim 2 , comprising circuitry configured to count a demotion period.

4. The system of claim 3 , wherein:

if counting of the demotion period is finished, the each of the data blocks not at a highest demotion state is incremented to a next higher demotion state, and

if a write access is made to the each of the data blocks, the each of the data blocks is reset to a lowest demotion state.

5. The system of claim 4 , wherein the each of the data blocks at the highest demotion state is demoted to the lower tier.

6. The system of claim 1 , wherein the each of the data blocks is a 4 kilobyte data block.

7. The system of claim 1 , wherein the each of the data blocks at the highest deletion state is deleted from the read cache.

8. A method comprising:

performing memory management for each of a plurality of storage devices assigned to one of: an upper tier and a lower tier, wherein:

the each of the plurality of storage device comprises data blocks; and

each of the data blocks has a corresponding state; and

reading, by a processor, the state of the each of the data blocks to, wherein the state comprises a plurality of deletion states;

performing, according to the state, one of:

demoting the each of the data blocks to the lower tier; and

deleting the each of the data blocks from a read cache; and

counting a retention period wherein:

if the count to the retention period is finished, the each of the data blocks not at a highest deletion state is incremented to a next higher deletion state, and

if a read access is made to one of the data blocks, the one of the data blocks is reset to a lowest deletion state.

9. The method of claim 8 , wherein the state comprises a plurality of demotion states.

10. The method of claim 9 , comprising counting a demotion period.

11. The method of claim 10 , wherein:

if counting the demotion period is finished, the each of the data blocks not at a highest demotion state is incremented to a next higher demotion state, and

if a write access is made to the each of the data blocks, the each of the data blocks of memory is reset to a lowest demotion state.

12. The method of claim 11 , wherein the each of the data blocks at the highest demotion state is demoted to the lower tier.

13. The method of claim 8 , wherein the each of the data blocks is a 4 kilobyte block.

14. The method of claim 8 , wherein the each of the data blocks at the highest deletion state is deleted from the read cache.

Assignments (3)
RELEASE OF SECURITY INTEREST Recorded Jun 20, 2024
From: BANK LEUMI LE-ISRAEL B.M.
To: WEKAIO LTD.
Reel/Frame 067783/0962 →
SECURITY INTEREST Recorded Mar 29, 2020
From: WEKAIO LTD.
To: BANK LEUMI LE-ISRAEL B.M.
Reel/Frame 052253/0860 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 18, 2018
From: DAYAN, MAOR BEN; PALMON, OMRI; ZVIBEL, LIRAN; ARDITTI, KANAEL
To: WEKA.IO LTD.
Reel/Frame 047101/0442 →
Continuity (2)
Provisional Application 62585204 · Nov 13, 2017
Related Publication 20190146718A1 · May 16, 2019
Cited By (1)
US 12,645,404