IP Library Granted Patent US 12,216,927
Granted Patent B2
US 12,216,927 · App. 17/466,198 · Granted Feb 4, 2025

Storing data for machine learning and artificial intelligence applications in a decentralized storage network

Inventor: Michael Richardson (Kansas City, MO)
Assignee: PURE STORAGE, INC.
G06F3/0647H04L67/1095H04L67/1097G06F2201/84
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,216,927
App. No.
17/466,198
Granted
Feb 4, 2025
Kind
B2
Abstract

Storing data for machine learning and artificial intelligence applications in a decentralized storage network, including: identifying a plurality of decentralized storage networks that a storage system can utilize for storing data, each of the plurality of decentralized storage networks comprising a collection of network connected computers operating as cooperative participants without employing dedicated servers for the storage of data; selecting, based characteristics of each decentralized storage network, one or more decentralized storage networks for storing the data; and initiating storage of the data on the selected one of more decentralized storage networks.

Claims (43)

1. A method comprising:

selecting, based on configurations of one or more decentralized storage networks from a plurality of decentralized storage networks that are aligned with requirements associated with storing data, one or more decentralized storage networks for storing the data from the plurality of decentralized storage networks that are utilized for storing data, wherein the one or more decentralized storage networks of the plurality of decentralized storage networks comprise a collection of network connected computers operating as cooperative participants without employing dedicated servers for the storage of data;

initiating storage of the data on the selected one of more decentralized storage networks, and

sharing, with one or more other decentralized storage networks, information describing a storage system that accesses the data from the one or more decentralized storage networks, wherein the data is restored using the one or more other decentralized storage networks based on the shared information.

2. The method of claim 1 further comprising reducing, prior to initiating storage of the data on the selected one of more decentralized storage networks, a size of the data using one or more data reduction techniques.

3. The method of claim 1 wherein initiating storage of the data on the selected one of more decentralized storage networks further comprises including, in a blockchain, a contract describing a relationship agreement between the storage system and a particular decentralized storage network.

4. The method of claim 1 wherein initiating storage of the data on the selected one of more decentralized storage networks further comprises including, in a blockchain, the data.

5. The method of claim 1 further comprising:

receiving a request to take a snapshot of a dataset stored within the storage system;

creating the snapshot of the dataset stored within the storage system; and

wherein initiating storage of the data on the selected one of more decentralized storage networks further comprises initiating storage of the snapshot on the selected one of more decentralized storage networks.

6. The method of claim 1 further comprising mirroring, between the plurality of decentralized storage networks, the data.

7. The method of claim 1 further comprising:

detecting that a dataset stored within the storage system should be replicated to a second storage system;

receiving a request to modify the dataset;

modifying the dataset stored within the storage system; and

wherein initiating storage of the data on the selected one of more decentralized storage networks further comprises initiating storage of the modified dataset on the selected one of more decentralized storage networks.

8. The method of claim 1 wherein the data is utilized by an artificial intelligence application.

9. The method of claim 1 wherein the data is utilized by a machine learning application.

10. An apparatus comprising a computer processor and a computer memory operatively coupled to the computer processor, the computer memory having disposed within its computer program instructions that, when executed by the computer processor, cause the apparatus to:

select, based on configurations of one or more decentralized storage networks from a plurality of decentralized storage networks that are aligned with requirements associated with storing data, one or more decentralized storage networks for storing the data from the plurality of decentralized storage networks that are utilized for storing data, wherein the one or more decentralized storage networks of the plurality of decentralized storage networks comprise a collection of network connected computers operating as cooperative participants without employing dedicated servers for the storage of data;

initiate storage of the data on the selected one of more decentralized storage networks, and

share, with one or more other decentralized storage networks, information describing a storage system that accesses the data from the one or more decentralized storage networks, wherein the data is restored using the one or more other decentralized storage networks based on the shared information.

11. The apparatus of claim 10 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to reduce, prior to initiating storage of the data on the selected one of more decentralized storage networks, a size of the data using one or more data reduction techniques.

12. The apparatus of claim 10 wherein initiating storage of the data on the selected one of more decentralized storage networks further comprises including, in a blockchain, a contract describing a relationship agreement between the storage system and a particular decentralized storage network.

13. The apparatus of claim 10 wherein initiating storage of the data on the selected one of more decentralized storage networks further comprises including, in a blockchain, the data.

14. The apparatus of claim 10 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to:

receive a request to take a snapshot of a dataset stored within the storage system;

create the snapshot of the dataset stored within the storage system; and

wherein initiating storage of the data on the selected one of more decentralized storage networks further comprises initiating storage of the snapshot on the selected one of more decentralized storage networks.

15. The apparatus of claim 10 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to mirror, between the plurality of decentralized storage networks, the data.

16. The apparatus of claim 10 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to:

detect that a dataset stored within the storage system should be replicated to a second storage system;

receive a request to modify the dataset;

modify the dataset stored within the storage system; and

wherein initiating storage of the data on the selected one of more decentralized storage networks further comprises initiating storage of the modified dataset on the selected one of more decentralized storage networks.

17. A non-transitory computer readable storage medium storing instructions which, when executed, cause a processor to:

select, based on configurations of one or more decentralized storage networks from a plurality of decentralized storage networks that are aligned with requirements associated with storing data, one or more decentralized storage networks for storing the data from the plurality of decentralized storage networks that are utilized for storing data, wherein the one or more decentralized storage networks of the plurality of decentralized storage networks comprise a collection of network connected computers operating as cooperative participants without employing dedicated servers for the storage of data;

initiate storage of the data on the selected one of more decentralized storage networks, and

share, with one or more other decentralized storage networks, information describing a storage system that accesses the data from the one or more decentralized storage networks, wherein the data is restored using the one or more other decentralized storage networks based on the shared information.

18. The non-transitory computer readable storage medium of claim 17 , the processor further configured to reduce, prior to initiating storage of the data on the selected one of more decentralized storage networks, a size of the data using one or more data reduction techniques.

19. The non-transitory computer readable storage medium of claim 17 wherein to initiate storage of the data on the selected one of more decentralized storage networks, the processor further includes, in a blockchain, a contract describing a relationship agreement between the storage system and a particular decentralized storage network.

20. The non-transitory computer readable storage medium of claim 17 wherein to initiate storage of the data on the selected one of more decentralized storage networks, the processor further includes, in a blockchain, the data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 3, 2021
From: RICHARDSON, MICHAEL
To: PURE STORAGE, INC.
Reel/Frame 057381/0616 →
Continuity (3)
Continuation 16293055 · Mar 5, 2019
Continuation 15916599 · Mar 9, 2018
Related Publication 20210397359A1 · Dec 23, 2021
References Cited (211)
US 5706210A · Kumano et al. · 1998 [cited by applicant]
US 5799200A · Brant et al. · 1998 [cited by applicant]
US 5933598A · Scales et al. · 1999 [cited by applicant]
US 6012032A · Donovan et al. · 2000 [cited by applicant]
US 6085333A · DeKoning et al. · 2000 [cited by applicant]
US 6643641B1 · Snyder · 2003 [cited by applicant]
US 6647514B1 · Umberger et al. · 2003 [cited by applicant]
US 6789162B1 · Talagala et al. · 2004 [cited by applicant]
US 7089272B1 · Garthwaite et al. · 2006 [cited by applicant]
US 7107389B2 · Inagaki et al. · 2006 [cited by applicant]
US 7146521B1 · Nguyen · 2006 [cited by applicant]
US 7334124B2 · Pham et al. · 2008 [cited by applicant]
US 7437530B1 · Rajan · 2008 [cited by applicant]
US 7493424B1 · Bali et al. · 2009 [cited by applicant]
US 7631023B1 · Kaiser et al. · 2009 [cited by applicant]
US 7669029B1 · Mishra et al. · 2010 [cited by applicant]
US 7689609B2 · Lango et al. · 2010 [cited by applicant]
US 7743191B1 · Liao · 2010 [cited by applicant]
US 7899780B1 · Shmuylovich et al. · 2011 [cited by applicant]
US 8042163B1 · Karr et al. · 2011 [cited by applicant]
US 8086585B1 · Brashers et al. · 2011 [cited by applicant]
US 8200887B2 · Bennett · 2012 [cited by applicant]
US 8271700B1 · Annem et al. · 2012 [cited by applicant]
US 8387136B2 · Lee et al. · 2013 [cited by applicant]
US 8437189B1 · Montierth et al. · 2013 [cited by applicant]
US 8463867B2 · Robertson et al. · 2013 [cited by applicant]
US 8465332B2 · Hogan et al. · 2013 [cited by applicant]
US 8527544B1 · Colgrove et al. · 2013 [cited by applicant]
US 8566546B1 · Marshak et al. · 2013 [cited by applicant]
US 8578442B1 · Banerjee · 2013 [cited by applicant]
US 8613066B1 · Brezinski et al. · 2013 [cited by applicant]
US 8620970B2 · English et al. · 2013 [cited by applicant]
US 8751463B1 · Chamness · 2014 [cited by applicant]
US 8762642B2 · Bates et al. · 2014 [cited by applicant]
US 8769622B2 · Chang et al. · 2014 [cited by applicant]
US 8800009B1 · Beda et al. · 2014 [cited by applicant]
US 8812860B1 · Bray · 2014 [cited by applicant]
US 8850546B1 · Field et al. · 2014 [cited by applicant]
US 8898346B1 · Simmons · 2014 [cited by applicant]
US 8909854B2 · Yamagishi et al. · 2014 [cited by applicant]
US 8931041B1 · Banerjee · 2015 [cited by applicant]
US 8949863B1 · Coatney et al. · 2015 [cited by applicant]
US 8984602B1 · Bailey et al. · 2015 [cited by applicant]
US 8990905B1 · Bailey et al. · 2015 [cited by applicant]
US 9081713B1 · Bennett · 2015 [cited by applicant]
US 9124569B2 · Hussain et al. · 2015 [cited by applicant]
US 9134922B2 · Rajagopal et al. · 2015 [cited by applicant]
US 9189334B2 · Bennett · 2015 [cited by applicant]
US 9209973B2 · Aikas et al. · 2015 [cited by applicant]
US 9250823B1 · Kamat et al. · 2016 [cited by applicant]
US 9300660B1 · Borowiec et al. · 2016 [cited by applicant]
US 9311182B2 · Bennett · 2016 [cited by applicant]
US 9444822B1 · Borowiec et al. · 2016 [cited by applicant]
US 9507532B1 · Colgrove et al. · 2016 [cited by applicant]
US 9632870B2 · Bennett · 2017 [cited by applicant]
US 10296258B1 · Richardson · 2019 [cited by applicant]
US 20020013802A1 · Mori et al. · 2002 [cited by applicant]
US 20030145172A1 · Galbraith et al. · 2003 [cited by applicant]
US 20030191783A1 · Wolczko et al. · 2003 [cited by applicant]
US 20030225961A1 · Chow et al. · 2003 [cited by applicant]
US 20040080985A1 · Chang et al. · 2004 [cited by applicant]
US 20040111573A1 · Garthwaite · 2004 [cited by applicant]
US 20040153844A1 · Ghose et al. · 2004 [cited by applicant]
US 20040193814A1 · Erickson et al. · 2004 [cited by applicant]
US 20040260967A1 · Guha et al. · 2004 [cited by applicant]
US 20050160416A1 · Jamison et al. · 2005 [cited by applicant]
US 20050188246A1 · Emberty et al. · 2005 [cited by applicant]
US 20050216800A1 · Bicknell et al. · 2005 [cited by applicant]
US 20060015771A1 · Van Gundy et al. · 2006 [cited by applicant]
US 20060117046A1 · Robertson · 2006 [cited by examiner]
US 20060129817A1 · Borneman et al. · 2006 [cited by applicant]
US 20060161726A1 · Lasser · 2006 [cited by applicant]
US 20060230245A1 · Gounares et al. · 2006 [cited by applicant]
US 20060239075A1 · Williams et al. · 2006 [cited by applicant]
US 20070022227A1 · Miki · 2007 [cited by applicant]
US 20070028068A1 · Golding et al. · 2007 [cited by applicant]
US 20070055702A1 · Fridella et al. · 2007 [cited by applicant]
US 20070109856A1 · Pellicone et al. · 2007 [cited by applicant]
US 20070150689A1 · Pandit et al. · 2007 [cited by applicant]
US 20070168321A1 · Saito et al. · 2007 [cited by applicant]
US 20070220227A1 · Long · 2007 [cited by applicant]
US 20070294563A1 · Bose · 2007 [cited by applicant]
US 20070294564A1 · Reddin et al. · 2007 [cited by applicant]
US 20080005587A1 · Ahlquist · 2008 [cited by applicant]
US 20080077825A1 · Bello et al. · 2008 [cited by applicant]
US 20080162674A1 · Dahiya · 2008 [cited by applicant]
US 20080195833A1 · Park · 2008 [cited by applicant]
US 20080270678A1 · Cornwell et al. · 2008 [cited by applicant]
US 20080282045A1 · Biswas et al. · 2008 [cited by applicant]
US 20090077340A1 · Johnson et al. · 2009 [cited by applicant]
US 20090100115A1 · Park et al. · 2009 [cited by applicant]
US 20090198889A1 · Ito et al. · 2009 [cited by applicant]
US 20100052625A1 · Cagno et al. · 2010 [cited by applicant]
US 20100211723A1 · Mukaida · 2010 [cited by applicant]
US 20100246266A1 · Park et al. · 2010 [cited by applicant]
US 20100257142A1 · Murphy et al. · 2010 [cited by applicant]
US 20100262764A1 · Liu et al. · 2010 [cited by applicant]
US 20100325345A1 · Ohno et al. · 2010 [cited by applicant]
US 20100332754A1 · Lai et al. · 2010 [cited by applicant]
US 20110072290A1 · Davis et al. · 2011 [cited by applicant]
US 20110125955A1 · Chen · 2011 [cited by applicant]
US 20110131231A1 · Haas et al. · 2011 [cited by applicant]
US 20110167221A1 · Pangal et al. · 2011 [cited by applicant]
US 20120023144A1 · Rub · 2012 [cited by applicant]
US 20120054264A1 · Haugh et al. · 2012 [cited by applicant]
US 20120079318A1 · Colgrove et al. · 2012 [cited by applicant]
US 20120131253A1 · McKnight et al. · 2012 [cited by applicant]
US 20120221647A1 · Ciminiera · 2012 [cited by examiner]
US 20120303919A1 · Hu et al. · 2012 [cited by applicant]
US 20120311000A1 · Post et al. · 2012 [cited by applicant]
US 20130007845A1 · Chang et al. · 2013 [cited by applicant]
US 20130031414A1 · Dhuse et al. · 2013 [cited by applicant]
US 20130036272A1 · Nelson · 2013 [cited by applicant]
US 20130071087A1 · Motiwala et al. · 2013 [cited by applicant]
US 20130145447A1 · Maron · 2013 [cited by applicant]
US 20130191555A1 · Liu · 2013 [cited by applicant]
US 20130198459A1 · Joshi et al. · 2013 [cited by applicant]
US 20130205173A1 · Yoneda · 2013 [cited by applicant]
US 20130219164A1 · Hamid · 2013 [cited by applicant]
US 20130227201A1 · Talagala et al. · 2013 [cited by applicant]
US 20130290607A1 · Chang et al. · 2013 [cited by applicant]
US 20130311434A1 · Jones · 2013 [cited by applicant]
US 20130318297A1 · Jibbe et al. · 2013 [cited by applicant]
US 20130332614A1 · Brunk et al. · 2013 [cited by applicant]
US 20140020083A1 · Fetik · 2014 [cited by applicant]
US 20140074850A1 · Noel et al. · 2014 [cited by applicant]
US 20140082715A1 · Grajek et al. · 2014 [cited by applicant]
US 20140086146A1 · Kim et al. · 2014 [cited by applicant]
US 20140090009A1 · Li et al. · 2014 [cited by applicant]
US 20140096220A1 · Pinto et al. · 2014 [cited by applicant]
US 20140101434A1 · Senthurpandi et al. · 2014 [cited by applicant]
US 20140164774A1 · Nord et al. · 2014 [cited by applicant]
US 20140173232A1 · Reohr et al. · 2014 [cited by applicant]
US 20140195636A1 · Karve et al. · 2014 [cited by applicant]
US 20140201512A1 · Seethaler et al. · 2014 [cited by applicant]
US 20140201541A1 · Paul et al. · 2014 [cited by applicant]
US 20140208155A1 · Pan · 2014 [cited by applicant]
US 20140215590A1 · Brand · 2014 [cited by applicant]
US 20140229654A1 · Goss et al. · 2014 [cited by applicant]
US 20140230017A1 · Saib · 2014 [cited by applicant]
US 20140258229A1 · Verbitski · 2014 [cited by examiner]
US 20140258526A1 · Le Sant et al. · 2014 [cited by applicant]
US 20140282983A1 · Ju et al. · 2014 [cited by applicant]
US 20140285917A1 · Cudak et al. · 2014 [cited by applicant]
US 20140297742A1 · Lyren · 2014 [cited by examiner]
US 20140325262A1 · Cooper et al. · 2014 [cited by applicant]
US 20140351627A1 · Best et al. · 2014 [cited by applicant]
US 20140373104A1 · Gaddam et al. · 2014 [cited by applicant]
US 20140373126A1 · Hussain et al. · 2014 [cited by applicant]
US 20150026387A1 · Sheredy et al. · 2015 [cited by applicant]
US 20150074463A1 · Jacoby et al. · 2015 [cited by applicant]
US 20150089569A1 · Sondhi et al. · 2015 [cited by applicant]
US 20150095515A1 · Krithivas et al. · 2015 [cited by applicant]
US 20150113203A1 · Dancho et al. · 2015 [cited by applicant]
US 20150121137A1 · McKnight et al. · 2015 [cited by applicant]
US 20150134920A1 · Anderson et al. · 2015 [cited by applicant]
US 20150149822A1 · Coronado et al. · 2015 [cited by applicant]
US 20150193169A1 · Sundaram et al. · 2015 [cited by applicant]
US 20150378888A1 · Zhang et al. · 2015 [cited by applicant]
US 20160098323A1 · Mutha et al. · 2016 [cited by applicant]
US 20160127462A1 · Mu et al. · 2016 [cited by applicant]
US 20160350009A1 · Cerreta et al. · 2016 [cited by applicant]
US 20160352720A1 · Hu et al. · 2016 [cited by applicant]
US 20160352830A1 · Borowiec et al. · 2016 [cited by applicant]
US 20160352834A1 · Borowiec et al. · 2016 [cited by applicant]
US 20170206142A1 · Pawar · 2017 [cited by examiner]
US 20170264682A1 · Eagle · 2017 [cited by examiner]
US 20170330159A1 · Castinado · 2017 [cited by examiner]
US 20180081562A1 · Vasudevan · 2018 [cited by applicant]
US 20190278506A1 · Richardson · 2019 [cited by applicant]
EP 0725324A2 · 1996 [cited by applicant]
WO 2012087648A2 · 2012 [cited by applicant]
WO 2013071087A1 · 2013 [cited by applicant]
WO 2014110137A1 · 2014 [cited by applicant]
WO 2016015008A1 · 2016 [cited by applicant]
WO 2016190938A1 · 2016 [cited by applicant]
WO 2016195759A1 · 2016 [cited by applicant]
WO 2016195958A1 · 2016 [cited by applicant]
WO 2016195961A1 · 2016 [cited by applicant]
Bellamy-Mcintyre et al., “OpenID and the Enterprise: A Model-based Analysis of Single Sign-On Authentication”, 15th IEEE International Enterprise Distributed Object Computing Conference (EDOC), Aug. 29, 2011, pp. 129-13… [cited by applicant]
ETSI, “Network Function Virtualisation (NFV); Resiliency Requirements”, ETSI GS NFCV-REL 001, V1.1.1, Jan. 2015, 82 pages, etsi.org (online), URL: www.etsi.org/deliver/etsi_gs/NFV-REL/001_099/001/01.01.01_60/gs_NFV-REL0… [cited by applicant]
Faith, “dictzip file format”, GitHub.com (online), accessed Jul. 28, 2015, 1 page, URL: github.com/fidlej/idzip. [cited by applicant]
Google Search of “storage array define” performed by the Examiner on Nov. 4, 2015 for U.S. Appl. No. 14/725,278, Results limited to entries dated before 2012, 1 page. [cited by applicant]
Hota et al., “Capability-based Cryptographic Data Access Control in Cloud Computing”, International Journal of Advanced Networking and Applications, col. 1, Issue 1, Aug. 2011, 10 pages, Eswar Publications, India. [cited by applicant]
Hu et al., “Container Marking: Combining Data Placement, Garbage Collection and Wear Levelling for Flash”, 19th Annual IEEE International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunicatio… [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/015006, Apr. 29, 2016, 12 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/015008, May 4, 2016, 12 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/016333, Jun. 8, 2016, 12 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/020410, Jul. 8, 2016, 12 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/032052, Aug. 30, 2016, 17 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/032084, Jul. 18, 2016, 12 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/035492, Aug. 17, 2016, 10 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/036693, Aug. 29, 2016, 10 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/038758, Oct. 7, 2016, 10 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/040393, Sep. 22, 2016, 10 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/044020, Sep. 30, 2016, 11 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/044874, Oct. 7, 2016, 11 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/044875, Oct. 5, 2016, 13 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/044876, Oct. 21, 2016, 12 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2016/044877, Sep. 29, 2016, 13 pages. [cited by applicant]
Kong, “Using PCI Express As The Primary System Interconnect In Multiroot Compute, Storage, Communications And Embedded Systems”, White Paper, IDT.com (online), Aug. 28, 2008, 12 pages, URL: www.idt.com/document/whp/idt-… [cited by applicant]
Li et al., “Access Control for the Services Oriented Architecture”, Proceedings of the 2007 ACM Workshop on Secure Web Services (SWS '07), Nov. 2007, pp. 9-17, ACM New York, NY. [cited by applicant]
Microsoft, “Hybrid for SharePoint Server 2013—Security Reference Architecture”, Microsoft (online), Oct. 2014, 53 pages, URL: hybrid.office.com/img/Security_Reference_Architecture_pdf. [cited by applicant]
Microsoft, “Hybrid Identity Management”, Microsoft (online), Apr. 2014, 2 pages, URL: download.microsoft.com/download/E/A/E/EAE57CD1-A80B-423C-96BB-142FAAC630B9/Hybrid_Identity_Datasheet.pdf. [cited by applicant]
Microsoft, “Hybrid Identity”, Microsoft (online), Apr. 2014, 36 pages, URL: www.aka.ms/HybridIdentityWp. [cited by applicant]
PCMAG, “Storage Array Definition”, Published May 10, 2013, URL: http://web.archive.org/web/20130510121646/http://www.pcmag.com/encyclopedia/term/52091/storage-array, 2 pages. [cited by applicant]
Storer et al., “Secure Data Deduplication”, Proceedings of the 4th ACM International Workshop on Storage Security And Survivability (StorageSS'08), Oct. 2008, 10 pages, ACM New York, NY. USA, DOI: 10.1145/1456469.145647… [cited by applicant]
Sweere, “Creating Storage Class Persistent Memory with NVDIMM”, Published in Aug. 2013, Flash Memory Summit 2013, URL: http://ww.flashmemorysummit.com/English/Collaterals/Proceedings/2013/20130814_T2_Sweere.pdf, 22 page… [cited by applicant]
Techopedia, “What is a disk array”, techopedia.com (online), Jan. 13, 2012, 1 page, URL: web.archive.org/web/20120113053358/http://www.techopedia.com/definition/1009/disk-array. [cited by applicant]
Webopedia, “What is a disk array”, webopedia.com (online), May 26, 2011, 2 pages, URL: web/archive.org/web/20110526081214/http://www.webopedia.com/TERM/D/disk_array.html. [cited by applicant]
Wikipedia, “Convergent Encryption”, Wikipedia.org (online), accessed Sep. 8, 2015, 2 pages, URL: en.wikipedia.org/wiki/Convergent_encryption. [cited by applicant]
Cited By (1)
US 12,513,043