IP Library Granted Patent US 12,498,999
Granted Patent B2
US 12,498,999 · App. 18/629,116 · Granted Dec 16, 2025

Virtualization in a dispersed storage network utilizing local and remote memory

Inventors: Jason K. Resch (Warwick, RI); Vimalkumar P. Gajjar (Roselle, IL); S. Christopher Gladwin (Chicago, IL); Kumar Abhijeet (Chicago, IL)
Assignee: Pure Storage, Inc.
G06F11/0727G06F3/0619G06F3/064G06F3/0659G06F3/067G06F9/5027G06F11/0793G06F11/1076G06F11/108G06F11/1092G06F16/215G06F21/64G06T9/00H04L43/0852H04L47/70H04L67/10H04L67/1097H04L67/61H04L63/08H04L63/101
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,498,999
App. No.
18/629,116
Granted
Dec 16, 2025
Kind
B2
Abstract

A method for a storage network computing device includes receiving a request to store a data object and generating a plurality of write slice requests, where the plurality of write slice requests includes a set of encoded data slices to be stored in the storage network and at least a decode threshold number of encoded data slices of the set of encoded data slices is required to recover a corresponding portion of a data object. The method continues by identifying a set of storage devices (from a plurality) for storage of the set of encoded data slices, where the plurality of storage devices includes one or more first memory devices local to the computing device and one or more second memory devices that are remote from the computing device. The method then continues, by storing the set of encoded data slices in the identified set of storage devices, generating a set of write slice responses relating to the set of encoded data slices and outputting the set of write slice responses.

Claims (87)

1 . A method for execution by one or more processing modules of a computing device of a storage network, the method comprises:

receiving, from a requesting entity, a request to store a data object;

generating, by the computing device, a plurality of write slice requests, wherein the plurality of write slice requests includes a set of encoded data slices to be stored in the storage network, wherein at least a decode threshold number of encoded data slices of the set of encoded data slices is required to recover a corresponding portion of a data object;

identifying a set of storage devices of a plurality of storage devices for storage of the set of encoded data slices, wherein the plurality of storage devices includes one or more first memory devices and one or more second memory devices, wherein the first one or more first memory devices are local to the computing device and the second memory devices are remote from the computing device;

storing the set of encoded data slices in the identified set of storage devices;

generating, by the computing device, a set of write slice responses relating to the set of encoded data slices; and

outputting the set of write slice responses.

2 . The method of claim 1 , wherein identifying a set of storage devices of a plurality of storage devices for storage of the set of encoded data slices is based on at least one of:

a storage device current level of availability indicator relating to one or more storage devices of the plurality of storage devices;

an estimated storage device future level of availability indicator relating to one or more storage devices of the plurality of storage devices;

a storage device performance level indicator relating to one or more storage devices of the plurality of storage devices; or

an estimated access frequency level of the set of encoded data slices.

3 . The method of claim 1 , wherein storing the set of encoded data slices in the identified set of storage devices includes emulating storage of the set of encoded data slices in the set of storage units.

4 . The method of claim 3 , wherein emulating storage of the set of encoded data slices in the set of storage units includes generating the set of write slice responses to include emulated storage unit identifiers.

5 . The method of claim 1 , wherein each write slice response of the set of write slice responses includes a status indication relating to execution of a corresponding write slice request of the set of write slice requests.

6 . The method of claim 1 , wherein storing the set of encoded data slices in the identified set of storage devices includes:

storing at least a decode threshold number of encoded data slices in the first memory devices; and

storing less than the decode threshold number of encoded data slices in the second memory devices.

7 . The method of claim 1 , further comprising:

receiving, by the computing device, a set of read slice requests relating to the set of encoded data slices;

identifying a set of storage devices associated with storage of the set of encoded data slices;

retrieving a plurality of encoded data slices, of the set of encoded data slices, from the identified set of storage devices;

generating, by the computing device, a set of read slice responses including the plurality of encoded data slices; and

outputting the set of read slice responses.

8 . The method of claim 1 , wherein identifying a set of storage devices associated with storage of the set of encoded data slices includes at least one of performing a lookup, initiating a query of one or more memory devices and receiving a query response, or initiating a query of one or more temporary memory devices and receiving a query response.

9 . The method of claim 1 , further comprising:

detecting a slice error associated with at least one encoded data slice of the set of encoded data slices stored in the identified set of storage devices;

selecting a decode threshold number of encoded data slices of the set of encoded data slices, wherein the decode threshold number of encoded data slices does not include the at least one encoded data slice;

retrieving the decode threshold number of encoded data slices from a corresponding decode threshold number of storage devices of the identified set of storage devices;

decoding the decode threshold number of encoded data slices using a dispersed storage error encoding function to reproduce the corresponding data segment; and

encoding the reproduced data segment using the dispersed storage error encoding function to reproduce the at least one encoded data slice.

10 . The method of claim 1 , wherein the computing device comprises a storage unit.

11 . A storage unit for use in a storage network, the storage unit comprises:

a network interface;

at least one connection interface;

a memory comprising instructions; and

one or more processing modules in communication with the network interface, the at least one connection interface, and the memory, wherein the one or more processing modules execute the instructions to:

receive, via the network interface, a request to store a data object;

generate, a set of write slice requests including a set of encoded data slices to be stored in the storage network and further including a set of slice names corresponding to the set of encoded data slices, wherein at least a decode threshold number of encoded data slices of the set of encoded data slices is required to recover a corresponding data segment;

identify a set of storage devices of a plurality of storage devices for storage of the set of encoded data slices, wherein the plurality of storage devices includes one or more first memory devices and one or more second memory devices, wherein the first one or more first memory devices are local to the computing device and the second memory devices are remote from the computing device;

store the set of encoded data slices in the identified set of storage devices;

generate a set of write slice responses relating to the set of encoded data slices; and

output, via the network interface, the set of write slice responses for receipt by a requesting entity.

12 . The storage unit of claim 11 , wherein the set of storage devices is identified based on at least one of:

a storage device current level of availability indicator relating to one or more storage devices of the plurality of storage devices;

an estimated storage device future level of availability indicator relating to one or more storage devices of the plurality of storage devices;

a storage device performance level indicator relating to one or more storage devices of the plurality of storage devices; or

an estimated access frequency level of the set of encoded data slices.

13 . The storage unit of claim 11 , wherein the set of write slice responses include emulated storage unit identifiers.

14 . The storage unit of claim 11 , wherein each write slice response of the set of write slice responses includes a status indication relating to execution of a corresponding write slice request of the set of write slice requests.

15 . The storage unit of claim 11 , wherein the set of encoded data slices in the identified set of storage devices is stored by:

storing at least a decode threshold number of encoded data slices in the first memory devices; and

storing less than the decode threshold number of encoded data slices in the second memory devices.

16 . The storage unit of claim 11 , wherein the one or more processing modules further execute the instructions to:

receive, via the network interface, a set of read slice requests relating to the set of encoded data slices;

identify a set of storage devices associated with storage of the set of encoded data slices;

retrieve a plurality of encoded data slices, of the set of encoded data slices, from the identified set of storage devices;

generate a set of read slice responses including the plurality of encoded data slices; and

output, via the network interface, the set of read slice responses.

17 . The storage unit of claim 11 , wherein the one or more processing modules further execute the instructions to:

detect a slice error associated with at least one encoded data slice of the set of encoded data slices stored in the identified set of storage devices;

select a decode threshold number of encoded data slices of the set of encoded data slices, wherein the decode threshold number of encoded data slices does not include the at least one encoded data slice;

retrieve the decode threshold number of encoded data slices from a corresponding decode threshold number of storage devices of the identified set of storage devices;

decode the decode threshold number of encoded data slices using a dispersed storage error encoding function to reproduce the corresponding data segment;

encode the reproduced data segment using the dispersed storage error encoding function to reproduce the at least one encoded data slice; and

store the reproduced at least one encoded data slice in at least one storage device of the plurality of storage devices.

18 . A non-transitory computer readable storage medium comprises:

at least one memory section that stores operational instructions that, when executed by one or more processing modules of a storage unit of a dispersed storage network (DSN), causes the one or more processing modules to:

receive, via the network interface, a request to store a data object;

generate, a set of write slice requests including a set of encoded data slices to be stored in the storage network and further including a set of slice names corresponding to the set of encoded data slices, wherein at least a decode threshold number of encoded data slices of the set of encoded data slices is required to recover a corresponding data segment;

identify a set of storage devices of a plurality of storage devices for storage of the set of encoded data slices, wherein the plurality of storage devices includes one or more first memory devices and one or more second memory devices, wherein the first one or more first memory devices are local to the computing device and the second memory devices are remote from the computing device;

store the set of encoded data slices in the identified set of storage devices;

generate a set of write slice responses relating to the set of encoded data slices; and

output, via the network interface, the set of write slice responses for receipt by a requesting entity.

19 . The non-transitory computer readable storage medium of claim 18 , wherein the at least one memory section stores further operational instructions that, when executed by the one or more processing modules of the storage unit, causes the one or more processing modules to:

receive a set of read slice requests relating to the set of encoded data slices;

identify a set of storage devices associated with storage of the set of encoded data slices;

retrieve a plurality of encoded data slices, of the set of encoded data slices, from the identified set of storage devices;

generate a set of read slice responses including the plurality of encoded data slices; and

output the set of read slice responses.

20 . The non-transitory computer readable storage medium of claim 18 , wherein the at least one memory section stores further operational instructions that, when executed by the one or more processing modules of the storage unit, causes the one or more processing modules to:

detect a slice error associated with at least one encoded data slice of the set of encoded data slices stored in the identified set of storage devices;

select a decode threshold number of encoded data slices of the set of encoded data slices, wherein the decode threshold number of encoded data slices does not include the at least one encoded data slice;

retrieve the decode threshold number of encoded data slices from a corresponding decode threshold number of storage devices of the identified set of storage devices;

decode the decode threshold number of encoded data slices using a dispersed storage error encoding function to reproduce the corresponding data segment;

encode the reproduced data segment using the dispersed storage error encoding function to reproduce the at least one encoded data slice; and

store the reproduced at least one encoded data slice in at least one storage device of the plurality of storage devices.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 10, 2024
From: RESCH, JASON K.; GAJJAR, VIMALKUMAR P.; GLADWIN, S. CHRISTOPHER; ABHIJEET, KUMAR
To: PURE STORAGE, INC.
Reel/Frame 067057/0156 →
Continuity (10)
Continuation 18048604 · Oct 21, 2022
Continuation 17408872 · Aug 23, 2021
Continuation 17078345 · Oct 23, 2020
Continuation 16693742 · Nov 25, 2019
Continuation 16143854 · Sep 27, 2018
Continuation 15719259 · Sep 28, 2017
Continuation In Part 15427934 · Feb 8, 2017
Continuation 13959006 · Aug 5, 2013
Provisional Application 61711106 · Oct 8, 2012
Related Publication 20240256384A1 · Aug 1, 2024
References Cited (112)
US 4092732A · Ouchi · 1978 [cited by applicant]
US 5454101A · Mackay · 1995 [cited by applicant]
US 5485474A · Rabin · 1996 [cited by applicant]
US 5774643A · Lubbers · 1998 [cited by applicant]
US 5802364A · Senator · 1998 [cited by applicant]
US 5809285A · Hilland · 1998 [cited by applicant]
US 5890156A · Rekieta · 1999 [cited by applicant]
US 5987622A · Lo Verso · 1999 [cited by applicant]
US 5991414A · Garay · 1999 [cited by applicant]
US 6012159A · Fischer · 2000 [cited by applicant]
US 6058454A · Gerlach · 2000 [cited by applicant]
US 6128277A · Bruck · 2000 [cited by applicant]
US 6175571B1 · Haddock · 2001 [cited by applicant]
US 6192472B1 · Garay · 2001 [cited by applicant]
US 6256688B1 · Suetaka · 2001 [cited by applicant]
US 6272658B1 · Steele · 2001 [cited by applicant]
US 6301604B1 · Nojima · 2001 [cited by applicant]
US 6356949B1 · Katsandres · 2002 [cited by applicant]
US 6366995B1 · Vilkov · 2002 [cited by applicant]
US 6374336B1 · Peters · 2002 [cited by applicant]
US 6415373B1 · Peters · 2002 [cited by applicant]
US 6418539B1 · Walker · 2002 [cited by applicant]
US 6449688B1 · Peters · 2002 [cited by applicant]
US 6567948B2 · Steele · 2003 [cited by applicant]
US 6571282B1 · Bowman-Amuah · 2003 [cited by applicant]
US 6609223B1 · Wolfgang · 2003 [cited by applicant]
US 6718361B1 · Basani · 2004 [cited by applicant]
US 6760808B2 · Peters · 2004 [cited by applicant]
US 6785768B2 · Peters · 2004 [cited by applicant]
US 6785783B2 · Buckland · 2004 [cited by applicant]
US 6826711B2 · Moulton · 2004 [cited by applicant]
US 6879596B1 · Dooply · 2005 [cited by applicant]
US 7003688B1 · Pittelkow · 2006 [cited by applicant]
US 7024451B2 · Jorgenson · 2006 [cited by applicant]
US 7024609B2 · Wolfgang · 2006 [cited by applicant]
US 7080101B1 · Watson · 2006 [cited by applicant]
US 7103824B2 · Halford · 2006 [cited by applicant]
US 7103915B2 · Redlich · 2006 [cited by applicant]
US 7111115B2 · Peters · 2006 [cited by applicant]
US 7140044B2 · Redlich · 2006 [cited by applicant]
US 7146644B2 · Redlich · 2006 [cited by applicant]
US 7171493B2 · Shu · 2007 [cited by applicant]
US 7222133B1 · Raipurkar · 2007 [cited by applicant]
US 7240236B2 · Cutts · 2007 [cited by applicant]
US 7272613B2 · Sim · 2007 [cited by applicant]
US 7636724B2 · De La Torre · 2009 [cited by applicant]
US 20020062422A1 · Butterworth · 2002 [cited by applicant]
US 20020166079A1 · Ulrich · 2002 [cited by applicant]
US 20030018927A1 · Gadir · 2003 [cited by applicant]
US 20030037261A1 · Meffert · 2003 [cited by applicant]
US 20030065617A1 · Watkins · 2003 [cited by applicant]
US 20030084020A1 · Shu · 2003 [cited by applicant]
US 20040024963A1 · Talagala · 2004 [cited by applicant]
US 20040122917A1 · Menon · 2004 [cited by applicant]
US 20040215998A1 · Buxton · 2004 [cited by applicant]
US 20040228493A1 · Ma · 2004 [cited by applicant]
US 20050088976A1 · Chafle · 2005 [cited by applicant]
US 20050100022A1 · Ramprashad · 2005 [cited by applicant]
US 20050114594A1 · Corbett · 2005 [cited by applicant]
US 20050125593A1 · Karpoff · 2005 [cited by applicant]
US 20050131993A1 · Fatula, Jr. · 2005 [cited by applicant]
US 20050132070A1 · Redlich · 2005 [cited by applicant]
US 20050144382A1 · Schmisseur · 2005 [cited by applicant]
US 20050229069A1 · Hassner · 2005 [cited by applicant]
US 20060047907A1 · Shiga · 2006 [cited by applicant]
US 20060136448A1 · Cialini · 2006 [cited by applicant]
US 20060156059A1 · Kitamura · 2006 [cited by applicant]
US 20060224603A1 · Correll · 2006 [cited by applicant]
US 20070079081A1 · Gladwin · 2007 [cited by applicant]
US 20070079082A1 · Gladwin · 2007 [cited by applicant]
US 20070079083A1 · Gladwin · 2007 [cited by applicant]
US 20070088970A1 · Buxton · 2007 [cited by applicant]
US 20070174192A1 · Gladwin · 2007 [cited by applicant]
US 20070214285A1 · Au · 2007 [cited by applicant]
US 20070234110A1 · Soran · 2007 [cited by applicant]
US 20070283167A1 · Venters, III · 2007 [cited by applicant]
US 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20100268966A1 · Leggette et al. · 2010 [cited by applicant]
US 20100287200A1 · Dhuse · 2010 [cited by applicant]
US 20110072210A1 · Dhuse · 2011 [cited by applicant]
US 20110072321A1 · Dhuse · 2011 [cited by examiner]
US 20110078774A1 · Grube · 2011 [cited by applicant]
US 20110106904A1 · Resch · 2011 [cited by applicant]
US 20110126295A1 · Resch · 2011 [cited by applicant]
US 20110214011A1 · Grube · 2011 [cited by applicant]
US 20110265143A1 · Grube et al. · 2011 [cited by applicant]
US 20110314346A1 · Vas · 2011 [cited by applicant]
US 20120054581A1 · Grube · 2012 [cited by applicant]
US 20120226933A1 · Baptist · 2012 [cited by examiner]
US 20120290878A1 · Gladwin · 2012 [cited by examiner]
US 20130179894A1 · Calder · 2013 [cited by applicant]
US 20130272394A1 · Brockmann · 2013 [cited by examiner]
Chung; An Automatic Data Segmentation Method for 3D Measured Data Points; National Taiwan University; pp. 1-8; 1998. [cited by applicant]
Harrison; Lightweight Directory Access Protocol (LDAP): Authentication Methods and Security Mechanisms; IETF Network Working Group; RFC 4513; Jun. 2006; pp. 1-32. [cited by applicant]
Kubiatowicz, et al.; OceanStore: An Architecture for Global-Scale Persistent Storage; Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 20… [cited by applicant]
Legg; Lightweight Directory Access Protocol (LDAP): Syntaxes and Matching Rules; IETF Network Working Group; RFC 4517; Jun. 2006; pp. 1-50. [cited by applicant]
Plank, T1: Erasure Codes for Storage Applications; FAST2005, 4th Usenix Conference on File Storage Technologies; Dec. 13-16, 2005; pp. 1-74. [cited by applicant]
Rabin; Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance; Journal of the Association for Computer Machinery; vol. 36, No. 2; Apr. 1989; pp. 335-348. [cited by applicant]
Satran, et al.; Internet Small Computer Systems Interface (iSCSI); IETF Network Working Group; RFC 3720; Apr. 2004; pp. 1-257. [cited by applicant]
Sciberras; Lightweight Directory Access Protocol (LDAP): Schema for User Applications; IETF Network Working Group; RFC 4519; Jun. 2006; pp. 1-33. [cited by applicant]
Sermersheim; Lightweight Directory Access Protocol (LDAP): The Protocol; IETF Network Working Group; RFC 4511; Jun. 2006; pp. 1-68. [cited by applicant]
Shamir; How to Share a Secret; Communications of the ACM; vol. 22, No. 11; Nov. 1979; pp. 612-613. [cited by applicant]
Smith; Lightweight Directory Access Protocol (LDAP): Uniform Resource Locator; IETF Network Working Group; RFC 4516; Jun. 2006; pp. 1-15. [cited by applicant]
Smith; Lightweight Directory Access Protocol (LDAP): String Representation of Search Filters; IETF Network Working Group; RFC 4515; Jun. 2006; pp. 1-12. [cited by applicant]
Wildi; Java iSCSi Initiator; Master Thesis; Department of Computer and Information Science, University of Konstanz; Feb. 2007; 60 pgs. [cited by applicant]
Xin, et al.; Evaluation of Distributed Recovery in Large-Scale Storage Systems; 13th IEEE International Symposium on High Performance Distributed Computing; Jun. 2004; pp. 172-181. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Directory Information Models; IETF Network Working Group; RFC 4512; Jun. 2006; pp. 1-49. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Internationalized String Preparation; IETF Network Working Group; RFC 4518; Jun. 2006; pp. 1-14. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): String Representation of Distinguished Names; IETF Network Working Group; RFC 4514; Jun. 2006; pp. 1-15. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Technical Specification Road Map; IETF Network Working Group; RFC 4510; Jun. 2006; pp. 1-8. [cited by applicant]