US20220179745A9 - Generating Integrity Information in a Vast Storage System - Google Patents

Generating Integrity Information in a Vast Storage System Download PDF

Info

Publication number
US20220179745A9
US20220179745A9 US17/362,251 US202117362251A US2022179745A9 US 20220179745 A9 US20220179745 A9 US 20220179745A9 US 202117362251 A US202117362251 A US 202117362251A US 2022179745 A9 US2022179745 A9 US 2022179745A9
Authority
US
United States
Prior art keywords
data
identifiers
data slices
integrity information
storage
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
US17/362,251
Other versions
US11340988B2 (en
US20210326205A1 (en
Inventor
Gary W. Grube
Timothy W. Markison
Sebastien Vas
Zachary J. Mark
Jason K. Resch
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Pure Storage Inc
Original Assignee
Pure Storage Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US11/241,555 external-priority patent/US7953937B2/en
Priority claimed from US11/404,071 external-priority patent/US7574579B2/en
Priority claimed from US11/403,684 external-priority patent/US7574570B2/en
Priority claimed from US11/403,391 external-priority patent/US7546427B2/en
Priority claimed from US11/973,542 external-priority patent/US9996413B2/en
Priority claimed from US11/973,622 external-priority patent/US8171101B2/en
Priority claimed from US11/973,621 external-priority patent/US7904475B2/en
Priority claimed from US11/973,613 external-priority patent/US8285878B2/en
Priority claimed from US12/080,042 external-priority patent/US8880799B2/en
Priority claimed from US12/218,200 external-priority patent/US8209363B2/en
Priority claimed from US12/218,594 external-priority patent/US7962641B1/en
Priority claimed from US12/749,592 external-priority patent/US8938591B2/en
Priority claimed from US13/021,552 external-priority patent/US9063881B2/en
Priority claimed from US13/154,725 external-priority patent/US10289688B2/en
Priority claimed from US14/454,013 external-priority patent/US10154034B2/en
Priority claimed from US16/137,681 external-priority patent/US10866754B2/en
Priority claimed from US17/023,971 external-priority patent/US11080138B1/en
Application filed by Pure Storage Inc filed Critical Pure Storage Inc
Priority to US17/362,251 priority Critical patent/US11340988B2/en
Assigned to PURE STORAGE, INC. reassignment PURE STORAGE, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: GRUBE, GARY W., MARKISON, TIMOTHY W.
Publication of US20210326205A1 publication Critical patent/US20210326205A1/en
Assigned to PURE STORAGE, INC. reassignment PURE STORAGE, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: MARK, ZACHARY J., RESCH, JASON K., VAS, SEBASTIEN
Priority to US17/743,717 priority patent/US11544146B2/en
Application granted granted Critical
Publication of US11340988B2 publication Critical patent/US11340988B2/en
Publication of US20220179745A9 publication Critical patent/US20220179745A9/en
Priority to US18/059,833 priority patent/US11755413B2/en
Priority to US18/363,179 priority patent/US20230376380A1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1076Parity data used in redundant arrays of independent storages, e.g. in RAID systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614Improving the reliability of storage systems
    • G06F3/0619Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1004Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's to protect a block of data words, e.g. CRC or checksum
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/065Replication mechanisms
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0653Monitoring storage devices or systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0683Plurality of storage devices
    • G06F3/0689Disk arrays, e.g. RAID, JBOD
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit

Definitions

  • This invention relates generally to computer networks and more particularly to dispersing error encoded data.
  • Computing devices are known to communicate data, process data, and/or store data. Such computing devices range from wireless smart phones, laptops, tablets, personal computers (PC), work stations, and video game devices, to data centers that support millions of web searches, stock trades, or on-line purchases every day.
  • a computing device includes a central processing unit (CPU), a memory system, user input/output interfaces, peripheral device interfaces, and an interconnecting bus structure.
  • a computer may effectively extend its CPU by using “cloud computing” to perform one or more computing functions (e.g., a service, an application, an algorithm, an arithmetic logic function, etc.) on behalf of the computer.
  • cloud computing may be performed by multiple cloud computing resources in a distributed manner to improve the response time for completion of the service, application, and/or function.
  • Hadoop is an open source software framework that supports distributed applications enabling application execution by thousands of computers.
  • a computer may use “cloud storage” as part of its memory system.
  • cloud storage enables a user, via its computer, to store files, applications, etc. on an Internet storage system.
  • the Internet storage system may include a RAID (redundant array of independent disks) system and/or a dispersed storage system that uses an error correction scheme to encode data for storage.
  • FIG. 1 is a schematic block diagram of an embodiment of a dispersed or distributed storage network (DSN) in accordance with the present invention
  • FIG. 2 is a schematic block diagram of an embodiment of a computing core in accordance with the present invention.
  • FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data in accordance with the present invention.
  • FIG. 4 is a schematic block diagram of a generic example of an error encoding function in accordance with the present invention.
  • FIG. 5 is a schematic block diagram of a specific example of an error encoding function in accordance with the present invention.
  • FIG. 6 is a schematic block diagram of an example of a slice name of an encoded data slice (EDS) in accordance with the present invention.
  • FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of data in accordance with the present invention.
  • FIG. 8 is a schematic block diagram of a generic example of an error decoding function in accordance with the present invention.
  • FIG. 9 is a schematic block diagram of another embodiment of a computing system in accordance with the present invention.
  • FIG. 10 is a flowchart illustrating an example of archiving data in accordance with the present invention.
  • FIG. 1 is a schematic block diagram of an embodiment of a dispersed, or distributed, storage network (DSN) 10 that includes a plurality of computing devices 12 - 16 , a managing unit 18 , an integrity processing unit 20 , and a DSN memory 22 .
  • the components of the DSN 10 are coupled to a network 24 , which may include one or more wireless and/or wire lined communication systems; one or more non-public intranet systems and/or public internet systems; and/or one or more local area networks (LAN) and/or wide area networks (WAN).
  • LAN local area network
  • WAN wide area network
  • the DSN memory 22 includes a plurality of storage units 36 that may be located at geographically different sites (e.g., one in Chicago, one in Milwaukee, etc.), at a common site, or a combination thereof. For example, if the DSN memory 22 includes eight storage units 36 , each storage unit is located at a different site. As another example, if the DSN memory 22 includes eight storage units 36 , all eight storage units are located at the same site. As yet another example, if the DSN memory 22 includes eight storage units 36 , a first pair of storage units are at a first common site, a second pair of storage units are at a second common site, a third pair of storage units are at a third common site, and a fourth pair of storage units are at a fourth common site.
  • geographically different sites e.g., one in Chicago, one in Milwaukee, etc.
  • each storage unit is located at a different site.
  • all eight storage units are located at the same site.
  • a first pair of storage units are at a first common site
  • a DSN memory 22 may include more or less than eight storage units 36 . Further note that each storage unit 36 includes a computing core (as shown in FIG. 2 , or components thereof) and a plurality of memory devices for storing dispersed error encoded data.
  • Each of the computing devices 12 - 16 , the managing unit 18 , and the integrity processing unit 20 include a computing core 26 , which includes network interfaces 30 - 33 .
  • Computing devices 12 - 16 may each be a portable computing device and/or a fixed computing device.
  • a portable computing device may be a social networking device, a gaming device, a cell phone, a smart phone, a digital assistant, a digital music player, a digital video player, a laptop computer, a handheld computer, a tablet, a video game controller, and/or any other portable device that includes a computing core.
  • a fixed computing device may be a computer (PC), a computer server, a cable set-top box, a satellite receiver, a television set, a printer, a fax machine, home entertainment equipment, a video game console, and/or any type of home or office computing equipment.
  • each of the managing unit 18 and the integrity processing unit 20 may be separate computing devices, may be a common computing device, and/or may be integrated into one or more of the computing devices 12 - 16 and/or into one or more of the storage units 36 .
  • Each interface 30 , 32 , and 33 includes software and hardware to support one or more communication links via the network 24 indirectly and/or directly.
  • interface 30 supports a communication link (e.g., wired, wireless, direct, via a LAN, via the network 24 , etc.) between computing devices 14 and 16 .
  • interface 32 supports communication links (e.g., a wired connection, a wireless connection, a LAN connection, and/or any other type of connection to/from the network 24 ) between computing devices 12 and 16 and the DSN memory 22 .
  • interface 33 supports a communication link for each of the managing unit 18 and the integrity processing unit 20 to the network 24 .
  • Computing devices 12 and 16 include a dispersed storage (DS) client module 34 , which enables the computing device to dispersed storage error encode and decode data (e.g., data 40 ) as subsequently described with reference to one or more of FIGS. 3-8 .
  • computing device 16 functions as a dispersed storage processing agent for computing device 14 .
  • computing device 16 dispersed storage error encodes and decodes data on behalf of computing device 14 .
  • the DSN 10 is tolerant of a significant number of storage unit failures (the number of failures is based on parameters of the dispersed storage error encoding function) without loss of data and without the need for a redundant or backup copies of the data. Further, the DSN 10 stores data for an indefinite period of time without data loss and in a secure manner (e.g., the system is very resistant to unauthorized attempts at accessing the data).
  • the managing unit 18 performs DS management services. For example, the managing unit 18 establishes distributed data storage parameters (e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.) for computing devices 12 - 14 individually or as part of a group of user devices. As a specific example, the managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within the DSN memory 22 for a user device, a group of devices, or for public access and establishes per vault dispersed storage (DS) error encoding parameters for a vault.
  • distributed data storage parameters e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.
  • the managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within the DSN memory 22 for a user device, a group of devices, or for public access and establishes
  • the managing unit 18 facilitates storage of DS error encoding parameters for each vault by updating registry information of the DSN 10 , where the registry information may be stored in the DSN memory 22 , a computing device 12 - 16 , the managing unit 18 , and/or the integrity processing unit 20 .
  • the managing unit 18 creates and stores user profile information (e.g., an access control list (ACL)) in local memory and/or within memory of the DSN memory 22 .
  • the user profile information includes authentication information, permissions, and/or the security parameters.
  • the security parameters may include encryption/decryption scheme, one or more encryption keys, key generation scheme, and/or data encoding/decoding scheme.
  • the managing unit 18 creates billing information for a particular user, a user group, a vault access, public vault access, etc. For instance, the managing unit 18 tracks the number of times a user accesses a non-public vault and/or public vaults, which can be used to generate a per-access billing information. In another instance, the managing unit 18 tracks the amount of data stored and/or retrieved by a user device and/or a user group, which can be used to generate a per-data-amount billing information.
  • the managing unit 18 performs network operations, network administration, and/or network maintenance.
  • Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, storage units, and/or computing devices with a DS client module 34 ) to/from the DSN 10 , and/or establishing authentication credentials for the storage units 36 .
  • Network administration includes monitoring devices and/or units for failures, maintaining vault information, determining device and/or unit activation status, determining device and/or unit loading, and/or determining any other system level operation that affects the performance level of the DSN 10 .
  • Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of the DSN 10 .
  • the integrity processing unit 20 performs rebuilding of ‘bad’ or missing encoded data slices.
  • the integrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from the DSN memory 22 .
  • retrieved encoded slices they are checked for errors due to data corruption, outdated version, etc. If a slice includes an error, it is flagged as a ‘bad’ slice.
  • encoded data slices that were not received and/or not listed they are flagged as missing slices.
  • Bad and/or missing slices are subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices to produce rebuilt slices.
  • the rebuilt slices are stored in the DSN memory 22 .
  • FIG. 2 is a schematic block diagram of an embodiment of a computing core 26 that includes a processing module 50 , a memory controller 52 , main memory 54 , a video graphics processing unit 55 , an input/output (IO) controller 56 , a peripheral component interconnect (PCI) interface 58 , an IO interface module 60 , at least one IO device interface module 62 , a read only memory (ROM) basic input output system (BIOS) 64 , and one or more memory interface modules.
  • IO input/output
  • PCI peripheral component interconnect
  • IO interface module 60 at least one IO device interface module 62
  • ROM read only memory
  • BIOS basic input output system
  • the one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66 , a host bus adapter (HBA) interface module 68 , a network interface module 70 , a flash interface module 72 , a hard drive interface module 74 , and a DSN interface module 76 .
  • USB universal serial bus
  • HBA host bus adapter
  • the DSN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.).
  • OS operating system
  • the DSN interface module 76 and/or the network interface module 70 may function as one or more of the interface 30 - 33 of FIG. 1 .
  • the IO device interface module 62 and/or the memory interface modules 66 - 76 may be collectively or individually referred to as IO ports.
  • FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data.
  • a computing device 12 or 16 When a computing device 12 or 16 has data to store it disperse storage error encodes the data in accordance with a dispersed storage error encoding process based on dispersed storage error encoding parameters.
  • the dispersed storage error encoding parameters include an encoding function (e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.), a data segmenting protocol (e.g., data segment size, fixed, variable, etc.), and per data segment encoding values.
  • an encoding function e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.
  • a data segmenting protocol e.g., data segment size
  • the per data segment encoding values include a total, or pillar width, number (T) of encoded data slices per encoding of a data segment (i.e., in a set of encoded data slices); a decode threshold number (D) of encoded data slices of a set of encoded data slices that are needed to recover the data segment; a read threshold number (R) of encoded data slices to indicate a number of encoded data slices per set to be read from storage for decoding of the data segment; and/or a write threshold number (W) to indicate a number of encoded data slices per set that must be accurately stored before the encoded data segment is deemed to have been properly stored.
  • T total, or pillar width, number
  • D decode threshold number
  • R read threshold number
  • W write threshold number
  • the dispersed storage error encoding parameters may further include slicing information (e.g., the number of encoded data slices that will be created for each data segment) and/or slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).
  • slicing information e.g., the number of encoded data slices that will be created for each data segment
  • slice security information e.g., per encoded data slice encryption, compression, integrity checksum, etc.
  • the encoding function has been selected as Cauchy Reed-Solomon (a generic example is shown in FIG. 4 and a specific example is shown in FIG. 5 );
  • the data segmenting protocol is to divide the data object into fixed sized data segments; and the per data segment encoding values include: a pillar width of 5, a decode threshold of 3, a read threshold of 4, and a write threshold of 4.
  • the computing device 12 or 16 divides the data (e.g., a file (e.g., text, video, audio, etc.), a data object, or other data arrangement) into a plurality of fixed sized data segments (e.g., 1 through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more).
  • the number of data segments created is dependent of the size of the data and the data segmenting protocol.
  • FIG. 4 illustrates a generic Cauchy Reed-Solomon encoding function, which includes an encoding matrix (EM), a data matrix (DM), and a coded matrix (CM).
  • the size of the encoding matrix (EM) is dependent on the pillar width number (T) and the decode threshold number (D) of selected per data segment encoding values.
  • EM encoding matrix
  • T pillar width number
  • D decode threshold number
  • Z is a function of the number of data blocks created from the data segment and the decode threshold number (D).
  • the coded matrix is produced by matrix multiplying the data matrix by the encoding matrix.
  • FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encoding with a pillar number (T) of five and decode threshold number of three.
  • a first data segment is divided into twelve data blocks (D 1 -D 12 ).
  • the coded matrix includes five rows of coded data blocks, where the first row of X 11 -X 14 corresponds to a first encoded data slice (EDS 1 _ 1 ), the second row of X 21 -X 24 corresponds to a second encoded data slice (EDS 2 _ 1 ), the third row of X 31 -X 34 corresponds to a third encoded data slice (EDS 3 _ 1 ), the fourth row of X 41 -X 44 corresponds to a fourth encoded data slice (EDS 4 _ 1 ), and the fifth row of X 51 -X 54 corresponds to a fifth encoded data slice (EDS 5 _ 1 ).
  • the second number of the EDS designation corresponds to the data segment number.
  • the computing device also creates a slice name (SN) for each encoded data slice (EDS) in the set of encoded data slices.
  • a typical format for a slice name 80 is shown in FIG. 6 .
  • the slice name (SN) 80 includes a pillar number of the encoded data slice (e.g., one of 1-T), a data segment number (e.g., one of 1-Y), a vault identifier (ID), a data object identifier (ID), and may further include revision level information of the encoded data slices.
  • the slice name functions as, at least part of, a DSN address for the encoded data slice for storage and retrieval from the DSN memory 22 .
  • the computing device 12 or 16 produces a plurality of sets of encoded data slices, which are provided with their respective slice names to the storage units for storage.
  • the first set of encoded data slices includes EDS 1 _ 1 through EDS 5 _ 1 and the first set of slice names includes SN 1 _ 1 through SN 5 _ 1 and the last set of encoded data slices includes EDS 1 _Y through EDS 5 _Y and the last set of slice names includes SN 1 _Y through SN 5 _Y.
  • FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of a data object that was dispersed storage error encoded and stored in the example of FIG. 4 .
  • the computing device 12 or 16 retrieves from the storage units at least the decode threshold number of encoded data slices per data segment. As a specific example, the computing device retrieves a read threshold number of encoded data slices.
  • the computing device uses a decoding function as shown in FIG. 8 .
  • the decoding function is essentially an inverse of the encoding function of FIG. 4 .
  • the coded matrix includes a decode threshold number of rows (e.g., three in this example) and the decoding matrix in an inversion of the encoding matrix that includes the corresponding rows of the coded matrix. For example, if the coded matrix includes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2, and 4, and then inverted to produce the decoding matrix.
  • FIGS. 9 and 10 illustrate particular embodiments in which content data stored in a user device, or data transmitted between a user device and an external device, can be automatically and conditionally archived using a distributed storage network (DSN).
  • a DS processing agent inside of a device e.g., a smart phone, a land based phone, a laptop, desktop, the cable box, a home security system, a home automation system, etc.
  • banking info home video, pictures, e-mail, SMS, class notes, website visits, contacts, connections, grades, medical records, social networking messaging, and/or password lists.
  • the DS processing agent correlates the data to preferences to determine how much content to save, and how often to store new content.
  • the agent also determines operational parameters associated with the DSN based on one or more of the data type, age, priority, status, etc.
  • the DS processing utilizes two different DS units to store different types of critical information, or to store particular types of critical information in pillars associated with two different DS units.
  • FIG. 9 is a schematic block diagram of another embodiment of a computing system that includes a user device domain 272 , a dispersed storage (DS) processing unit 96 , such as computing device 16 , and a dispersed storage network (DSN) memory 22 .
  • the user device domain 272 includes user devices 201 - 203 . Note that the user device domain 272 may include any number of user devices.
  • the DS processing unit 96 includes a DS processing module 94 and the DSN memory 22 includes a plurality of 1 st -N th DS units.
  • Such user devices 201 - 203 of the user device domain 272 are associated with a common user such that data, information, and/or messages traversed by the user devices 201 - 203 share relationship with the common user.
  • the DS processing unit 96 provides user device 201 access to the DSN memory 22 when the user device 201 does not include a DS processing module 94 , such as DS client module 34 .
  • the user devices 201 - 203 may include fixed or portable devices as discussed previously (e.g., a smart phone, a wired phone, a laptop computer, a tablet computer, a desktop computer, a cable set-top box, a smart appliance, a home security system, a home automation system, etc.).
  • the user devices 201 - 203 may include a computing core, one or more interfaces, the DS processing module 94 and/or a collection module 274 .
  • user device 201 includes the collection module 274 .
  • User device 202 includes the collection module 274 and the DS processing module 94 .
  • User device 3 includes the DS processing module 94 which includes the collection module 274 .
  • the collection module 274 includes a functional entity (e.g., a software application that runs on a computing core or as part of a processing module) that intercepts user data, processes the user data to produce a data representation, and/or facilitates storage of the data representation in the DSN memory in accordance with one or more of metadata, preferences, and/or operational parameters (e.g., dispersed storage error coding parameters).
  • a functional entity e.g., a software application that runs on a computing core or as part of a processing module
  • processes the user data to produce a data representation
  • storage of the data representation in the DSN memory in accordance with one or more of metadata, preferences, and/or operational parameters (e.g., dispersed storage error coding parameters).
  • the user devices 201 - 203 traverse the user data from time to time where the user data may include one or more of banking information, home video, video broadcasts, pictures from a user camera, e-mail messages, short message service messages, class notes, website visits, web downloads, contact lists, social networking connections, school grades, medical records, social networking messaging, password lists, and any other user data type associated with the user.
  • the user data may be communicated from one user device to another user device and/or from a user device to a module or unit external to the computing system. Further note that the user data may be stored in any one or more of the user devices 201 - 203 .
  • the collection module 274 of user device 201 intercepts medical records that are being processed by user device 201 .
  • the collection module 274 determines metadata based on the medical records and determines preferences based on a user identifier (ID).
  • the collection module 274 determines whether to archive the medical records based in part on the medical records, the metadata, and the preferences.
  • the collection module 274 processes the medical records in accordance with the preferences to produce a data representation when the collection module 274 determines to archive the medical records.
  • the collection module 274 of the user device 201 sends the data representation 275 to the DS processing unit 96 .
  • the data representation 275 may include one or more of the data, the metadata, the preferences, and storage guidance.
  • the DS processing unit 96 determines operational parameters, creates encoded data slices based on the data representation, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11 .
  • the collection module 274 of the user device 201 determines operational parameters based in part on one or more of the user data, the metadata, the preferences, and the data representation.
  • the collection module 274 sends the data representation 275 to the DS processing unit 96 .
  • the data representation 275 may include one or more of the operational parameters, the metadata, the preferences, and storage guidance.
  • the DS processing unit 96 determines final operational parameters based in part on the operational parameters from the collection module 274 , creates encoded data slices based on the data representation and the final operational parameters, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11 .
  • the collection module 274 of user device 202 intercepts banking records that are being viewed by user device 202 .
  • the collection module 274 determines metadata based on the banking records and determines preferences based on a user ID.
  • the collection module 274 determines whether to archive the banking records based on the banking records, the metadata, and the preferences.
  • the collection module 274 processes the banking records in accordance with the preferences to produce a data representation when the collection module determines to archive the banking records.
  • the collection module 274 sends the data representation to the DS processing module 94 of the 2 nd DS such that the data representation may include one or more of the metadata, the preferences, and storage guidance.
  • the DS processing module 94 determines operational parameters, creates encoded data slices based on the data representation, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11 .
  • the collection module 274 determines operational parameters based on one or more of the user data (e.g., the banking records), the metadata, the preferences, and the data representation.
  • the collection module 274 sends the data representation to the DS processing module 94 of the 2 nd DS unit, wherein the data representation includes one or more of the operational parameters, the metadata, the preferences, and storage guidance.
  • the DS processing module 94 determines final operational parameters based in part on the operational parameters from the collection module, creates encoded data slices based on the data representation and the final operational parameters, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11 .
  • the collection module 274 of user device 203 intercepts home video files that are being processed by user device 203 .
  • the collection module 274 determines metadata based on one or more of the home video files and determines preferences based in part on a user ID.
  • the collection module 274 determines whether to archive the home video files based on the home video files, the metadata, and the preferences.
  • the collection module 274 processes the home video files in accordance with the preferences to produce a data representation when the collection module 274 determines to archive the home video files.
  • the collection module 274 sends the data representation to the DS processing module 94 of the 3 rd DS unit, wherein the data representation includes one or more of the metadata, the preferences, and storage guidance.
  • the DS processing module 94 determines operational parameters, creates encoded data slices based on the data representation and the operational parameters, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11 .
  • the collection module 274 determines operational parameters based on one or more of the user data (e.g., the home video files), the metadata, the preferences, and the data representation.
  • the collection module 274 sends the data representation to the DS processing module 94 of the 3 rd DS unit, wherein the data representation includes one or more of the operational parameters, the metadata, the preferences, and storage guidance.
  • the DS processing module 94 determines final operational parameters based on the operational parameters from the collection module 274 , creates encoded data slices based on the data representation and the final operational parameters, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11 .
  • FIG. 10 is a flowchart illustrating an example of archiving data.
  • the method begins with step 276 where the processing module captures user data. Such capturing may include one or more of monitoring a data stream between a user device and an external entity, monitoring a data stream internally between functional elements within the user device, and retrieving stored data from a memory of the user device.
  • the method continues at step 278 where the processing module determines metadata, wherein the metadata may include one or more of a user identifier (ID), a data type, a source indicator, a destination indicator, a context indicator, a priority indicator, a status indicator, a time indicator, and a date indicator.
  • ID user identifier
  • Such a determination may be based on one or more of the captured user data, current activity or activities of the user device (e.g., active processes, machines state, input/output utilization, memory utilization, etc.), geographic location information, clock information, a sensor input, a user record, a lookup, a command, a predetermination, and message.
  • the processing module determines the metadata to include a banking record data type indicator and a geographic location-based context indicator when the processing module determines the banking data type and geographic location information.
  • step 280 the processing module determines preferences, wherein the preferences may include one or more of archiving priority by data type, archiving frequency, context priority, status priority, volume priority, performance requirements, and reliability requirements. Such a determination may be based on one or more of the user ID, the user data, the metadata, context information, a lookup, a predetermination, a command, a query response, and a message.
  • step 282 the processing module determines whether to archive data based on one or more of the metadata, context information, a user ID, a lookup, the preferences, and a comparison of the metadata to one or more thresholds. For example, the processing module determines to archive data when the metadata indicates that the user data comprises new banking records.
  • the processing module determines to not archive data when the metadata indicates that the user data comprises routine website access information.
  • the method repeats back to step 276 when the processing module determines not to archive data.
  • the method continues to step 284 when the processing module determines to archive data.
  • step 284 the processing module processes the user data to produce a data representation, wherein the data representation may be in a compressed and/or a transformed form to facilitate storage in a dispersed storage network (DSN) memory.
  • the processing module processes the data based on one or more of the captured data, the metadata, the preferences, a processing method table lookup, a command, a message, and a predetermination.
  • the processing module processes the user data to produce a data representation where a size of the data representation facilitates an optimization of DSN memory storage efficiency.
  • the data representation size may be determined to align with a data segment and data slice sizes such that memory is not unnecessarily underutilized as data blocks are stored in dispersed storage (DS) units of the DSN memory.
  • step 286 the processing module determines operational parameters. Such a determination may be based on one or more of the data representation, the captured user data, the metadata, the preferences, a processing method table lookup, a command, a message, and a predetermination. For example, the processing module determines a pillar width and decode threshold such that an above average reliability approach to storing the data representation is provided when the processing module determines that the metadata indicates that the user data comprises very high priority financial records requiring a very long term of storage without failure.
  • step 288 the processing module facilitates storage of the data representation in the DSN memory.
  • the processing module dispersed storage error encodes the data representation utilizing the operational parameters to produce encoded data slices.
  • the processing module sends the encoded data slices to the DS units of the DSN memory for storage therein.
  • the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items.
  • an industry-accepted tolerance is less than one percent and, for other industries, the industry-accepted tolerance is 10 percent or more.
  • Other examples of industry-accepted tolerance range from less than one percent to fifty percent.
  • Industry-accepted tolerances correspond to, but are not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, thermal noise, dimensions, signaling errors, dropped packets, temperatures, pressures, material compositions, and/or performance metrics.
  • tolerance variances of accepted tolerances may be more or less than a percentage level (e.g., dimension tolerance of less than +/ ⁇ 1%). Some relativity between items may range from a difference of less than a percentage level to a few percent. Other relativity between items may range from a difference of a few percent to magnitude of differences.
  • the term(s) “configured to”, “operably coupled to”, “coupled to”, and/or “coupling” includes direct coupling between items and/or indirect coupling between items via an intervening item (e.g., an item includes, but is not limited to, a component, an element, a circuit, and/or a module) where, for an example of indirect coupling, the intervening item does not modify the information of a signal but may adjust its current level, voltage level, and/or power level.
  • inferred coupling i.e., where one element is coupled to another element by inference
  • the term “configured to”, “operable to”, “coupled to”, or “operably coupled to” indicates that an item includes one or more of power connections, input(s), output(s), etc., to perform, when activated, one or more its corresponding functions and may further include inferred coupling to one or more other items.
  • the term “associated with”, includes direct and/or indirect coupling of separate items and/or one item being embedded within another item.
  • the term “compares favorably”, indicates that a comparison between two or more items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal 1 has a greater magnitude than signal 2, a favorable comparison may be achieved when the magnitude of signal 1 is greater than that of signal 2 or when the magnitude of signal 2 is less than that of signal 1.
  • the term “compares unfavorably”, indicates that a comparison between two or more items, signals, etc., fails to provide the desired relationship.
  • one or more claims may include, in a specific form of this generic form, the phrase “at least one of a, b, and c” or of this generic form “at least one of a, b, or c”, with more or less elements than “a”, “b”, and “c”.
  • the phrases are to be interpreted identically.
  • “at least one of a, b, and c” is equivalent to “at least one of a, b, or c” and shall mean a, b, and/or c.
  • it means: “a” only, “b” only, “c” only, “a” and “b”, “a” and “c”, “b” and “c”, and/or “a”, “b”, and “c”.
  • processing module may be a single processing device or a plurality of processing devices.
  • a processing device may be a microprocessor, micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on hard coding of the circuitry and/or operational instructions.
  • the processing module, module, processing circuit, processing circuitry, and/or processing unit may be, or further include, memory and/or an integrated memory element, which may be a single memory device, a plurality of memory devices, and/or embedded circuitry of another processing module, module, processing circuit, processing circuitry, and/or processing unit.
  • a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information.
  • processing module, module, processing circuit, processing circuitry, and/or processing unit includes more than one processing device, the processing devices may be centrally located (e.g., directly coupled together via a wired and/or wireless bus structure) or may be distributedly located (e.g., cloud computing via indirect coupling via a local area network and/or a wide area network).
  • the processing module, module, processing circuit, processing circuitry and/or processing unit implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry
  • the memory and/or memory element storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry.
  • the memory element may store, and the processing module, module, processing circuit, processing circuitry and/or processing unit executes, hard coded and/or operational instructions corresponding to at least some of the steps and/or functions illustrated in one or more of the Figures.
  • Such a memory device or memory element can be included in an article of manufacture.
  • a flow diagram may include a “start” and/or “continue” indication.
  • the “start” and “continue” indications reflect that the steps presented can optionally be incorporated in or otherwise used in conjunction with one or more other routines.
  • a flow diagram may include an “end” and/or “continue” indication.
  • the “end” and/or “continue” indications reflect that the steps presented can end as described and shown or optionally be incorporated in or otherwise used in conjunction with one or more other routines.
  • start indicates the beginning of the first step presented and may be preceded by other activities not specifically shown.
  • the “continue” indication reflects that the steps presented may be performed multiple times and/or may be succeeded by other activities not specifically shown.
  • a flow diagram indicates a particular ordering of steps, other orderings are likewise possible provided that the principles of causality are maintained.
  • the one or more embodiments are used herein to illustrate one or more aspects, one or more features, one or more concepts, and/or one or more examples.
  • a physical embodiment of an apparatus, an article of manufacture, a machine, and/or of a process may include one or more of the aspects, features, concepts, examples, etc. described with reference to one or more of the embodiments discussed herein.
  • the embodiments may incorporate the same or similarly named functions, steps, modules, etc. that may use the same or different reference numbers and, as such, the functions, steps, modules, etc. may be the same or similar functions, steps, modules, etc. or different ones.
  • signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential.
  • signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential.
  • a signal path is shown as a single-ended path, it also represents a differential signal path.
  • a signal path is shown as a differential path, it also represents a single-ended signal path.
  • module is used in the description of one or more of the embodiments.
  • a module implements one or more functions via a device such as a processor or other processing device or other hardware that may include or operate in association with a memory that stores operational instructions.
  • a module may operate independently and/or in conjunction with software and/or firmware.
  • a module may contain one or more sub-modules, each of which may be one or more modules.
  • a computer readable memory includes one or more memory elements.
  • a memory element may be a separate memory device, multiple memory devices, or a set of memory locations within a memory device.
  • Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information.
  • the memory device may be in a form a solid-state memory, a hard drive memory, cloud memory, thumb drive, server memory, computing device memory, and/or other physical medium for storing digital information.

Abstract

A method includes encoding data via erasure coding to produce a plurality of data slices. The method further includes determining a plurality of identifiers corresponding to the data. The method further includes generating integrity information based on the plurality of identifiers by performing a cyclic redundancy check. The method further includes storing the plurality of data slices, the plurality of identifiers, and the integrity information in a storage system.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • The present U.S. Utility Patent Application claims priority pursuant to 35 U.S.C. § 120 as a continuation of U.S. Utility application Ser. No. 17/023,971, entitled “STORING INTEGRITY INFORMATION IN A VAST STORAGE SYSTEM”, filed Sep. 17, 2020, which is a continuation-in-part (CIP) of U.S. Utility application Ser. No. 16/137,681, entitled “CONTENT ARCHIVING IN A DISTRIBUTED STORAGE NETWORK”, filed Sep. 21, 2018, issued as U.S. Pat. No. 10,866,754 on Dec. 15, 2020, which is a continuation-in-part (CIP) of U.S. Utility application Ser. No. 14/454,013, entitled “COOPERATIVE DATA ACCESS REQUEST AUTHORIZATION IN A DISPERSED STORAGE NETWORK”, filed Aug. 7, 2014, issued as U.S. Pat. No. 10,154,034 on Dec. 11, 2018, which is a continuation-in-part (CIP) of U.S. Utility application Ser. No. 13/021,552, entitled “SLICE RETRIEVAL IN ACCORDANCE WITH AN ACCESS SEQUENCE IN A DISPERSED STORAGE NETWORK”, filed Feb. 4, 2011, issued as U.S. Pat. No. 9,063,881 on Jun. 23, 2015, which claims priority pursuant to 35 U.S.C. § 119(e) to U.S. Provisional Application No. 61/327,921, entitled “SYSTEM ACCESS AND DATA INTEGRITY VERIFICATION IN A DISPERSED STORAGE SYSTEM”, filed Apr. 26, 2010, all of which are hereby incorporated herein by reference in their entirety and made part of the present U.S. Utility Patent Application for all purposes.
  • BACKGROUND Technical Field
  • This invention relates generally to computer networks and more particularly to dispersing error encoded data.
  • Description of Related Art
  • Computing devices are known to communicate data, process data, and/or store data. Such computing devices range from wireless smart phones, laptops, tablets, personal computers (PC), work stations, and video game devices, to data centers that support millions of web searches, stock trades, or on-line purchases every day. In general, a computing device includes a central processing unit (CPU), a memory system, user input/output interfaces, peripheral device interfaces, and an interconnecting bus structure.
  • As is further known, a computer may effectively extend its CPU by using “cloud computing” to perform one or more computing functions (e.g., a service, an application, an algorithm, an arithmetic logic function, etc.) on behalf of the computer. Further, for large services, applications, and/or functions, cloud computing may be performed by multiple cloud computing resources in a distributed manner to improve the response time for completion of the service, application, and/or function. For example, Hadoop is an open source software framework that supports distributed applications enabling application execution by thousands of computers.
  • In addition to cloud computing, a computer may use “cloud storage” as part of its memory system. As is known, cloud storage enables a user, via its computer, to store files, applications, etc. on an Internet storage system. The Internet storage system may include a RAID (redundant array of independent disks) system and/or a dispersed storage system that uses an error correction scheme to encode data for storage.
  • Various conventional storage systems are used to archive user data. Usually, however, the data to be archived requires a user to specify a file path to the data to be stored in an archive, or by requiring a user to specify particular file or object name for storage.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a schematic block diagram of an embodiment of a dispersed or distributed storage network (DSN) in accordance with the present invention;
  • FIG. 2 is a schematic block diagram of an embodiment of a computing core in accordance with the present invention;
  • FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data in accordance with the present invention;
  • FIG. 4 is a schematic block diagram of a generic example of an error encoding function in accordance with the present invention;
  • FIG. 5 is a schematic block diagram of a specific example of an error encoding function in accordance with the present invention;
  • FIG. 6 is a schematic block diagram of an example of a slice name of an encoded data slice (EDS) in accordance with the present invention;
  • FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of data in accordance with the present invention;
  • FIG. 8 is a schematic block diagram of a generic example of an error decoding function in accordance with the present invention;
  • FIG. 9 is a schematic block diagram of another embodiment of a computing system in accordance with the present invention; and
  • FIG. 10 is a flowchart illustrating an example of archiving data in accordance with the present invention.
  • DETAILED DESCRIPTION
  • FIG. 1 is a schematic block diagram of an embodiment of a dispersed, or distributed, storage network (DSN) 10 that includes a plurality of computing devices 12-16, a managing unit 18, an integrity processing unit 20, and a DSN memory 22. The components of the DSN 10 are coupled to a network 24, which may include one or more wireless and/or wire lined communication systems; one or more non-public intranet systems and/or public internet systems; and/or one or more local area networks (LAN) and/or wide area networks (WAN).
  • The DSN memory 22 includes a plurality of storage units 36 that may be located at geographically different sites (e.g., one in Chicago, one in Milwaukee, etc.), at a common site, or a combination thereof. For example, if the DSN memory 22 includes eight storage units 36, each storage unit is located at a different site. As another example, if the DSN memory 22 includes eight storage units 36, all eight storage units are located at the same site. As yet another example, if the DSN memory 22 includes eight storage units 36, a first pair of storage units are at a first common site, a second pair of storage units are at a second common site, a third pair of storage units are at a third common site, and a fourth pair of storage units are at a fourth common site. Note that a DSN memory 22 may include more or less than eight storage units 36. Further note that each storage unit 36 includes a computing core (as shown in FIG. 2, or components thereof) and a plurality of memory devices for storing dispersed error encoded data.
  • Each of the computing devices 12-16, the managing unit 18, and the integrity processing unit 20 include a computing core 26, which includes network interfaces 30-33. Computing devices 12-16 may each be a portable computing device and/or a fixed computing device. A portable computing device may be a social networking device, a gaming device, a cell phone, a smart phone, a digital assistant, a digital music player, a digital video player, a laptop computer, a handheld computer, a tablet, a video game controller, and/or any other portable device that includes a computing core. A fixed computing device may be a computer (PC), a computer server, a cable set-top box, a satellite receiver, a television set, a printer, a fax machine, home entertainment equipment, a video game console, and/or any type of home or office computing equipment. Note that each of the managing unit 18 and the integrity processing unit 20 may be separate computing devices, may be a common computing device, and/or may be integrated into one or more of the computing devices 12-16 and/or into one or more of the storage units 36.
  • Each interface 30, 32, and 33 includes software and hardware to support one or more communication links via the network 24 indirectly and/or directly. For example, interface 30 supports a communication link (e.g., wired, wireless, direct, via a LAN, via the network 24, etc.) between computing devices 14 and 16. As another example, interface 32 supports communication links (e.g., a wired connection, a wireless connection, a LAN connection, and/or any other type of connection to/from the network 24) between computing devices 12 and 16 and the DSN memory 22. As yet another example, interface 33 supports a communication link for each of the managing unit 18 and the integrity processing unit 20 to the network 24.
  • Computing devices 12 and 16 include a dispersed storage (DS) client module 34, which enables the computing device to dispersed storage error encode and decode data (e.g., data 40) as subsequently described with reference to one or more of FIGS. 3-8. In this example embodiment, computing device 16 functions as a dispersed storage processing agent for computing device 14. In this role, computing device 16 dispersed storage error encodes and decodes data on behalf of computing device 14. With the use of dispersed storage error encoding and decoding, the DSN 10 is tolerant of a significant number of storage unit failures (the number of failures is based on parameters of the dispersed storage error encoding function) without loss of data and without the need for a redundant or backup copies of the data. Further, the DSN 10 stores data for an indefinite period of time without data loss and in a secure manner (e.g., the system is very resistant to unauthorized attempts at accessing the data).
  • In operation, the managing unit 18 performs DS management services. For example, the managing unit 18 establishes distributed data storage parameters (e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.) for computing devices 12-14 individually or as part of a group of user devices. As a specific example, the managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within the DSN memory 22 for a user device, a group of devices, or for public access and establishes per vault dispersed storage (DS) error encoding parameters for a vault. The managing unit 18 facilitates storage of DS error encoding parameters for each vault by updating registry information of the DSN 10, where the registry information may be stored in the DSN memory 22, a computing device 12-16, the managing unit 18, and/or the integrity processing unit 20.
  • The managing unit 18 creates and stores user profile information (e.g., an access control list (ACL)) in local memory and/or within memory of the DSN memory 22. The user profile information includes authentication information, permissions, and/or the security parameters. The security parameters may include encryption/decryption scheme, one or more encryption keys, key generation scheme, and/or data encoding/decoding scheme.
  • The managing unit 18 creates billing information for a particular user, a user group, a vault access, public vault access, etc. For instance, the managing unit 18 tracks the number of times a user accesses a non-public vault and/or public vaults, which can be used to generate a per-access billing information. In another instance, the managing unit 18 tracks the amount of data stored and/or retrieved by a user device and/or a user group, which can be used to generate a per-data-amount billing information.
  • As another example, the managing unit 18 performs network operations, network administration, and/or network maintenance. Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, storage units, and/or computing devices with a DS client module 34) to/from the DSN 10, and/or establishing authentication credentials for the storage units 36. Network administration includes monitoring devices and/or units for failures, maintaining vault information, determining device and/or unit activation status, determining device and/or unit loading, and/or determining any other system level operation that affects the performance level of the DSN 10. Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of the DSN 10.
  • The integrity processing unit 20 performs rebuilding of ‘bad’ or missing encoded data slices. At a high level, the integrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from the DSN memory 22. For retrieved encoded slices, they are checked for errors due to data corruption, outdated version, etc. If a slice includes an error, it is flagged as a ‘bad’ slice. For encoded data slices that were not received and/or not listed, they are flagged as missing slices. Bad and/or missing slices are subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices to produce rebuilt slices. The rebuilt slices are stored in the DSN memory 22.
  • FIG. 2 is a schematic block diagram of an embodiment of a computing core 26 that includes a processing module 50, a memory controller 52, main memory 54, a video graphics processing unit 55, an input/output (IO) controller 56, a peripheral component interconnect (PCI) interface 58, an IO interface module 60, at least one IO device interface module 62, a read only memory (ROM) basic input output system (BIOS) 64, and one or more memory interface modules. The one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66, a host bus adapter (HBA) interface module 68, a network interface module 70, a flash interface module 72, a hard drive interface module 74, and a DSN interface module 76.
  • The DSN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.). The DSN interface module 76 and/or the network interface module 70 may function as one or more of the interface 30-33 of FIG. 1. Note that the IO device interface module 62 and/or the memory interface modules 66-76 may be collectively or individually referred to as IO ports.
  • FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data. When a computing device 12 or 16 has data to store it disperse storage error encodes the data in accordance with a dispersed storage error encoding process based on dispersed storage error encoding parameters. The dispersed storage error encoding parameters include an encoding function (e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.), a data segmenting protocol (e.g., data segment size, fixed, variable, etc.), and per data segment encoding values. The per data segment encoding values include a total, or pillar width, number (T) of encoded data slices per encoding of a data segment (i.e., in a set of encoded data slices); a decode threshold number (D) of encoded data slices of a set of encoded data slices that are needed to recover the data segment; a read threshold number (R) of encoded data slices to indicate a number of encoded data slices per set to be read from storage for decoding of the data segment; and/or a write threshold number (W) to indicate a number of encoded data slices per set that must be accurately stored before the encoded data segment is deemed to have been properly stored. The dispersed storage error encoding parameters may further include slicing information (e.g., the number of encoded data slices that will be created for each data segment) and/or slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).
  • In the present example, Cauchy Reed-Solomon has been selected as the encoding function (a generic example is shown in FIG. 4 and a specific example is shown in FIG. 5); the data segmenting protocol is to divide the data object into fixed sized data segments; and the per data segment encoding values include: a pillar width of 5, a decode threshold of 3, a read threshold of 4, and a write threshold of 4. In accordance with the data segmenting protocol, the computing device 12 or 16 divides the data (e.g., a file (e.g., text, video, audio, etc.), a data object, or other data arrangement) into a plurality of fixed sized data segments (e.g., 1 through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more). The number of data segments created is dependent of the size of the data and the data segmenting protocol.
  • The computing device 12 or 16 then disperse storage error encodes a data segment using the selected encoding function (e.g., Cauchy Reed-Solomon) to produce a set of encoded data slices. FIG. 4 illustrates a generic Cauchy Reed-Solomon encoding function, which includes an encoding matrix (EM), a data matrix (DM), and a coded matrix (CM). The size of the encoding matrix (EM) is dependent on the pillar width number (T) and the decode threshold number (D) of selected per data segment encoding values. To produce the data matrix (DM), the data segment is divided into a plurality of data blocks and the data blocks are arranged into D number of rows with Z data blocks per row. Note that Z is a function of the number of data blocks created from the data segment and the decode threshold number (D). The coded matrix is produced by matrix multiplying the data matrix by the encoding matrix.
  • FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encoding with a pillar number (T) of five and decode threshold number of three. In this example, a first data segment is divided into twelve data blocks (D1-D12). The coded matrix includes five rows of coded data blocks, where the first row of X11-X14 corresponds to a first encoded data slice (EDS 1_1), the second row of X21-X24 corresponds to a second encoded data slice (EDS 2_1), the third row of X31-X34 corresponds to a third encoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to a fourth encoded data slice (EDS 4_1), and the fifth row of X51-X54 corresponds to a fifth encoded data slice (EDS 5_1). Note that the second number of the EDS designation corresponds to the data segment number.
  • Returning to the discussion of FIG. 3, the computing device also creates a slice name (SN) for each encoded data slice (EDS) in the set of encoded data slices. A typical format for a slice name 80 is shown in FIG. 6. As shown, the slice name (SN) 80 includes a pillar number of the encoded data slice (e.g., one of 1-T), a data segment number (e.g., one of 1-Y), a vault identifier (ID), a data object identifier (ID), and may further include revision level information of the encoded data slices. The slice name functions as, at least part of, a DSN address for the encoded data slice for storage and retrieval from the DSN memory 22.
  • As a result of encoding, the computing device 12 or 16 produces a plurality of sets of encoded data slices, which are provided with their respective slice names to the storage units for storage. As shown, the first set of encoded data slices includes EDS 1_1 through EDS 5_1 and the first set of slice names includes SN 1_1 through SN 5_1 and the last set of encoded data slices includes EDS 1_Y through EDS 5_Y and the last set of slice names includes SN 1_Y through SN 5_Y.
  • FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of a data object that was dispersed storage error encoded and stored in the example of FIG. 4. In this example, the computing device 12 or 16 retrieves from the storage units at least the decode threshold number of encoded data slices per data segment. As a specific example, the computing device retrieves a read threshold number of encoded data slices.
  • To recover a data segment from a decode threshold number of encoded data slices, the computing device uses a decoding function as shown in FIG. 8. As shown, the decoding function is essentially an inverse of the encoding function of FIG. 4. The coded matrix includes a decode threshold number of rows (e.g., three in this example) and the decoding matrix in an inversion of the encoding matrix that includes the corresponding rows of the coded matrix. For example, if the coded matrix includes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2, and 4, and then inverted to produce the decoding matrix.
  • FIGS. 9 and 10 illustrate particular embodiments in which content data stored in a user device, or data transmitted between a user device and an external device, can be automatically and conditionally archived using a distributed storage network (DSN). For example, a DS processing agent inside of a device (e.g., a smart phone, a land based phone, a laptop, desktop, the cable box, a home security system, a home automation system, etc.) grabs content, filters it, sorts it, and stores it in a DSN memory. For example: banking info, home video, pictures, e-mail, SMS, class notes, website visits, contacts, connections, grades, medical records, social networking messaging, and/or password lists. The DS processing agent correlates the data to preferences to determine how much content to save, and how often to store new content. The agent also determines operational parameters associated with the DSN based on one or more of the data type, age, priority, status, etc. In some implementations, the DS processing utilizes two different DS units to store different types of critical information, or to store particular types of critical information in pillars associated with two different DS units.
  • FIG. 9 is a schematic block diagram of another embodiment of a computing system that includes a user device domain 272, a dispersed storage (DS) processing unit 96, such as computing device 16, and a dispersed storage network (DSN) memory 22. The user device domain 272 includes user devices 201-203. Note that the user device domain 272 may include any number of user devices. The DS processing unit 96 includes a DS processing module 94 and the DSN memory 22 includes a plurality of 1st-Nth DS units. Such user devices 201-203 of the user device domain 272 are associated with a common user such that data, information, and/or messages traversed by the user devices 201-203 share relationship with the common user. The DS processing unit 96 provides user device 201 access to the DSN memory 22 when the user device 201 does not include a DS processing module 94, such as DS client module 34.
  • The user devices 201-203 may include fixed or portable devices as discussed previously (e.g., a smart phone, a wired phone, a laptop computer, a tablet computer, a desktop computer, a cable set-top box, a smart appliance, a home security system, a home automation system, etc.). The user devices 201-203 may include a computing core, one or more interfaces, the DS processing module 94 and/or a collection module 274. For example, user device 201 includes the collection module 274. User device 202 includes the collection module 274 and the DS processing module 94. User device 3 includes the DS processing module 94 which includes the collection module 274. The collection module 274 includes a functional entity (e.g., a software application that runs on a computing core or as part of a processing module) that intercepts user data, processes the user data to produce a data representation, and/or facilitates storage of the data representation in the DSN memory in accordance with one or more of metadata, preferences, and/or operational parameters (e.g., dispersed storage error coding parameters).
  • In an example of operation, the user devices 201-203 traverse the user data from time to time where the user data may include one or more of banking information, home video, video broadcasts, pictures from a user camera, e-mail messages, short message service messages, class notes, website visits, web downloads, contact lists, social networking connections, school grades, medical records, social networking messaging, password lists, and any other user data type associated with the user. Note that the user data may be communicated from one user device to another user device and/or from a user device to a module or unit external to the computing system. Further note that the user data may be stored in any one or more of the user devices 201-203.
  • In another example of operation, the collection module 274 of user device 201 intercepts medical records that are being processed by user device 201. The collection module 274 determines metadata based on the medical records and determines preferences based on a user identifier (ID). The collection module 274 determines whether to archive the medical records based in part on the medical records, the metadata, and the preferences. The collection module 274 processes the medical records in accordance with the preferences to produce a data representation when the collection module 274 determines to archive the medical records. For example, the collection module 274 of the user device 201 sends the data representation 275 to the DS processing unit 96. The data representation 275 may include one or more of the data, the metadata, the preferences, and storage guidance. The DS processing unit 96 determines operational parameters, creates encoded data slices based on the data representation, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11. As another example, the collection module 274 of the user device 201 determines operational parameters based in part on one or more of the user data, the metadata, the preferences, and the data representation. Next, the collection module 274 sends the data representation 275 to the DS processing unit 96. In this example, the data representation 275 may include one or more of the operational parameters, the metadata, the preferences, and storage guidance. The DS processing unit 96 determines final operational parameters based in part on the operational parameters from the collection module 274, creates encoded data slices based on the data representation and the final operational parameters, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11.
  • In yet another example of operation, the collection module 274 of user device 202 intercepts banking records that are being viewed by user device 202. The collection module 274 determines metadata based on the banking records and determines preferences based on a user ID. The collection module 274 determines whether to archive the banking records based on the banking records, the metadata, and the preferences. The collection module 274 processes the banking records in accordance with the preferences to produce a data representation when the collection module determines to archive the banking records. For example, the collection module 274 sends the data representation to the DS processing module 94 of the 2nd DS such that the data representation may include one or more of the metadata, the preferences, and storage guidance. The DS processing module 94 determines operational parameters, creates encoded data slices based on the data representation, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11. As another example, the collection module 274 determines operational parameters based on one or more of the user data (e.g., the banking records), the metadata, the preferences, and the data representation. The collection module 274 sends the data representation to the DS processing module 94 of the 2nd DS unit, wherein the data representation includes one or more of the operational parameters, the metadata, the preferences, and storage guidance. The DS processing module 94 determines final operational parameters based in part on the operational parameters from the collection module, creates encoded data slices based on the data representation and the final operational parameters, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11.
  • In a further example of operation, the collection module 274 of user device 203 intercepts home video files that are being processed by user device 203. The collection module 274 determines metadata based on one or more of the home video files and determines preferences based in part on a user ID. The collection module 274 determines whether to archive the home video files based on the home video files, the metadata, and the preferences. The collection module 274 processes the home video files in accordance with the preferences to produce a data representation when the collection module 274 determines to archive the home video files. For example, the collection module 274 sends the data representation to the DS processing module 94 of the 3rd DS unit, wherein the data representation includes one or more of the metadata, the preferences, and storage guidance. The DS processing module 94 determines operational parameters, creates encoded data slices based on the data representation and the operational parameters, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11. As another example, the collection module 274 determines operational parameters based on one or more of the user data (e.g., the home video files), the metadata, the preferences, and the data representation. The collection module 274 sends the data representation to the DS processing module 94 of the 3rd DS unit, wherein the data representation includes one or more of the operational parameters, the metadata, the preferences, and storage guidance. The DS processing module 94 determines final operational parameters based on the operational parameters from the collection module 274, creates encoded data slices based on the data representation and the final operational parameters, and sends the encoded data slices 11 to the DSN memory 22 with a store command to store the encoded data slices 11.
  • FIG. 10 is a flowchart illustrating an example of archiving data. The method begins with step 276 where the processing module captures user data. Such capturing may include one or more of monitoring a data stream between a user device and an external entity, monitoring a data stream internally between functional elements within the user device, and retrieving stored data from a memory of the user device. The method continues at step 278 where the processing module determines metadata, wherein the metadata may include one or more of a user identifier (ID), a data type, a source indicator, a destination indicator, a context indicator, a priority indicator, a status indicator, a time indicator, and a date indicator. Such a determination may be based on one or more of the captured user data, current activity or activities of the user device (e.g., active processes, machines state, input/output utilization, memory utilization, etc.), geographic location information, clock information, a sensor input, a user record, a lookup, a command, a predetermination, and message. For example, the processing module determines the metadata to include a banking record data type indicator and a geographic location-based context indicator when the processing module determines the banking data type and geographic location information.
  • The method continues with step 280 where the processing module determines preferences, wherein the preferences may include one or more of archiving priority by data type, archiving frequency, context priority, status priority, volume priority, performance requirements, and reliability requirements. Such a determination may be based on one or more of the user ID, the user data, the metadata, context information, a lookup, a predetermination, a command, a query response, and a message. The method continues at step 282 where the processing module determines whether to archive data based on one or more of the metadata, context information, a user ID, a lookup, the preferences, and a comparison of the metadata to one or more thresholds. For example, the processing module determines to archive data when the metadata indicates that the user data comprises new banking records. As another example, the processing module determines to not archive data when the metadata indicates that the user data comprises routine website access information. The method repeats back to step 276 when the processing module determines not to archive data. The method continues to step 284 when the processing module determines to archive data.
  • The method continues at step 284 where the processing module processes the user data to produce a data representation, wherein the data representation may be in a compressed and/or a transformed form to facilitate storage in a dispersed storage network (DSN) memory. The processing module processes the data based on one or more of the captured data, the metadata, the preferences, a processing method table lookup, a command, a message, and a predetermination. For example, the processing module processes the user data to produce a data representation where a size of the data representation facilitates an optimization of DSN memory storage efficiency. For instance, the data representation size may be determined to align with a data segment and data slice sizes such that memory is not unnecessarily underutilized as data blocks are stored in dispersed storage (DS) units of the DSN memory.
  • The method continues at step 286 where the processing module determines operational parameters. Such a determination may be based on one or more of the data representation, the captured user data, the metadata, the preferences, a processing method table lookup, a command, a message, and a predetermination. For example, the processing module determines a pillar width and decode threshold such that an above average reliability approach to storing the data representation is provided when the processing module determines that the metadata indicates that the user data comprises very high priority financial records requiring a very long term of storage without failure.
  • The method continues at step 288 where the processing module facilitates storage of the data representation in the DSN memory. For example, the processing module dispersed storage error encodes the data representation utilizing the operational parameters to produce encoded data slices. Next, the processing module sends the encoded data slices to the DS units of the DSN memory for storage therein.
  • It is noted that terminologies as may be used herein such as bit stream, stream, signal sequence, etc. (or their equivalents) have been used interchangeably to describe digital information whose content corresponds to any of a number of desired types (e.g., data, video, speech, text, graphics, audio, etc. any of which may generally be referred to as ‘data’).
  • As may be used herein, the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items. For some industries, an industry-accepted tolerance is less than one percent and, for other industries, the industry-accepted tolerance is 10 percent or more. Other examples of industry-accepted tolerance range from less than one percent to fifty percent. Industry-accepted tolerances correspond to, but are not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, thermal noise, dimensions, signaling errors, dropped packets, temperatures, pressures, material compositions, and/or performance metrics. Within an industry, tolerance variances of accepted tolerances may be more or less than a percentage level (e.g., dimension tolerance of less than +/−1%). Some relativity between items may range from a difference of less than a percentage level to a few percent. Other relativity between items may range from a difference of a few percent to magnitude of differences.
  • As may also be used herein, the term(s) “configured to”, “operably coupled to”, “coupled to”, and/or “coupling” includes direct coupling between items and/or indirect coupling between items via an intervening item (e.g., an item includes, but is not limited to, a component, an element, a circuit, and/or a module) where, for an example of indirect coupling, the intervening item does not modify the information of a signal but may adjust its current level, voltage level, and/or power level. As may further be used herein, inferred coupling (i.e., where one element is coupled to another element by inference) includes direct and indirect coupling between two items in the same manner as “coupled to”.
  • As may even further be used herein, the term “configured to”, “operable to”, “coupled to”, or “operably coupled to” indicates that an item includes one or more of power connections, input(s), output(s), etc., to perform, when activated, one or more its corresponding functions and may further include inferred coupling to one or more other items. As may still further be used herein, the term “associated with”, includes direct and/or indirect coupling of separate items and/or one item being embedded within another item.
  • As may be used herein, the term “compares favorably”, indicates that a comparison between two or more items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal 1 has a greater magnitude than signal 2, a favorable comparison may be achieved when the magnitude of signal 1 is greater than that of signal 2 or when the magnitude of signal 2 is less than that of signal 1. As may be used herein, the term “compares unfavorably”, indicates that a comparison between two or more items, signals, etc., fails to provide the desired relationship.
  • As may be used herein, one or more claims may include, in a specific form of this generic form, the phrase “at least one of a, b, and c” or of this generic form “at least one of a, b, or c”, with more or less elements than “a”, “b”, and “c”. In either phrasing, the phrases are to be interpreted identically. In particular, “at least one of a, b, and c” is equivalent to “at least one of a, b, or c” and shall mean a, b, and/or c. As an example, it means: “a” only, “b” only, “c” only, “a” and “b”, “a” and “c”, “b” and “c”, and/or “a”, “b”, and “c”.
  • As may also be used herein, the terms “processing module”, “processing circuit”, “processor”, “processing circuitry”, and/or “processing unit” may be a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on hard coding of the circuitry and/or operational instructions. The processing module, module, processing circuit, processing circuitry, and/or processing unit may be, or further include, memory and/or an integrated memory element, which may be a single memory device, a plurality of memory devices, and/or embedded circuitry of another processing module, module, processing circuit, processing circuitry, and/or processing unit. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. Note that if the processing module, module, processing circuit, processing circuitry, and/or processing unit includes more than one processing device, the processing devices may be centrally located (e.g., directly coupled together via a wired and/or wireless bus structure) or may be distributedly located (e.g., cloud computing via indirect coupling via a local area network and/or a wide area network). Further note that if the processing module, module, processing circuit, processing circuitry and/or processing unit implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry, the memory and/or memory element storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry. Still further note that, the memory element may store, and the processing module, module, processing circuit, processing circuitry and/or processing unit executes, hard coded and/or operational instructions corresponding to at least some of the steps and/or functions illustrated in one or more of the Figures. Such a memory device or memory element can be included in an article of manufacture.
  • One or more embodiments have been described above with the aid of method steps illustrating the performance of specified functions and relationships thereof. The boundaries and sequence of these functional building blocks and method steps have been arbitrarily defined herein for convenience of description. Alternate boundaries and sequences can be defined so long as the specified functions and relationships are appropriately performed. Any such alternate boundaries or sequences are thus within the scope and spirit of the claims. Further, the boundaries of these functional building blocks have been arbitrarily defined for convenience of description. Alternate boundaries could be defined as long as the certain significant functions are appropriately performed. Similarly, flow diagram blocks may also have been arbitrarily defined herein to illustrate certain significant functionality.
  • To the extent used, the flow diagram block boundaries and sequence could have been defined otherwise and still perform the certain significant functionality. Such alternate definitions of both functional building blocks and flow diagram blocks and sequences are thus within the scope and spirit of the claims. One of average skill in the art will also recognize that the functional building blocks, and other illustrative blocks, modules and components herein, can be implemented as illustrated or by discrete components, application specific integrated circuits, processors executing appropriate software and the like or any combination thereof.
  • In addition, a flow diagram may include a “start” and/or “continue” indication. The “start” and “continue” indications reflect that the steps presented can optionally be incorporated in or otherwise used in conjunction with one or more other routines. In addition, a flow diagram may include an “end” and/or “continue” indication. The “end” and/or “continue” indications reflect that the steps presented can end as described and shown or optionally be incorporated in or otherwise used in conjunction with one or more other routines. In this context, “start” indicates the beginning of the first step presented and may be preceded by other activities not specifically shown. Further, the “continue” indication reflects that the steps presented may be performed multiple times and/or may be succeeded by other activities not specifically shown. Further, while a flow diagram indicates a particular ordering of steps, other orderings are likewise possible provided that the principles of causality are maintained.
  • The one or more embodiments are used herein to illustrate one or more aspects, one or more features, one or more concepts, and/or one or more examples. A physical embodiment of an apparatus, an article of manufacture, a machine, and/or of a process may include one or more of the aspects, features, concepts, examples, etc. described with reference to one or more of the embodiments discussed herein. Further, from figure to figure, the embodiments may incorporate the same or similarly named functions, steps, modules, etc. that may use the same or different reference numbers and, as such, the functions, steps, modules, etc. may be the same or similar functions, steps, modules, etc. or different ones.
  • Unless specifically stated to the contra, signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential. For instance, if a signal path is shown as a single-ended path, it also represents a differential signal path. Similarly, if a signal path is shown as a differential path, it also represents a single-ended signal path. While one or more particular architectures are described herein, other architectures can likewise be implemented that use one or more data buses not expressly shown, direct connectivity between elements, and/or indirect coupling between other elements as recognized by one of average skill in the art.
  • The term “module” is used in the description of one or more of the embodiments. A module implements one or more functions via a device such as a processor or other processing device or other hardware that may include or operate in association with a memory that stores operational instructions. A module may operate independently and/or in conjunction with software and/or firmware. As also used herein, a module may contain one or more sub-modules, each of which may be one or more modules.
  • As may further be used herein, a computer readable memory includes one or more memory elements. A memory element may be a separate memory device, multiple memory devices, or a set of memory locations within a memory device. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. The memory device may be in a form a solid-state memory, a hard drive memory, cloud memory, thumb drive, server memory, computing device memory, and/or other physical medium for storing digital information.
  • While particular combinations of various functions and features of the one or more embodiments have been expressly described herein, other combinations of these features and functions are likewise possible. The present disclosure is not limited by the particular examples disclosed herein and expressly incorporates these other combinations.

Claims (20)

What is claimed is:
1. A method comprises:
encoding data via erasure coding to produce a plurality of data slices;
determining a plurality of identifiers corresponding to the data;
generating integrity information based on the plurality of identifiers by performing a cyclic redundancy check; and
storing the plurality of data slices, the plurality of identifiers, and the integrity information in a storage system.
2. The method of claim 1, wherein the data is encoded in accordance with a width, and wherein a corresponding decoding process can accommodate a number of failures equal to the width minus an error coding parameter utilized to encode the data.
3. The method of claim 2, wherein the width is greater than a size of the data.
4. The method of claim 1, further comprising:
performing data storage integrity verification by periodically retrieving data slices of the plurality of data slices from the storage system to verify whether one or more data slices of the plurality of data slices have been corrupted.
5. The method of claim 1, wherein the plurality of identifiers identify a virtual memory space that maps to storage units of the storage system.
6. The method of claim 1, wherein the plurality of identifiers are determined in conjunction with determining a plurality of virtual memory addresses corresponding to the plurality of data slices, wherein each virtual memory address of the plurality of virtual memory addresses is associated with a physical address, and wherein the integrity information is generated based on the plurality of virtual memory addresses.
7. The method of claim 1, wherein storing the plurality of data slices, the plurality of identifiers, and the integrity information in the storage system includes sending the plurality of data slices, the plurality of identifiers, and the integrity information to a plurality of storage units of the storage system for storage therein.
8. The method of claim 7, wherein the plurality of data slices and the plurality of identifiers and the integrity information are sent to the plurality of storage units based on operational health of the plurality of storage units.
9. The method of claim 1, wherein determining the integrity information further comprises:
generating data file integrity information for at least some of the plurality of identifiers; and
generating the integrity information based on the data file integrity information.
10. The method of claim 1, wherein the data is dispersed storage error encoded in accordance with dispersed storage error coding parameters to produce the plurality of data slices.
11. A computer comprises:
an interface;
a memory; and
a processing module operable to:
encode data via erasure coding to produce a plurality of data slices;
determine a plurality of identifiers corresponding to the data;
generate integrity information based on the plurality of identifiers by performing a cyclic redundancy check; and
store the plurality of data slices, the plurality of identifiers, and the integrity information in a storage system.
12. The computer of claim 11, wherein the data is encoded in accordance with a width, and wherein a corresponding decoding process can accommodate a number of failures equal to the width minus an error coding parameter algorithm utilized to encode the data.
13. The computer of claim 12, wherein the width is greater than a size of the data.
14. The computer of claim 11, wherein the processing module further functions to:
perform data storage integrity verification by periodically retrieving data slices of the plurality of data slices from the storage system to verify whether one or more data slices of the plurality of data slices have been corrupted.
15. The computer of claim 11, wherein the plurality of identifiers identify a virtual memory space that maps to storage units of the storage system.
16. The computer of claim 11, wherein the plurality of identifiers are determined in conjunction with determining a plurality of virtual memory addresses corresponding to the plurality of data slices, wherein each virtual memory address of the plurality of virtual memory addresses is associated with a physical address, and wherein the integrity information is generated based on the plurality of virtual memory addresses.
17. The computer of claim 11, wherein storing the plurality of data slices, the plurality of identifiers, and the integrity information in the storage system includes sending the plurality of data slices, the plurality of identifiers and the integrity information to a plurality of storage units of the storage system for storage therein.
18. The computer of claim 17, wherein the plurality of data slices and the plurality of identifiers and the integrity information are sent to the plurality of storage units based on operational health of the plurality of storage units.
19. The computer of claim 11, wherein determining the integrity information further comprises:
generating data file integrity information for at least some of the plurality of identifiers; and
generating the integrity information based on the data file integrity information.
20. The computer of claim 11, wherein the data is dispersed storage error encoded in accordance with dispersed storage error coding parameters to produce the plurality of data slices.
US17/362,251 2005-09-30 2021-06-29 Generating integrity information in a vast storage system Active US11340988B2 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US17/362,251 US11340988B2 (en) 2005-09-30 2021-06-29 Generating integrity information in a vast storage system
US17/743,717 US11544146B2 (en) 2005-09-30 2022-05-13 Utilizing integrity information in a vast storage system
US18/059,833 US11755413B2 (en) 2005-09-30 2022-11-29 Utilizing integrity information to determine corruption in a vast storage system
US18/363,179 US20230376380A1 (en) 2005-09-30 2023-08-01 Generating Multiple Sets of Integrity Information in a Vast Storage System

Applications Claiming Priority (23)

Application Number Priority Date Filing Date Title
US11/241,555 US7953937B2 (en) 2005-09-30 2005-09-30 Systems, methods, and apparatus for subdividing data for storage in a dispersed data storage grid
US11/403,684 US7574570B2 (en) 2005-09-30 2006-04-13 Billing system for information dispersal system
US11/403,391 US7546427B2 (en) 2005-09-30 2006-04-13 System for rebuilding dispersed data
US11/404,071 US7574579B2 (en) 2005-09-30 2006-04-13 Metadata management system for an information dispersed storage system
US11/973,613 US8285878B2 (en) 2007-10-09 2007-10-09 Block based access to a dispersed data storage network
US11/973,621 US7904475B2 (en) 2007-10-09 2007-10-09 Virtualized data storage vaults on a dispersed data storage network
US11/973,622 US8171101B2 (en) 2005-09-30 2007-10-09 Smart access to a dispersed data storage network
US11/973,542 US9996413B2 (en) 2007-10-09 2007-10-09 Ensuring data integrity on a dispersed storage grid
US12/080,042 US8880799B2 (en) 2005-09-30 2008-03-31 Rebuilding data on a dispersed storage network
US12/218,200 US8209363B2 (en) 2007-10-09 2008-07-14 File system adapted for use with a dispersed data storage network
US12/218,594 US7962641B1 (en) 2005-09-30 2008-07-16 Streaming media software interface to a dispersed data storage network
US23762409P 2009-08-27 2009-08-27
US12/749,592 US8938591B2 (en) 2005-09-30 2010-03-30 Dispersed storage processing unit and methods with data aggregation for use in a dispersed storage system
US32792110P 2010-04-26 2010-04-26
US35743010P 2010-06-22 2010-06-22
US13/021,552 US9063881B2 (en) 2010-04-26 2011-02-04 Slice retrieval in accordance with an access sequence in a dispersed storage network
US13/154,725 US10289688B2 (en) 2010-06-22 2011-06-07 Metadata access in a dispersed storage network
US14/447,890 US10360180B2 (en) 2005-09-30 2014-07-31 Digest listing decomposition
US14/454,013 US10154034B2 (en) 2010-04-26 2014-08-07 Cooperative data access request authorization in a dispersed storage network
US16/137,681 US10866754B2 (en) 2010-04-26 2018-09-21 Content archiving in a distributed storage network
US16/390,530 US11194662B2 (en) 2005-09-30 2019-04-22 Digest listing decomposition
US17/023,971 US11080138B1 (en) 2010-04-26 2020-09-17 Storing integrity information in a vast storage system
US17/362,251 US11340988B2 (en) 2005-09-30 2021-06-29 Generating integrity information in a vast storage system

Related Parent Applications (2)

Application Number Title Priority Date Filing Date
US16/390,530 Continuation-In-Part US11194662B2 (en) 2005-09-30 2019-04-22 Digest listing decomposition
US17/023,971 Continuation US11080138B1 (en) 2005-09-30 2020-09-17 Storing integrity information in a vast storage system

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/743,717 Division US11544146B2 (en) 2005-09-30 2022-05-13 Utilizing integrity information in a vast storage system

Publications (3)

Publication Number Publication Date
US20210326205A1 US20210326205A1 (en) 2021-10-21
US11340988B2 US11340988B2 (en) 2022-05-24
US20220179745A9 true US20220179745A9 (en) 2022-06-09

Family

ID=81652992

Family Applications (4)

Application Number Title Priority Date Filing Date
US17/362,251 Active US11340988B2 (en) 2005-09-30 2021-06-29 Generating integrity information in a vast storage system
US17/743,717 Active US11544146B2 (en) 2005-09-30 2022-05-13 Utilizing integrity information in a vast storage system
US18/059,833 Active US11755413B2 (en) 2005-09-30 2022-11-29 Utilizing integrity information to determine corruption in a vast storage system
US18/363,179 Pending US20230376380A1 (en) 2005-09-30 2023-08-01 Generating Multiple Sets of Integrity Information in a Vast Storage System

Family Applications After (3)

Application Number Title Priority Date Filing Date
US17/743,717 Active US11544146B2 (en) 2005-09-30 2022-05-13 Utilizing integrity information in a vast storage system
US18/059,833 Active US11755413B2 (en) 2005-09-30 2022-11-29 Utilizing integrity information to determine corruption in a vast storage system
US18/363,179 Pending US20230376380A1 (en) 2005-09-30 2023-08-01 Generating Multiple Sets of Integrity Information in a Vast Storage System

Country Status (1)

Country Link
US (4) US11340988B2 (en)

Family Cites Families (150)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4092732A (en) 1977-05-31 1978-05-30 International Business Machines Corporation System for recovering data stored in failed memory unit
US5485474A (en) 1988-02-25 1996-01-16 The President And Fellows Of Harvard College Scheme for information dispersal and reconstruction
US4961139A (en) * 1988-06-30 1990-10-02 Hewlett-Packard Company Data base management system for real-time applications
US5544347A (en) * 1990-09-24 1996-08-06 Emc Corporation Data storage system controlled remote data mirroring with respectively maintained data indices
US5404361A (en) * 1992-07-27 1995-04-04 Storage Technology Corporation Method and apparatus for ensuring data integrity in a dynamically mapped data storage subsystem
US5454101A (en) 1992-09-15 1995-09-26 Universal Firmware Industries, Ltd. Data storage system with set lists which contain elements associated with parents for defining a logical hierarchy and general record pointers identifying specific data sets
US5632012A (en) * 1993-11-24 1997-05-20 Storage Technology Corporation Disk scrubbing system
US5987622A (en) 1993-12-10 1999-11-16 Tm Patents, Lp Parallel computer system including parallel storage subsystem including facility for correction of data in the event of failure of a storage device in parallel storage subsystem
US5488702A (en) * 1994-04-26 1996-01-30 Unisys Corporation Data block check sequence generation and validation in a file cache system
US6175571B1 (en) 1994-07-22 2001-01-16 Network Peripherals, Inc. Distributed memory switching hub
US5848230A (en) 1995-05-25 1998-12-08 Tandem Computers Incorporated Continuously available computer memory systems
US5768623A (en) 1995-09-19 1998-06-16 International Business Machines Corporation System and method for sharing multiple storage arrays by dedicating adapters as primary controller and secondary controller for arrays reside in different host computers
US5774643A (en) 1995-10-13 1998-06-30 Digital Equipment Corporation Enhanced raid write hole protection and recovery
US5809285A (en) 1995-12-21 1998-09-15 Compaq Computer Corporation Computer system having a virtual drive array controller
US6012159A (en) 1996-01-17 2000-01-04 Kencast, Inc. Method and system for error-free data transfer
US5802364A (en) 1996-04-15 1998-09-01 Sun Microsystems, Inc. Metadevice driver rename/exchange technique for a computer system incorporating a plurality of independent device drivers
US5890156A (en) 1996-05-02 1999-03-30 Alcatel Usa, Inc. Distributed redundant database
US6058454A (en) 1997-06-09 2000-05-02 International Business Machines Corporation Method and system for automatically configuring redundant arrays of disk memory devices
US6088330A (en) 1997-09-09 2000-07-11 Bruck; Joshua Reliable array of distributed computing nodes
US5991414A (en) 1997-09-12 1999-11-23 International Business Machines Corporation Method and apparatus for the secure distributed storage and retrieval of information
US6272658B1 (en) 1997-10-27 2001-08-07 Kencast, Inc. Method and system for reliable broadcasting of data files and streams
US6052785A (en) 1997-11-21 2000-04-18 International Business Machines Corporation Multiple remote data access security mechanism for multitiered internet computer networks
JPH11161505A (en) 1997-12-01 1999-06-18 Matsushita Electric Ind Co Ltd Media send-out device
JPH11167443A (en) 1997-12-02 1999-06-22 Casio Comput Co Ltd Interface device
US6151659A (en) 1997-12-22 2000-11-21 Emc Corporation Distributed raid storage system
US6374336B1 (en) 1997-12-24 2002-04-16 Avid Technology, Inc. Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner
US6415373B1 (en) 1997-12-24 2002-07-02 Avid Technology, Inc. Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner
US6260120B1 (en) * 1998-06-29 2001-07-10 Emc Corporation Storage mapping and partitioning among multiple host processors in the presence of login state changes and host controller replacement
CA2341014A1 (en) 1998-08-19 2000-03-02 Alexander Roger Deas A system and method for defining transforms of memory device addresses
JP2000132902A (en) 1998-10-23 2000-05-12 Hitachi Electronics Eng Co Ltd Recording medium raid library device
US6356949B1 (en) 1999-01-29 2002-03-12 Intermec Ip Corp. Automatic data collection device that receives data output instruction from data consumer
US6609223B1 (en) 1999-04-06 2003-08-19 Kencast, Inc. Method for packet-level fec encoding, in which on a source packet-by-source packet basis, the error correction contributions of a source packet to a plurality of wildcard packets are computed, and the source packet is transmitted thereafter
US6571282B1 (en) 1999-08-31 2003-05-27 Accenture Llp Block-based communication in a communication services patterns environment
US6964008B1 (en) * 1999-11-12 2005-11-08 Maxtor Corporation Data checksum method and apparatus
US6779003B1 (en) 1999-12-16 2004-08-17 Livevault Corporation Systems and methods for backing up data files
US6826711B2 (en) 2000-02-18 2004-11-30 Avamar Technologies, Inc. System and method for data protection with multidimensional parity
US6718361B1 (en) 2000-04-07 2004-04-06 Network Appliance Inc. Method and apparatus for reliable and scalable distribution of data files in distributed networks
US6606629B1 (en) * 2000-05-17 2003-08-12 Lsi Logic Corporation Data structures containing sequence and revision number metadata used in mass storage data integrity-assuring technique
US6886020B1 (en) 2000-08-17 2005-04-26 Emc Corporation Method and apparatus for storage system metrics management and archive
ATE381191T1 (en) 2000-10-26 2007-12-15 Prismedia Networks Inc METHOD AND SYSTEM FOR MANAGING DISTRIBUTED CONTENT AND CORRESPONDING METADATA
US7146644B2 (en) 2000-11-13 2006-12-05 Digital Doors, Inc. Data security system and method responsive to electronic attacks
US9311499B2 (en) 2000-11-13 2016-04-12 Ron M. Redlich Data security system and with territorial, geographic and triggering event protocol
US7140044B2 (en) 2000-11-13 2006-11-21 Digital Doors, Inc. Data security system and method for separation of user communities
US8176563B2 (en) 2000-11-13 2012-05-08 DigitalDoors, Inc. Data security system and method with editor
US7103915B2 (en) 2000-11-13 2006-09-05 Digital Doors, Inc. Data security system and method
GB2369206B (en) 2000-11-18 2004-11-03 Ibm Method for rebuilding meta-data in a data storage system and a data storage system
US6785783B2 (en) 2000-11-30 2004-08-31 International Business Machines Corporation NUMA system with redundant main memory architecture
US7080101B1 (en) 2000-12-01 2006-07-18 Ncr Corp. Method and apparatus for partitioning data for storage in a database
US20020080888A1 (en) 2000-12-22 2002-06-27 Li Shu Message splitting and spatially diversified message routing for increasing transmission assurance and data security over distributed networks
US7246369B1 (en) * 2000-12-27 2007-07-17 Info Valve Computing, Inc. Broadband video distribution system using segments
US7788335B2 (en) 2001-01-11 2010-08-31 F5 Networks, Inc. Aggregated opportunistic lock and aggregated implicit lock management for locking aggregated files in a switched file system
US7512673B2 (en) 2001-01-11 2009-03-31 Attune Systems, Inc. Rule based aggregation of files and transactions in a switched file system
WO2002065275A1 (en) 2001-01-11 2002-08-22 Yottayotta, Inc. Storage virtualization system and methods
US20020174296A1 (en) 2001-01-29 2002-11-21 Ulrich Thomas R. Disk replacement via hot swapping with variable parity
US20020129230A1 (en) 2001-03-08 2002-09-12 Sun Microsystems, Inc. Method, System, and program for determining system configuration information
US20030037261A1 (en) 2001-03-26 2003-02-20 Ilumin Corporation Secured content delivery system and method
US6879596B1 (en) 2001-04-11 2005-04-12 Applied Micro Circuits Corporation System and method for systolic array sorting of information segments
EP1251649A2 (en) * 2001-04-19 2002-10-23 Matsushita Electric Industrial Co., Ltd. Television program distribution system
US7024609B2 (en) 2001-04-20 2006-04-04 Kencast, Inc. System for protecting the transmission of live data streams, and upon reception, for reconstructing the live data streams and recording them into files
US7062704B2 (en) * 2001-04-30 2006-06-13 Sun Microsystems, Inc. Storage array employing scrubbing operations using multiple levels of checksums
US6915473B2 (en) * 2001-05-14 2005-07-05 Interdigital Technology Corporation Method and system for implicit user equipment identification
US8275709B2 (en) 2001-05-31 2012-09-25 Contentguard Holdings, Inc. Digital rights management of content when content is a future live event
GB2377049A (en) 2001-06-30 2002-12-31 Hewlett Packard Co Billing for utilisation of a data storage array
US6944785B2 (en) 2001-07-23 2005-09-13 Network Appliance, Inc. High-availability cluster virtual server system
US7636724B2 (en) 2001-08-31 2009-12-22 Peerify Technologies LLC Data storage system and method by shredding and deshredding
US20030046587A1 (en) 2001-09-05 2003-03-06 Satyam Bheemarasetti Secure remote access using enterprise peer networks
US7024451B2 (en) 2001-11-05 2006-04-04 Hewlett-Packard Development Company, L.P. System and method for maintaining consistent independent server-side state among collaborating servers
US7003688B1 (en) 2001-11-15 2006-02-21 Xiotech Corporation System and method for a reserved memory area shared by all redundant storage controllers
US7171493B2 (en) 2001-12-19 2007-01-30 The Charles Stark Draper Laboratory Camouflage of network traffic to resist attack
US7315976B2 (en) * 2002-01-31 2008-01-01 Lsi Logic Corporation Method for using CRC as metadata to protect against drive anomaly errors in a storage array
US20050168460A1 (en) 2002-04-04 2005-08-04 Anshuman Razdan Three-dimensional digital library system
AU2003263800B2 (en) 2002-07-29 2008-08-21 Robert Halford Multi-dimensional data protection and mirroring method for micro level data
US7051155B2 (en) 2002-08-05 2006-05-23 Sun Microsystems, Inc. Method and system for striping data to accommodate integrity metadata
US7657008B2 (en) 2002-08-14 2010-02-02 At&T Intellectual Property I, L.P. Storage-enabled telecommunications network
US7149935B1 (en) * 2002-12-17 2006-12-12 Ncr Corp. Method and system for managing detected corruption in stored data
US20040122917A1 (en) 2002-12-18 2004-06-24 Menon Jaishankar Moothedath Distributed storage system for data-sharing among client computers running defferent operating system types
US7103811B2 (en) * 2002-12-23 2006-09-05 Sun Microsystems, Inc Mechanisms for detecting silent errors in streaming media devices
US8626820B1 (en) * 2003-01-21 2014-01-07 Peer Fusion, Inc. Peer to peer code generator and decoder for digital systems
CA2519116C (en) 2003-03-13 2012-11-13 Drm Technologies, Llc Secure streaming container
US7185144B2 (en) 2003-11-24 2007-02-27 Network Appliance, Inc. Semi-static distribution technique
US7461319B2 (en) * 2003-04-04 2008-12-02 Sun Microsystems, Inc. System and method for downloading files over a network with real time verification
GB0308264D0 (en) 2003-04-10 2003-05-14 Ibm Recovery from failures within data processing systems
GB0308262D0 (en) 2003-04-10 2003-05-14 Ibm Recovery from failures within data processing systems
US20070033430A1 (en) 2003-05-05 2007-02-08 Gene Itkis Data storage distribution and retrieval
US7415115B2 (en) 2003-05-14 2008-08-19 Broadcom Corporation Method and system for disaster recovery of data from a storage device
US7197617B2 (en) * 2003-05-29 2007-03-27 International Business Machines Corporation Process, apparatus, and system for storing data check information using standard sector data field sizes
US7028139B1 (en) * 2003-07-03 2006-04-11 Veritas Operating Corporation Application-assisted recovery from data corruption in parity RAID storage using successive re-reads
CN101566931B (en) 2003-08-14 2011-05-18 克姆佩棱特科技公司 Virtual disk drive system and method
US7483557B2 (en) 2003-09-30 2009-01-27 Kabushiki Kaisha Toshiba Medical imaging communication system, method and software
US7899059B2 (en) 2003-11-12 2011-03-01 Agere Systems Inc. Media delivery using quality of service differentiation within a media stream
US9401838B2 (en) * 2003-12-03 2016-07-26 Emc Corporation Network event capture and retention system
US8332483B2 (en) 2003-12-15 2012-12-11 International Business Machines Corporation Apparatus, system, and method for autonomic control of grid system resources
US7200691B2 (en) 2003-12-22 2007-04-03 National Instruments Corp. System and method for efficient DMA transfer and buffering of captured data events from a nondeterministic data bus
US7206899B2 (en) 2003-12-29 2007-04-17 Intel Corporation Method, system, and program for managing data transfer and construction
US7222133B1 (en) 2004-02-05 2007-05-22 Unisys Corporation Method for reducing database recovery time
US9229646B2 (en) * 2004-02-26 2016-01-05 Emc Corporation Methods and apparatus for increasing data storage capacity
US7636941B2 (en) 2004-03-10 2009-12-22 Microsoft Corporation Cross-domain authentication
US7240236B2 (en) 2004-03-23 2007-07-03 Archivas, Inc. Fixed content distributed data storage using permutation ring encoding
US7231578B2 (en) 2004-04-02 2007-06-12 Hitachi Global Storage Technologies Netherlands B.V. Techniques for detecting and correcting errors using multiple interleave erasure pointers
US7296180B1 (en) * 2004-06-30 2007-11-13 Sun Microsystems, Inc. Method for recovery of data
WO2006017160A2 (en) 2004-07-09 2006-02-16 Ade Corporation System and method for searching for patterns of semiconductor wafer features in semiconductor wafer data
US7681105B1 (en) * 2004-08-09 2010-03-16 Bakbone Software, Inc. Method for lock-free clustered erasure coding and recovery of data across a plurality of data stores in a network
JP4446839B2 (en) 2004-08-30 2010-04-07 株式会社日立製作所 Storage device and storage management device
US7500053B1 (en) 2004-11-05 2009-03-03 Commvvault Systems, Inc. Method and system for grouping storage system components
US7680771B2 (en) 2004-12-20 2010-03-16 International Business Machines Corporation Apparatus, system, and method for database provisioning
US7386758B2 (en) 2005-01-13 2008-06-10 Hitachi, Ltd. Method and apparatus for reconstructing data in object-based storage arrays
WO2006080910A1 (en) * 2005-01-24 2006-08-03 Thomson Licensing Video error detection technique using a crc parity code
US7672930B2 (en) 2005-04-05 2010-03-02 Wal-Mart Stores, Inc. System and methods for facilitating a linear grid database with data organization by dimension
US8266237B2 (en) * 2005-04-20 2012-09-11 Microsoft Corporation Systems and methods for providing distributed, decentralized data storage and retrieval
US7707483B2 (en) * 2005-05-25 2010-04-27 Intel Corporation Technique for performing cyclic redundancy code error detection
US8938591B2 (en) 2005-09-30 2015-01-20 Cleversafe, Inc. Dispersed storage processing unit and methods with data aggregation for use in a dispersed storage system
US7574570B2 (en) 2005-09-30 2009-08-11 Cleversafe Inc Billing system for information dispersal system
US7574579B2 (en) 2005-09-30 2009-08-11 Cleversafe, Inc. Metadata management system for an information dispersed storage system
US8209363B2 (en) 2007-10-09 2012-06-26 Cleversafe, Inc. File system adapted for use with a dispersed data storage network
US7962641B1 (en) 2005-09-30 2011-06-14 Cleversafe, Inc. Streaming media software interface to a dispersed data storage network
US8555109B2 (en) 2009-07-30 2013-10-08 Cleversafe, Inc. Method and apparatus for distributed storage integrity processing
US9063881B2 (en) * 2010-04-26 2015-06-23 Cleversafe, Inc. Slice retrieval in accordance with an access sequence in a dispersed storage network
US8285878B2 (en) 2007-10-09 2012-10-09 Cleversafe, Inc. Block based access to a dispersed data storage network
US8880799B2 (en) * 2005-09-30 2014-11-04 Cleversafe, Inc. Rebuilding data on a dispersed storage network
US8171101B2 (en) * 2005-09-30 2012-05-01 Cleversafe, Inc. Smart access to a dispersed data storage network
US9996413B2 (en) * 2007-10-09 2018-06-12 International Business Machines Corporation Ensuring data integrity on a dispersed storage grid
US7546427B2 (en) 2005-09-30 2009-06-09 Cleversafe, Inc. System for rebuilding dispersed data
US7904475B2 (en) * 2007-10-09 2011-03-08 Cleversafe, Inc. Virtualized data storage vaults on a dispersed data storage network
US7953937B2 (en) 2005-09-30 2011-05-31 Cleversafe, Inc. Systems, methods, and apparatus for subdividing data for storage in a dispersed data storage grid
US7831996B2 (en) 2005-12-28 2010-11-09 Foundry Networks, Llc Authentication techniques
GB2435333B (en) 2006-02-01 2010-07-14 Hewlett Packard Development Co Data transfer device
JP4718340B2 (en) 2006-02-02 2011-07-06 富士通株式会社 Storage system, control method and program
US20070214285A1 (en) 2006-03-08 2007-09-13 Omneon Video Networks Gateway server
US7680843B1 (en) 2006-09-26 2010-03-16 Symantec Operating Corporation Method and system to offload archiving process to a secondary system
US8369248B2 (en) * 2007-02-23 2013-02-05 Konica Minolta Holdings, Inc. Information transmitting and receiving system, information transmitting device, and information receiving device
US8234545B2 (en) 2007-05-12 2012-07-31 Apple Inc. Data storage with incremental redundancy
CN100484069C (en) * 2007-05-21 2009-04-29 华为技术有限公司 File data distributing method and relative device
US8082390B1 (en) * 2007-06-20 2011-12-20 Emc Corporation Techniques for representing and storing RAID group consistency information
US7945639B2 (en) 2007-06-27 2011-05-17 Microsoft Corporation Processing write requests with server having global knowledge
US7856437B2 (en) 2007-07-31 2010-12-21 Hewlett-Packard Development Company, L.P. Storing nodes representing respective chunks of files in a data store
US8504904B2 (en) * 2008-01-16 2013-08-06 Hitachi Data Systems Engineering UK Limited Validating objects in a data storage system
US20090150631A1 (en) 2007-12-06 2009-06-11 Clifton Labs, Inc. Self-protecting storage device
US8515909B2 (en) * 2008-04-29 2013-08-20 International Business Machines Corporation Enhanced method and system for assuring integrity of deduplicated data
US8108353B2 (en) * 2008-06-11 2012-01-31 International Business Machines Corporation Method and apparatus for block size optimization in de-duplication
US8195540B2 (en) 2008-07-25 2012-06-05 Mongonet Sponsored facsimile to e-mail transmission methods and apparatus
US8380533B2 (en) 2008-11-19 2013-02-19 DR Systems Inc. System and method of providing dynamic and customizable medical examination forms
WO2010106578A1 (en) 2009-03-19 2010-09-23 Hitachi, Ltd. E-mail archiving system, method, and program
US10104045B2 (en) * 2009-04-20 2018-10-16 International Business Machines Corporation Verifying data security in a dispersed storage network
US9411810B2 (en) * 2009-08-27 2016-08-09 International Business Machines Corporation Method and apparatus for identifying data inconsistency in a dispersed storage network
US8572282B2 (en) 2009-10-30 2013-10-29 Cleversafe, Inc. Router assisted dispersed storage network method and apparatus
US20110107410A1 (en) 2009-11-02 2011-05-05 At&T Intellectual Property I,L.P. Methods, systems, and computer program products for controlling server access using an authentication server
US8688907B2 (en) 2009-11-25 2014-04-01 Cleversafe, Inc. Large scale subscription based dispersed storage network
US8276148B2 (en) 2009-12-04 2012-09-25 International Business Machines Corporation Continuous optimization of archive management scheduling by use of integrated content-resource analytic model
US8626871B2 (en) 2010-05-19 2014-01-07 Cleversafe, Inc. Accessing a global vault in multiple dispersed storage networks
CN102316127B (en) 2010-06-29 2014-04-23 阿尔卡特朗讯 Document transmission method based on distributed storage in wireless communication system

Also Published As

Publication number Publication date
US20230091301A1 (en) 2023-03-23
US20220269562A1 (en) 2022-08-25
US11755413B2 (en) 2023-09-12
US20230376380A1 (en) 2023-11-23
US11544146B2 (en) 2023-01-03
US11340988B2 (en) 2022-05-24
US20210326205A1 (en) 2021-10-21

Similar Documents

Publication Publication Date Title
US10656871B2 (en) Expanding slice count in response to low-level failures
US10489070B2 (en) Proxying read requests when performance or availability failure is anticipated
US9817597B2 (en) Using temporary write locations for increased power efficiency
US10409514B2 (en) IP multicast message transmission for event notifications
US10296404B2 (en) Determining slices used in a reconstruction
US10592335B2 (en) Using data object copies to improve the performance of a distributed storage network
US10505915B2 (en) Determining whether to compress a data segment in a dispersed storage network
US20190026102A1 (en) Upgrading devices in a dispersed storage network
US10120574B2 (en) Reversible data modifications within DS units
US10007575B2 (en) Alternative multiple memory format storage in a storage network
US20220365687A1 (en) Selecting A Processing Unit In Accordance With A Customizable Data Processing Plan
US20190026041A1 (en) Shutting down storage units or drives when below threshold in a distributed storage system
US10146645B2 (en) Multiple memory format storage in a storage network
US10866754B2 (en) Content archiving in a distributed storage network
US20210326205A1 (en) Generating Integrity Information in a Vast Storage System
US20190056996A1 (en) Managing unavailable storage in a dispersed storage network
US11080138B1 (en) Storing integrity information in a vast storage system
US10956292B1 (en) Utilizing integrity information for data retrieval in a vast storage system
US10922179B2 (en) Post rebuild verification
US10802763B2 (en) Remote storage verification
US20190042370A1 (en) Alternative storage location protocol for a distributed storage network
US20170322734A1 (en) Using locks to prevent multiple rebuilds of the same source

Legal Events

Date Code Title Description
FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

AS Assignment

Owner name: PURE STORAGE, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GRUBE, GARY W.;MARKISON, TIMOTHY W.;REEL/FRAME:056717/0637

Effective date: 20200917

STPP Information on status: patent application and granting procedure in general

Free format text: SPECIAL NEW

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

AS Assignment

Owner name: PURE STORAGE, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VAS, SEBASTIEN;MARK, ZACHARY J.;RESCH, JASON K.;SIGNING DATES FROM 20220125 TO 20220203;REEL/FRAME:058991/0001

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

FEPP Fee payment procedure

Free format text: PETITION RELATED TO MAINTENANCE FEES GRANTED (ORIGINAL EVENT CODE: PTGR); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STPP Information on status: patent application and granting procedure in general

Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS

STPP Information on status: patent application and granting procedure in general

Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED

STCF Information on status: patent grant

Free format text: PATENTED CASE