US20170249212A1 - Maximizing redundant information in a mirrored vault - Google Patents
Maximizing redundant information in a mirrored vault Download PDFInfo
- Publication number
- US20170249212A1 US20170249212A1 US15/404,560 US201715404560A US2017249212A1 US 20170249212 A1 US20170249212 A1 US 20170249212A1 US 201715404560 A US201715404560 A US 201715404560A US 2017249212 A1 US2017249212 A1 US 2017249212A1
- Authority
- US
- United States
- Prior art keywords
- encoded data
- data slices
- sets
- slices
- encoded
- 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.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0766—Error or fault reporting or storing
- G06F11/0781—Error filtering or prioritizing based on a policy defined by the user or on a policy defined by a hardware/software module, e.g. according to a severity level
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1076—Parity data used in redundant arrays of independent storages, e.g. in RAID systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0706—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
- G06F11/0709—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0706—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
- G06F11/0727—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in a storage system, e.g. in a DASD or network based storage system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0751—Error or fault detection not based on redundancy
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/079—Root cause analysis, i.e. error or fault diagnosis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0793—Remedial or corrective actions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
- G06F11/1451—Management of the data involved in backup or backup restore by selection of backup contents
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/16—Error detection or correction of the data by redundancy in hardware
- G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
- G06F11/2053—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant
- G06F11/2094—Redundant storage or storage space
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
- G06F11/3034—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system component is a storage system, e.g. DASD based or network based
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3051—Monitoring arrangements for monitoring the configuration of the computing system or of the computing system component, e.g. monitoring the presence of processing resources, peripherals, I/O links, software programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3055—Monitoring arrangements for monitoring the status of the computing system or of the computing system component, e.g. monitoring if the computing system is on, off, available, not available
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/32—Monitoring with visual or acoustical indication of the functioning of the machine
- G06F11/324—Display of status information
- G06F11/327—Alarm or error message display
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/38—Information transfer, e.g. on bus
- G06F13/40—Bus structure
- G06F13/4004—Coupling between buses
- G06F13/4022—Coupling between buses using switching circuits, e.g. switching matrix, connection or expansion network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/38—Information transfer, e.g. on bus
- G06F13/42—Bus transfer protocol, e.g. handshake; Synchronisation
- G06F13/4282—Bus transfer protocol, e.g. handshake; Synchronisation on a serial bus, e.g. I2C bus, SPI bus
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
- G06F3/0605—Improving or facilitating administration, e.g. storage management by facilitating the interaction with a user or administrator
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
- G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/062—Securing storage systems
- G06F3/0623—Securing storage systems in relation to content
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0644—Management of space entities, e.g. partitions, extents, pools
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0653—Monitoring storage devices or systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
- G06F3/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
- G06N3/084—Backpropagation, e.g. using gradient descent
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/10—Interfaces, programming languages or software development kits, e.g. for simulating neural networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063116—Schedule adjustment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/20—Administration of product repair or maintenance
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error 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/13—Linear codes
- H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
- H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
- H03M13/1515—Reed-Solomon codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, 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/29—Coding, 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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2906—Coding, 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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
- H03M13/2909—Product codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/3761—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/615—Use of computational or mathematical techniques
- H03M13/616—Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
- H04L63/061—Network architectures or network communication protocols for network security for supporting key management in a packet data network for key exchange, e.g. in peer-to-peer networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
- H04L63/101—Access control lists [ACL]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0894—Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/14—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using a plurality of keys or algorithms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
- H04L9/3242—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- G06F2201/84—Using snapshots, i.e. a logical point-in-time copy of the data
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 dispersed storage network (DSN)in accordance with the present invention.
- FIG. 9A is a flowchart of an example method of storing 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 & 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 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 DSTN 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 DSTN memory 22 for a user device, a group of devices, or for public access and establish
- 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 DSN 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 DSN managing unit 18 creates billing information for a particular user, a user group, a vault access, public vault access, etc. For instance, the DSTN 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 per-access billing information. In another instance, the DSTN 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 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 DSTN 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 (TO) 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.
- a processing module 50 a memory controller 52 , main memory 54 , a video graphics processing unit 55 , an input/output (TO) 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.
- a processing module 50 includes a memory controller 52 , main memory 54 , a video graphics processing unit 55 , an
- 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 60 is shown in FIG. 6 .
- the slice name (SN) 60 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.
- a mirrored vault configuration is one in which at least two vaults or two DSN memories are setup to store slices from the same data.
- One approach is to store two sets of slices which are each produced using the same rows of an encoding matrix.
- IDA information dispersal algorithm
- a DS processing unit writing to a mirrored vault configuration may choose not to use the same matrix for both (or all) sides of the mirror, but instead to generate the slices for the different vaults differently.
- one of the two vaults may be designed to hold slices 1 - 12 , while the other stores slices 13 - 24 .
- This can be done by extending the encoding matrix to have IDA width additional rows for each additional instance in the mirror configuration. If there were additional mirrored vaults (i.e., N additional vaults), such as a third vault in this example, it would store slices 25 - 36 . In this way, redundant information stored, and by extension, reliability are maximized.
- Slices from various mirror instances may all be used together in rebuilding attempts, and so long as at least IDA threshold slices exist across mirror instances, the source will be restorable.
- FIG. 9 is a schematic block diagram of another embodiment of a dispersed storage network (DSN) that includes a first set of storage units A 1 -Al 2 , a second set of storage units B 1 -B 24 , the network 24 of FIG. 1 , and the distributed storage and task (DST) processing unit 16 (computing unit) of FIG. 1 .
- Each storage unit may be implemented utilizing the DST execution unit 36 (storage unit) of FIG. 1 .
- the DST processing unit 16 includes the DST client modules A-B. Alternatively, the DST processing unit 16 includes one DST client module. Each DST client module may be implemented utilizing the DST client module 34 of FIG. 1 .
- the DSN functions to store data.
- DST client module A dispersed storage error encodes data for storage utilizing a first encoding matrix to produce a first plurality of sets of encoded data slices, where each set of encoded data slices of the first plurality sets of encoded data slices includes a first IDA width number of encoded data slices. For example, each set of encoded data slices includes 12 encoded data slices when the IDA width is 12 .
- the DST client module A divides the data 1 into a plurality of data segments, and for each data segment, dispersed storage error encodes the data segment utilizing an encoding matrix A (e.g., 12 rows) to produce a set of encoded data slices, i.e., slices 1 - 12 .
- an encoding matrix A e.g., 12 rows
- the DST client module B dispersed storage error encodes the data for storage utilizing a second encoding matrix to produce extension slices of a second plurality of sets of encoded data slices, where each set of encoded data slices of the second plurality of sets of encoded data slices includes a second IDA width number of encoded data slices.
- the second IDA width number is the same, smaller or larger than the first IDA width number.
- the DST client module B dispersed storage error encodes the data segment utilizing an encoding matrix A′ (e.g., an extension matrix of 12 more rows) to produce corresponding extension encoded data slices, i.e., slices 13 - 24 to create the second plurality of sets of encoded data slices 13 - 24 .
- an encoding matrix A′ e.g., an extension matrix of 12 more rows
- the second and third vaults can be stored in separate portions of the same set of storage units (storage units B) or be placed in multiple storage sets (e.g., storage units B and storage units C (not shown)), etc.
- the DST client module A sends, via the network 24 , the first plurality of encoded data slices to the first set of storage units for storage.
- the DST client module B sends, via the network 24 , the second plurality of encoded data slices to the second set of storage units for storage.
- the DST processing module 16 retrieves at least a decode threshold number of encoded data slices from either set of storage units to enable recovery the data.
- a decode threshold number of encoded data slices is a minimum number of encoded data slices of each set of encoded data slices required to recover the data.
- FIG. 9A is a flowchart illustrating an example of is a flowchart illustrating an example of storing data.
- a method is presented for use in conjunction with one or more functions and features described in conjunction with FIGS. 1-2, 3-8 , and also FIG. 9 .
- the method includes a step 902 where a processing module (e.g., of a distributed storage and task (DST) processing unit) dispersed storage error encodes data for storage utilizing an encoding matrix to produce a first plurality of sets of encoded data slices.
- a processing module e.g., of a distributed storage and task (DST) processing unit
- DST distributed storage and task
- the processing module divides the data into a plurality of data segments, and for each data segment, dispersed storage error encodes the data segment utilizing an encoding matrix to produce a set of encoded data slices, i.e., slices 1 - 12 .
- the method continues at step 904 where the processing module dispersed storage error encodes the data utilizing an extension encoding matrix to produce a plurality of groups of extension encoded data slices. For example, for each data segment, the processing module disperse storage error encodes the data segment utilizing the extension encoding matrix to produce corresponding extension data slices, i.e., slices 13 - 24 .
- step 906 the processing module sends the first plurality of sets of encoded data slices to a first set of storage units for storage. For example, the processing module identifies the first set of storage units, generates at least one set of write slice requests to include the first plurality of sets of encoded data slices, and sends, the at least one set of write slice requests to the identified first set of storage units.
- step 908 the processing module sends the second plurality of sets of encoded data slices to a second set of storage units for storage.
- the processing module identifies the second set of storage units, generates at least one set of additional write slice requests to include the second plurality of sets of encoded data slices, and sends the at least one set of additional write slice requests to the identified second set of storage units.
- the method continues at step 910 where the processing module recovers at least a decode threshold number of encoded data slices of either of the plurality of sets of encoded data slices. For example, the processing module obtains a decode threshold number of encoded data slices for each set of encoded data slices from at least one of the storage sets, and dispersed storage error encodes each decode threshold number of encoded data slices to reproduce the data.
- At least one memory section e.g., a non-transitory computer readable storage medium
- that stores operational instructions can, when executed by one or more processing modules of one or more computing devices of the dispersed storage network (DSN), cause the one or more computing devices to perform any or all of the method steps described above.
- the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items. Such an industry-accepted tolerance ranges from less than one percent to fifty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude 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.
- 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, 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, 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, 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, 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, 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 other routines.
- start indicates the beginning of the first step presented and may be preceded by other activities not specifically shown.
- continue indicates 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.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Quality & Reliability (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Computer Security & Cryptography (AREA)
- Human Computer Interaction (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computer Hardware Design (AREA)
- Probability & Statistics with Applications (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Biomedical Technology (AREA)
- Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Evolutionary Computation (AREA)
- Pure & Applied Mathematics (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Molecular Biology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Artificial Intelligence (AREA)
- Biophysics (AREA)
- General Health & Medical Sciences (AREA)
- Algebra (AREA)
- Computational Mathematics (AREA)
Abstract
Description
- The present U.S. Utility Patent Application claims priority pursuant to 35 U.S.C. §119(e) to U.S. Provisional Application No. 62/301,214, entitled “ENHANCING PERFORMANCE OF A DISPERSED STORAGE NETWORK,” filed 2/29/2016, which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility Patent Application for all purposes.
- Not applicable.
- Not applicable.
- Technical Field of the Invention
- 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.
-
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 dispersed storage network (DSN)in accordance with the present invention; and -
FIG. 9A is a flowchart of an example method of storing 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 managingunit 18, anintegrity processing unit 20, and aDSN memory 22. The components of the DSN 10 are coupled to anetwork 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 ofstorage 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 DSNmemory 22 includes eightstorage units 36, each storage unit is located at a different site. As another example, if the DSNmemory 22 includes eightstorage units 36, all eight storage units are located at the same site. As yet another example, if the DSNmemory 22 includes eightstorage 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 aDSN memory 22 may include more or less than eightstorage units 36. Further note that eachstorage unit 36 includes a computing core (as shown inFIG. 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 theintegrity processing unit 20 include acomputing 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 managingunit 18 and theintegrity 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 thestorage units 36. - Each
interface network 24 indirectly and/or directly. For example,interface 30 supports a communication link (e.g., wired, wireless, direct, via a LAN, via thenetwork 24, etc.) betweencomputing devices 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) betweencomputing devices 12 & 16 and theDSN memory 22. As yet another example,interface 33 supports a communication link for each of the managingunit 18 and theintegrity processing unit 20 to thenetwork 24. -
Computing devices client module 34, which enables the computing device to dispersed storage error encode and decode data as subsequently described with reference to one or more ofFIGS. 3-8 . In this example embodiment,computing device 16 functions as a dispersed storage processing agent forcomputing device 14. In this role,computing device 16 dispersed storage error encodes and decodes data on behalf ofcomputing 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 managingunit 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 managingunit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within theDSTN 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 managingunit 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 theDSN memory 22, a computing device 12-16, the managingunit 18, and/or theintegrity processing unit 20. - The DSN managing
unit 18 creates and stores user profile information (e.g., an access control list (ACL)) in local memory and/or within memory of theDSN 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 DSN managing
unit 18 creates billing information for a particular user, a user group, a vault access, public vault access, etc. For instance, the DSTN managingunit 18 tracks the number of times a user accesses a non-public vault and/or public vaults, which can be used to generate per-access billing information. In another instance, the DSTN managingunit 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 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 theDSN 10, and/or establishing authentication credentials for thestorage 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 theDSN 10. Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of theDSN 10. - The
integrity processing unit 20 performs rebuilding of ‘bad’ or missing encoded data slices. At a high level, theintegrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from theDSN 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 theDSTN memory 22. -
FIG. 2 is a schematic block diagram of an embodiment of acomputing core 26 that includes aprocessing module 50, amemory controller 52,main memory 54, a videographics processing unit 55, an input/output (TO)controller 56, a peripheral component interconnect (PCI)interface 58, anIO interface module 60, at least one IOdevice 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, anetwork interface module 70, aflash 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 ofFIG. 1 . Note that the IOdevice 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 acomputing device - 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 inFIG. 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, thecomputing device - The
computing device 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 aslice name 60 is shown inFIG. 6 . As shown, the slice name (SN) 60 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 theDSN memory 22. - As a result of encoding, the
computing device -
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 ofFIG. 4 . In this example, thecomputing device - 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 ofFIG. 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 includesrows rows - A mirrored vault configuration is one in which at least two vaults or two DSN memories are setup to store slices from the same data. One approach is to store two sets of slices which are each produced using the same rows of an encoding matrix. However, such a system would still suffer data loss if both slides of the mirror were below IDA (information dispersal algorithm) threshold for some data source. To overcome this, in one embodiment, a DS processing unit writing to a mirrored vault configuration may choose not to use the same matrix for both (or all) sides of the mirror, but instead to generate the slices for the different vaults differently. For example, in a 10-of-12 IDA, instead of generating identical sets of slices (1-12) for each mirror, one of the two vaults may be designed to hold slices 1-12, while the other stores slices 13-24. This can be done by extending the encoding matrix to have IDA width additional rows for each additional instance in the mirror configuration. If there were additional mirrored vaults (i.e., N additional vaults), such as a third vault in this example, it would store slices 25-36. In this way, redundant information stored, and by extension, reliability are maximized. Slices from various mirror instances may all be used together in rebuilding attempts, and so long as at least IDA threshold slices exist across mirror instances, the source will be restorable.
-
FIG. 9 is a schematic block diagram of another embodiment of a dispersed storage network (DSN) that includes a first set of storage units A1-Al2, a second set of storage units B1-B24, thenetwork 24 ofFIG. 1 , and the distributed storage and task (DST) processing unit 16 (computing unit) ofFIG. 1 . Each storage unit may be implemented utilizing the DST execution unit 36 (storage unit) ofFIG. 1 . TheDST processing unit 16 includes the DST client modules A-B. Alternatively, theDST processing unit 16 includes one DST client module. Each DST client module may be implemented utilizing theDST client module 34 ofFIG. 1 . The DSN functions to store data. - In an example of the storing of the data, DST client module A dispersed storage error encodes data for storage utilizing a first encoding matrix to produce a first plurality of sets of encoded data slices, where each set of encoded data slices of the first plurality sets of encoded data slices includes a first IDA width number of encoded data slices. For example, each set of encoded data slices includes 12 encoded data slices when the IDA width is 12. For example, the DST client module A divides the
data 1 into a plurality of data segments, and for each data segment, dispersed storage error encodes the data segment utilizing an encoding matrix A (e.g., 12 rows) to produce a set of encoded data slices, i.e., slices 1-12. - When the data is to be mirror stored in at least two sets of storage units, the DST client module B dispersed storage error encodes the data for storage utilizing a second encoding matrix to produce extension slices of a second plurality of sets of encoded data slices, where each set of encoded data slices of the second plurality of sets of encoded data slices includes a second IDA width number of encoded data slices. In alternative embodiments, the second IDA width number is the same, smaller or larger than the first IDA width number. For example, for each data segment, the DST client module B dispersed storage error encodes the data segment utilizing an encoding matrix A′ (e.g., an extension matrix of 12 more rows) to produce corresponding extension encoded data slices, i.e., slices 13-24 to create the second plurality of sets of encoded data slices 13-24. If there were a third vault (produced by DST client module C (not shown)) in this example, it would store slices 25-36 (as shown). In this way, redundant information stored, and by extension, reliability is maximized. In addition, the second and third vaults can be stored in separate portions of the same set of storage units (storage units B) or be placed in multiple storage sets (e.g., storage units B and storage units C (not shown)), etc.
- With the data encoded, the DST client module A sends, via the
network 24, the first plurality of encoded data slices to the first set of storage units for storage. The DST client module B sends, via thenetwork 24, the second plurality of encoded data slices to the second set of storage units for storage. - When retrieving the data, for each data segment, the
DST processing module 16 retrieves at least a decode threshold number of encoded data slices from either set of storage units to enable recovery the data. A decode threshold number of encoded data slices is a minimum number of encoded data slices of each set of encoded data slices required to recover the data. -
FIG. 9A is a flowchart illustrating an example of is a flowchart illustrating an example of storing data. In particular, a method is presented for use in conjunction with one or more functions and features described in conjunction withFIGS. 1-2, 3-8 , and alsoFIG. 9 . - The method includes a
step 902 where a processing module (e.g., of a distributed storage and task (DST) processing unit) dispersed storage error encodes data for storage utilizing an encoding matrix to produce a first plurality of sets of encoded data slices. For example, the processing module divides the data into a plurality of data segments, and for each data segment, dispersed storage error encodes the data segment utilizing an encoding matrix to produce a set of encoded data slices, i.e., slices 1-12. - When the data is to be mirror stored, the method continues at
step 904 where the processing module dispersed storage error encodes the data utilizing an extension encoding matrix to produce a plurality of groups of extension encoded data slices. For example, for each data segment, the processing module disperse storage error encodes the data segment utilizing the extension encoding matrix to produce corresponding extension data slices, i.e., slices 13-24. - The method continues at
step 906 where the processing module sends the first plurality of sets of encoded data slices to a first set of storage units for storage. For example, the processing module identifies the first set of storage units, generates at least one set of write slice requests to include the first plurality of sets of encoded data slices, and sends, the at least one set of write slice requests to the identified first set of storage units. - The method continues at
step 908 where the processing module sends the second plurality of sets of encoded data slices to a second set of storage units for storage. For example the processing module identifies the second set of storage units, generates at least one set of additional write slice requests to include the second plurality of sets of encoded data slices, and sends the at least one set of additional write slice requests to the identified second set of storage units. - When retrieving the data, for each set of encoded data slices, the method continues at
step 910 where the processing module recovers at least a decode threshold number of encoded data slices of either of the plurality of sets of encoded data slices. For example, the processing module obtains a decode threshold number of encoded data slices for each set of encoded data slices from at least one of the storage sets, and dispersed storage error encodes each decode threshold number of encoded data slices to reproduce the data. - The method described above in conjunction with the processing module can alternatively be performed by other modules of the dispersed storage network or by other computing devices. In addition, at least one memory section (e.g., a non-transitory computer readable storage medium) that stores operational instructions can, when executed by one or more processing modules of one or more computing devices of the dispersed storage network (DSN), cause the one or more computing devices to perform any or all of the method steps described above.
- 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, 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. Such an industry-accepted tolerance ranges from less than one percent to fifty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude 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 thansignal 2, a favorable comparison may be achieved when the magnitude ofsignal 1 is greater than that ofsignal 2 or when the magnitude ofsignal 2 is less than that ofsignal 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 also be used herein, the terms “processing module”, “processing circuit”, “processor”, 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, 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, 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, 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, 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, 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 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)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/404,560 US20170249212A1 (en) | 2016-02-29 | 2017-01-12 | Maximizing redundant information in a mirrored vault |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201662301214P | 2016-02-29 | 2016-02-29 | |
US15/404,560 US20170249212A1 (en) | 2016-02-29 | 2017-01-12 | Maximizing redundant information in a mirrored vault |
Publications (1)
Publication Number | Publication Date |
---|---|
US20170249212A1 true US20170249212A1 (en) | 2017-08-31 |
Family
ID=59678482
Family Applications (13)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/398,540 Active US10089178B2 (en) | 2016-02-29 | 2017-01-04 | Developing an accurate dispersed storage network memory performance model through training |
US15/401,377 Abandoned US20170249228A1 (en) | 2016-02-29 | 2017-01-09 | Persistent device fault indicators |
US15/402,378 Active 2037-05-21 US10248505B2 (en) | 2016-02-29 | 2017-01-10 | Issue escalation by management unit |
US15/403,425 Active 2037-11-09 US10476849B2 (en) | 2016-02-29 | 2017-01-11 | Monitoring and alerting for improper memory device replacement |
US15/404,560 Abandoned US20170249212A1 (en) | 2016-02-29 | 2017-01-12 | Maximizing redundant information in a mirrored vault |
US15/410,329 Expired - Fee Related US10326740B2 (en) | 2016-02-29 | 2017-01-19 | Efficient secret-key encrypted secure slice |
US15/425,553 Expired - Fee Related US10120757B2 (en) | 2016-02-29 | 2017-02-06 | Prioritizing dispersed storage network memory operations during a critical juncture |
US15/426,380 Expired - Fee Related US10678622B2 (en) | 2016-02-29 | 2017-02-07 | Optimizing and scheduling maintenance tasks in a dispersed storage network |
US15/439,092 Active 2038-03-19 US10824495B2 (en) | 2016-02-29 | 2017-02-22 | Cryptographic key storage in a dispersed storage network |
US16/019,505 Active 2037-03-02 US10673828B2 (en) | 2016-02-29 | 2018-06-26 | Developing an accurate dispersed storage network memory performance model through training |
US16/857,719 Active US11204822B1 (en) | 2016-02-29 | 2020-04-24 | Distributed storage network (DSN) configuration adaptation based on estimated future loading |
US17/538,771 Active US11704184B2 (en) | 2016-02-29 | 2021-11-30 | Storage network with enhanced data access performance |
US18/331,283 Active US12026044B2 (en) | 2016-02-29 | 2023-06-08 | Creating and using virtual memory blocks in a storage network |
Family Applications Before (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/398,540 Active US10089178B2 (en) | 2016-02-29 | 2017-01-04 | Developing an accurate dispersed storage network memory performance model through training |
US15/401,377 Abandoned US20170249228A1 (en) | 2016-02-29 | 2017-01-09 | Persistent device fault indicators |
US15/402,378 Active 2037-05-21 US10248505B2 (en) | 2016-02-29 | 2017-01-10 | Issue escalation by management unit |
US15/403,425 Active 2037-11-09 US10476849B2 (en) | 2016-02-29 | 2017-01-11 | Monitoring and alerting for improper memory device replacement |
Family Applications After (8)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/410,329 Expired - Fee Related US10326740B2 (en) | 2016-02-29 | 2017-01-19 | Efficient secret-key encrypted secure slice |
US15/425,553 Expired - Fee Related US10120757B2 (en) | 2016-02-29 | 2017-02-06 | Prioritizing dispersed storage network memory operations during a critical juncture |
US15/426,380 Expired - Fee Related US10678622B2 (en) | 2016-02-29 | 2017-02-07 | Optimizing and scheduling maintenance tasks in a dispersed storage network |
US15/439,092 Active 2038-03-19 US10824495B2 (en) | 2016-02-29 | 2017-02-22 | Cryptographic key storage in a dispersed storage network |
US16/019,505 Active 2037-03-02 US10673828B2 (en) | 2016-02-29 | 2018-06-26 | Developing an accurate dispersed storage network memory performance model through training |
US16/857,719 Active US11204822B1 (en) | 2016-02-29 | 2020-04-24 | Distributed storage network (DSN) configuration adaptation based on estimated future loading |
US17/538,771 Active US11704184B2 (en) | 2016-02-29 | 2021-11-30 | Storage network with enhanced data access performance |
US18/331,283 Active US12026044B2 (en) | 2016-02-29 | 2023-06-08 | Creating and using virtual memory blocks in a storage network |
Country Status (4)
Country | Link |
---|---|
US (13) | US10089178B2 (en) |
CN (1) | CN108701197A (en) |
DE (1) | DE112017000220T5 (en) |
WO (1) | WO2017149410A1 (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108388748A (en) * | 2018-03-12 | 2018-08-10 | 北京理工大学 | Method is discontinuously calculated in a kind of detonation numerical simulation serial program |
CN108459922A (en) * | 2018-03-12 | 2018-08-28 | 北京理工大学 | Method is discontinuously calculated in a kind of detonation numerical simulation concurrent program |
US11233643B1 (en) * | 2009-04-20 | 2022-01-25 | Pure Storage, Inc. | Distributed data storage system data decoding and decryption |
US11991280B2 (en) | 2009-04-20 | 2024-05-21 | Pure Storage, Inc. | Randomized transforms in a dispersed data storage system |
Families Citing this family (54)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10650169B2 (en) * | 2015-09-14 | 2020-05-12 | Hewlett Packard Enterprise Development Lp | Secure memory systems |
US10277490B2 (en) * | 2016-07-19 | 2019-04-30 | International Business Machines Corporation | Monitoring inter-site bandwidth for rebuilding |
EP3520038A4 (en) * | 2016-09-28 | 2020-06-03 | D5A1 Llc | Learning coach for machine learning system |
US10262751B2 (en) * | 2016-09-29 | 2019-04-16 | Intel Corporation | Multi-dimensional optimization of electrical parameters for memory training |
US10481977B2 (en) * | 2016-10-27 | 2019-11-19 | International Business Machines Corporation | Dispersed storage of error encoded data objects having multiple resolutions |
US11080600B2 (en) * | 2017-02-10 | 2021-08-03 | Synaptics Incorporated | Recurrent neural network based acoustic event classification using complement rule |
US11853884B2 (en) * | 2017-02-10 | 2023-12-26 | Synaptics Incorporated | Many or one detection classification systems and methods |
US11087213B2 (en) * | 2017-02-10 | 2021-08-10 | Synaptics Incorporated | Binary and multi-class classification systems and methods using one spike connectionist temporal classification |
US11100932B2 (en) * | 2017-02-10 | 2021-08-24 | Synaptics Incorporated | Robust start-end point detection algorithm using neural network |
US10762417B2 (en) * | 2017-02-10 | 2020-09-01 | Synaptics Incorporated | Efficient connectionist temporal classification for binary classification |
US10762891B2 (en) * | 2017-02-10 | 2020-09-01 | Synaptics Incorporated | Binary and multi-class classification systems and methods using connectionist temporal classification |
CN108427615B (en) * | 2017-02-13 | 2020-11-27 | 腾讯科技(深圳)有限公司 | Message monitoring method and device |
US10762427B2 (en) * | 2017-03-01 | 2020-09-01 | Synaptics Incorporated | Connectionist temporal classification using segmented labeled sequence data |
US10437691B1 (en) * | 2017-03-29 | 2019-10-08 | Veritas Technologies Llc | Systems and methods for caching in an erasure-coded system |
JP6959155B2 (en) * | 2017-05-15 | 2021-11-02 | パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカPanasonic Intellectual Property Corporation of America | Verification method, verification device and program |
US10379979B2 (en) * | 2017-05-31 | 2019-08-13 | Western Digital Technologies, Inc. | Power fail handling using stop commands |
US10409667B2 (en) * | 2017-06-15 | 2019-09-10 | Salesforce.Com, Inc. | Error assignment for computer programs |
US11157194B2 (en) * | 2018-01-12 | 2021-10-26 | International Business Machines Corporation | Automated predictive tiered storage system |
US11321612B2 (en) | 2018-01-30 | 2022-05-03 | D5Ai Llc | Self-organizing partially ordered networks and soft-tying learned parameters, such as connection weights |
CN108319545B (en) * | 2018-02-01 | 2021-07-16 | 联想(北京)有限公司 | Information processing method and electronic equipment |
US11412041B2 (en) | 2018-06-25 | 2022-08-09 | International Business Machines Corporation | Automatic intervention of global coordinator |
CN110659069B (en) * | 2018-06-28 | 2022-08-19 | 赛灵思公司 | Instruction scheduling method for performing neural network computation and corresponding computing system |
CN109034413A (en) * | 2018-07-11 | 2018-12-18 | 广东人励智能工程有限公司 | Intelligence manufacture equipment fault prediction technique and system based on neural network model |
US10606479B2 (en) | 2018-08-07 | 2020-03-31 | International Business Machines Corporation | Catastrophic data loss prevention by global coordinator |
CN109344036A (en) * | 2018-10-08 | 2019-02-15 | 郑州云海信息技术有限公司 | Alarm display method and system applied to storage system |
CN111124793A (en) * | 2018-11-01 | 2020-05-08 | 中国移动通信集团浙江有限公司 | Method and system for detecting performance abnormity of disk array controller |
KR20200053886A (en) | 2018-11-09 | 2020-05-19 | 삼성전자주식회사 | Neural processing unit, neural processing system, and application system |
US11023307B2 (en) | 2019-01-03 | 2021-06-01 | International Business Machines Corporation | Automatic remediation of distributed storage system node components through visualization |
US10970149B2 (en) * | 2019-01-03 | 2021-04-06 | International Business Machines Corporation | Automatic node hardware configuration in a distributed storage system |
CN109739213A (en) * | 2019-01-07 | 2019-05-10 | 东莞百宏实业有限公司 | A kind of failure prediction system and prediction technique |
US11275672B2 (en) * | 2019-01-29 | 2022-03-15 | EMC IP Holding Company LLC | Run-time determination of application performance with low overhead impact on system performance |
US10880377B2 (en) * | 2019-04-05 | 2020-12-29 | Netapp, Inc. | Methods and systems for prioritizing events associated with resources of a networked storage system |
US20200327025A1 (en) * | 2019-04-10 | 2020-10-15 | Alibaba Group Holding Limited | Methods, systems, and non-transitory computer readable media for operating a data storage system |
CN110058820B (en) * | 2019-04-23 | 2022-05-17 | 武汉汇迪森信息技术有限公司 | Data safe writing, deleting and reading method and device based on solid-state disk array |
CN110162923B (en) * | 2019-06-03 | 2020-04-03 | 北京卫星环境工程研究所 | Flexible cable process digital prototype construction system and method for spacecraft assembly |
FI129028B (en) * | 2019-06-19 | 2021-05-31 | Elisa Oyj | Maintenance priority in communication network |
US11205319B2 (en) | 2019-06-21 | 2021-12-21 | Sg Gaming, Inc. | System and method for synthetic image training of a neural network associated with a casino table game monitoring system |
US10691528B1 (en) * | 2019-07-23 | 2020-06-23 | Core Scientific, Inc. | Automatic repair of computing devices in a data center |
SG10201906806XA (en) * | 2019-07-23 | 2021-02-25 | Mastercard International Inc | Methods and computing devices for auto-submission of user authentication credential |
GB2600574B (en) * | 2019-08-23 | 2023-05-31 | Landmark Graphics Corp | AI/ML based drilling and production platform |
WO2021040764A1 (en) * | 2019-08-23 | 2021-03-04 | Landmark Graphics Corporation | Ai/ml based drilling and production platform |
CN110493247B (en) * | 2019-08-29 | 2022-08-02 | 南方电网科学研究院有限责任公司 | Power distribution terminal communication detection method, system, equipment and computer medium |
JP2021118370A (en) * | 2020-01-22 | 2021-08-10 | キオクシア株式会社 | Memory system, information processing device, and information processing system |
JP7428016B2 (en) * | 2020-03-05 | 2024-02-06 | 京セラドキュメントソリューションズ株式会社 | File sending device |
CN112053726B (en) * | 2020-09-09 | 2022-04-12 | 哈尔滨工业大学 | Flash memory mistaken erasure data recovery method based on Er-state threshold voltage distribution |
US11700125B2 (en) | 2020-10-05 | 2023-07-11 | Redcom Laboratories, Inc. | zkMFA: zero-knowledge based multi-factor authentication system |
CN112272228B (en) * | 2020-10-22 | 2024-08-20 | 北京神州数字科技有限公司 | Distributed registry system |
CN112468494B (en) * | 2020-11-26 | 2022-05-17 | 湖北航天信息技术有限公司 | Intranet and extranet internet data transmission method and device |
CN112764677B (en) * | 2021-01-14 | 2022-12-23 | 杭州电子科技大学 | Method for enhancing data migration security in cloud storage |
CN112882653B (en) * | 2021-01-26 | 2024-07-02 | 北京金山云网络技术有限公司 | Storage volume creation method and device and electronic equipment |
EP4092963B1 (en) * | 2021-05-20 | 2024-05-08 | Ovh | Method and system for datacenter network device maintenance |
US11722146B1 (en) * | 2022-01-21 | 2023-08-08 | Nxp B.V. | Correction of sigma-delta analog-to-digital converters (ADCs) using neural networks |
CN114785484B (en) * | 2022-04-06 | 2023-05-09 | 重庆葵林信息科技有限公司 | Big data safety transmission method and system |
US12039079B2 (en) | 2022-04-08 | 2024-07-16 | Bank Of America Corporation | System and method to secure data pipelines using asymmetric encryption |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140025386A1 (en) * | 2012-07-20 | 2014-01-23 | Qualcomm Incorporated | Systems, methods, apparatus, and computer-readable media for audio object clustering |
US8782492B2 (en) * | 2011-10-04 | 2014-07-15 | Cleversafe, Inc. | Updating data stored in a dispersed storage network |
US20140344646A1 (en) * | 2010-01-28 | 2014-11-20 | Cleversafe, Inc. | Distributed rebuilding of data in a dispersed storage network |
US9146810B2 (en) * | 2012-01-31 | 2015-09-29 | Cleversafe, Inc. | Identifying a potentially compromised encoded data slice |
US20160028419A1 (en) * | 2014-07-22 | 2016-01-28 | Lsi Corporation | Systems and Methods for Rank Independent Cyclic Data Encoding |
US20160294949A1 (en) * | 2015-03-31 | 2016-10-06 | International Business Machines Corporation | Modifying storage capacity of a set of storage units |
US20170132080A1 (en) * | 2011-06-06 | 2017-05-11 | International Business Machines Corporation | Rebuild prioritization during a plurality of concurrent data object write operations |
US20170140018A1 (en) * | 2015-04-30 | 2017-05-18 | International Business Machines Corporation | Distributed sync list |
Family Cites Families (134)
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 |
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 |
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 |
US6175571B1 (en) | 1994-07-22 | 2001-01-16 | Network Peripherals, Inc. | Distributed memory switching hub |
JP3180940B2 (en) * | 1994-11-28 | 2001-07-03 | 京セラミタ株式会社 | Image forming device maintenance management device |
US5848230A (en) | 1995-05-25 | 1998-12-08 | Tandem Computers Incorporated | Continuously available computer memory systems |
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 |
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 |
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 |
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 |
AU1513899A (en) | 1998-08-19 | 2000-03-14 | Boris Nikolaevich Vilkov | A system and method for identification of transformation of memory device addresses |
US6356949B1 (en) | 1999-01-29 | 2002-03-12 | Intermec Ip Corp. | Automatic data collection device that receives data output instruction from data consumer |
US6578144B1 (en) | 1999-03-23 | 2003-06-10 | International Business Machines Corporation | Secure hash-and-sign signatures |
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 |
US6671824B1 (en) * | 1999-04-19 | 2003-12-30 | Lakefield Technologies Group | Cable network repair control system |
US6434715B1 (en) * | 1999-06-14 | 2002-08-13 | General Electric Company | Method of detecting systemic fault conditions in an intelligent electronic device |
US6571282B1 (en) | 1999-08-31 | 2003-05-27 | Accenture Llp | Block-based communication in a communication services patterns environment |
US6516425B1 (en) * | 1999-10-29 | 2003-02-04 | Hewlett-Packard Co. | Raid rebuild using most vulnerable data redundancy scheme first |
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 |
US20160078695A1 (en) * | 2000-05-01 | 2016-03-17 | General Electric Company | Method and system for managing a fleet of remote assets and/or ascertaining a repair for an asset |
US6496814B1 (en) * | 2000-07-19 | 2002-12-17 | International Business Machines Corporation | Method and system for integrating spatial analysis, and scheduling to efficiently schedule and monitor infrastructure maintenance |
AU2002214659A1 (en) | 2000-10-26 | 2002-05-06 | James C. Flood Jr. | Method and system for managing distributed content and related metadata |
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 |
US7146644B2 (en) | 2000-11-13 | 2006-12-05 | Digital Doors, Inc. | Data security system and method responsive to electronic attacks |
US7140044B2 (en) | 2000-11-13 | 2006-11-21 | Digital Doors, Inc. | Data security system and method for separation of user communities |
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 |
US6857059B2 (en) | 2001-01-11 | 2005-02-15 | Yottayotta, Inc. | Storage virtualization system and methods |
US6745286B2 (en) | 2001-01-29 | 2004-06-01 | Snap Appliance, Inc. | Interface architecture |
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 |
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 |
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 |
US20050021359A1 (en) * | 2001-11-02 | 2005-01-27 | Mckinney Jerry L. | Monitoring system and method |
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 |
WO2004012337A2 (en) | 2002-07-29 | 2004-02-05 | 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 |
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 |
EP1618478A4 (en) | 2003-03-13 | 2007-10-03 | Drm Technologies L L C | Secure streaming container |
US7185144B2 (en) | 2003-11-24 | 2007-02-27 | Network Appliance, Inc. | Semi-static distribution technique |
GB0308262D0 (en) | 2003-04-10 | 2003-05-14 | Ibm | Recovery from failures within data processing systems |
GB0308264D0 (en) | 2003-04-10 | 2003-05-14 | Ibm | Recovery from failures within data processing systems |
US7415115B2 (en) | 2003-05-14 | 2008-08-19 | Broadcom Corporation | Method and system for disaster recovery of data from a storage device |
CN101566931B (en) | 2003-08-14 | 2011-05-18 | 克姆佩棱特科技公司 | Virtual disk drive system and method |
US7373559B2 (en) * | 2003-09-11 | 2008-05-13 | Copan Systems, Inc. | Method and system for proactive drive replacement for high availability storage systems |
US7899059B2 (en) | 2003-11-12 | 2011-03-01 | Agere Systems Inc. | Media delivery using quality of service differentiation within a media stream |
US8332483B2 (en) | 2003-12-15 | 2012-12-11 | International Business Machines Corporation | Apparatus, system, and method for autonomic control of grid system resources |
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 |
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 |
JP2005326935A (en) * | 2004-05-12 | 2005-11-24 | Hitachi Ltd | Management server for computer system equipped with virtualization storage and failure preventing/restoring method |
US7594063B1 (en) * | 2004-08-27 | 2009-09-22 | Lexar Media, Inc. | Storage capacity status |
JP4446839B2 (en) | 2004-08-30 | 2010-04-07 | 株式会社日立製作所 | Storage device and storage management device |
JP2006107080A (en) * | 2004-10-05 | 2006-04-20 | Hitachi Ltd | Storage device system |
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 |
US7305579B2 (en) * | 2005-03-22 | 2007-12-04 | Xiotech Corporation | Method, apparatus and program storage device for providing intelligent rebuild order selection |
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 |
US7574623B1 (en) * | 2005-04-29 | 2009-08-11 | Network Appliance, Inc. | Method and system for rapidly recovering data from a “sick” disk in a RAID disk group |
US8190588B1 (en) * | 2005-09-19 | 2012-05-29 | Amazon Technologies, Inc. | Providing a distributed transaction information storage service |
US9632872B2 (en) * | 2012-06-05 | 2017-04-25 | International Business Machines Corporation | Reprioritizing pending dispersed storage network requests |
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 |
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 |
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 |
US8171101B2 (en) | 2005-09-30 | 2012-05-01 | Cleversafe, Inc. | Smart access to a dispersed data storage network |
US8285878B2 (en) | 2007-10-09 | 2012-10-09 | Cleversafe, Inc. | Block based access to a dispersed data storage network |
EP1798934A1 (en) * | 2005-12-13 | 2007-06-20 | Deutsche Thomson-Brandt Gmbh | Method and apparatus for organizing nodes in a network |
US20070214285A1 (en) | 2006-03-08 | 2007-09-13 | Omneon Video Networks | Gateway server |
US7386827B1 (en) * | 2006-06-08 | 2008-06-10 | Xilinx, Inc. | Building a simulation environment for a design block |
JP2008103936A (en) * | 2006-10-18 | 2008-05-01 | Toshiba Corp | Secret information management device, and secret information management system |
US9697171B2 (en) * | 2007-10-09 | 2017-07-04 | Internaitonal Business Machines Corporation | Multi-writer revision synchronization in a dispersed storage network |
US9084937B2 (en) * | 2008-11-18 | 2015-07-21 | Gtech Canada Ulc | Faults and performance issue prediction |
US8260750B1 (en) * | 2009-03-16 | 2012-09-04 | Quest Software, Inc. | Intelligent backup escalation system |
US10104045B2 (en) | 2009-04-20 | 2018-10-16 | International Business Machines Corporation | Verifying data security in a dispersed storage network |
US9256560B2 (en) * | 2009-07-29 | 2016-02-09 | Solarflare Communications, Inc. | Controller integration |
US9558059B2 (en) * | 2009-07-30 | 2017-01-31 | International Business Machines Corporation | Detecting data requiring rebuilding in a dispersed storage network |
US9661356B2 (en) * | 2009-10-29 | 2017-05-23 | International Business Machines Corporation | Distribution of unique copies of broadcast data utilizing fault-tolerant retrieval from dispersed storage |
US9098376B2 (en) * | 2009-10-30 | 2015-08-04 | Cleversafe, Inc. | Distributed storage network for modification of a data object |
US8458233B2 (en) * | 2009-11-25 | 2013-06-04 | Cleversafe, Inc. | Data de-duplication in a dispersed storage network utilizing data characterization |
US8990585B2 (en) * | 2009-12-29 | 2015-03-24 | Cleversafe, Inc. | Time based dispersed storage access |
US9152489B2 (en) * | 2009-12-29 | 2015-10-06 | Cleversafe, Inc. | Revision synchronization of a dispersed storage network |
US8885821B2 (en) * | 2010-01-28 | 2014-11-11 | Cleversafe, Inc. | Sequencing encoded data slices |
US9898373B2 (en) * | 2010-04-26 | 2018-02-20 | International Business Machines Corporation | Prioritizing rebuilding of stored data in a dispersed storage network |
US9092386B2 (en) * | 2010-04-26 | 2015-07-28 | Cleversafe, Inc. | Indicating an error within a dispersed storage network |
US10447767B2 (en) * | 2010-04-26 | 2019-10-15 | Pure Storage, Inc. | Resolving a performance issue within a dispersed storage network |
US8626871B2 (en) * | 2010-05-19 | 2014-01-07 | Cleversafe, Inc. | Accessing a global vault in multiple dispersed storage networks |
US9842222B2 (en) | 2010-08-25 | 2017-12-12 | International Business Machines Corporation | Securely rebuilding an encoded data slice |
US9311615B2 (en) * | 2010-11-24 | 2016-04-12 | International Business Machines Corporation | Infrastructure asset management |
KR101758884B1 (en) * | 2011-01-10 | 2017-07-31 | 스토론 리미티드 | Large scale storage system |
US8996910B2 (en) * | 2011-05-09 | 2015-03-31 | Cleversafe, Inc. | Assigning a dispersed storage network address range in a maintenance free storage container |
US9521725B2 (en) * | 2011-07-26 | 2016-12-13 | Hunter Industries, Inc. | Systems and methods for providing power and data to lighting devices |
EP2737431A4 (en) * | 2011-07-27 | 2015-03-25 | Cleversafe Inc | Generating dispersed storage network event records |
US8549518B1 (en) * | 2011-08-10 | 2013-10-01 | Nutanix, Inc. | Method and system for implementing a maintenanece service for managing I/O and storage for virtualization environment |
US9015556B2 (en) * | 2011-12-12 | 2015-04-21 | Cleversafe, Inc. | Transforming data in a distributed storage and task network |
US8719320B1 (en) * | 2012-03-29 | 2014-05-06 | Amazon Technologies, Inc. | Server-side, variable drive health determination |
US9380032B2 (en) * | 2012-04-25 | 2016-06-28 | International Business Machines Corporation | Encrypting data for storage in a dispersed storage network |
US20140101298A1 (en) * | 2012-10-05 | 2014-04-10 | Microsoft Corporation | Service level agreements for a configurable distributed storage system |
US9811533B2 (en) * | 2012-12-05 | 2017-11-07 | International Business Machines Corporation | Accessing distributed computing functions in a distributed computing system |
US10055441B2 (en) * | 2013-02-05 | 2018-08-21 | International Business Machines Corporation | Updating shared group information in a dispersed storage network |
US9679615B2 (en) * | 2013-03-15 | 2017-06-13 | Micron Technology, Inc. | Flexible memory system with a controller and a stack of memory |
US20150039660A1 (en) * | 2013-07-31 | 2015-02-05 | Cleversafe, Inc. | Co-locate objects request |
US9720758B2 (en) * | 2013-09-11 | 2017-08-01 | Dell Products, Lp | Diagnostic analysis tool for disk storage engineering and technical support |
US9264494B2 (en) * | 2013-10-21 | 2016-02-16 | International Business Machines Corporation | Automated data recovery from remote data object replicas |
US9900316B2 (en) * | 2013-12-04 | 2018-02-20 | International Business Machines Corporation | Accessing storage units of a dispersed storage network |
US9435101B2 (en) * | 2014-04-24 | 2016-09-06 | Topcon Positioning Systems, Inc. | Semi-automatic control of a joystick for dozer blade control |
US9075773B1 (en) * | 2014-05-07 | 2015-07-07 | Igneous Systems, Inc. | Prioritized repair of data storage failures |
US20150356305A1 (en) * | 2014-06-05 | 2015-12-10 | Cleversafe, Inc. | Secure data access in a dispersed storage network |
US10120739B2 (en) * | 2014-12-02 | 2018-11-06 | International Business Machines Corporation | Prioritized data rebuilding in a dispersed storage network |
US10078472B2 (en) * | 2015-02-27 | 2018-09-18 | International Business Machines Corporation | Rebuilding encoded data slices in a dispersed storage network |
US10601658B2 (en) * | 2015-04-08 | 2020-03-24 | Cisco Technology, Inc. | Maintenance of consumable physical components of a network |
US10528540B2 (en) * | 2015-05-11 | 2020-01-07 | AtScale, Inc. | Dynamic aggregate generation and updating for high performance querying of large datasets |
US10410135B2 (en) * | 2015-05-21 | 2019-09-10 | Software Ag Usa, Inc. | Systems and/or methods for dynamic anomaly detection in machine sensor data |
EP3741081B1 (en) * | 2018-01-16 | 2021-10-13 | Nchain Holdings Limited | Computer implemented method and system for obtaining digitally signed data |
-
2017
- 2017-01-04 US US15/398,540 patent/US10089178B2/en active Active
- 2017-01-09 US US15/401,377 patent/US20170249228A1/en not_active Abandoned
- 2017-01-10 US US15/402,378 patent/US10248505B2/en active Active
- 2017-01-11 US US15/403,425 patent/US10476849B2/en active Active
- 2017-01-12 US US15/404,560 patent/US20170249212A1/en not_active Abandoned
- 2017-01-19 US US15/410,329 patent/US10326740B2/en not_active Expired - Fee Related
- 2017-02-06 US US15/425,553 patent/US10120757B2/en not_active Expired - Fee Related
- 2017-02-07 US US15/426,380 patent/US10678622B2/en not_active Expired - Fee Related
- 2017-02-22 CN CN201780008333.0A patent/CN108701197A/en active Pending
- 2017-02-22 DE DE112017000220.6T patent/DE112017000220T5/en not_active Withdrawn
- 2017-02-22 US US15/439,092 patent/US10824495B2/en active Active
- 2017-02-22 WO PCT/IB2017/051010 patent/WO2017149410A1/en active Application Filing
-
2018
- 2018-06-26 US US16/019,505 patent/US10673828B2/en active Active
-
2020
- 2020-04-24 US US16/857,719 patent/US11204822B1/en active Active
-
2021
- 2021-11-30 US US17/538,771 patent/US11704184B2/en active Active
-
2023
- 2023-06-08 US US18/331,283 patent/US12026044B2/en active Active
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140344646A1 (en) * | 2010-01-28 | 2014-11-20 | Cleversafe, Inc. | Distributed rebuilding of data in a dispersed storage network |
US20170132080A1 (en) * | 2011-06-06 | 2017-05-11 | International Business Machines Corporation | Rebuild prioritization during a plurality of concurrent data object write operations |
US8782492B2 (en) * | 2011-10-04 | 2014-07-15 | Cleversafe, Inc. | Updating data stored in a dispersed storage network |
US9146810B2 (en) * | 2012-01-31 | 2015-09-29 | Cleversafe, Inc. | Identifying a potentially compromised encoded data slice |
US20140025386A1 (en) * | 2012-07-20 | 2014-01-23 | Qualcomm Incorporated | Systems, methods, apparatus, and computer-readable media for audio object clustering |
US20160028419A1 (en) * | 2014-07-22 | 2016-01-28 | Lsi Corporation | Systems and Methods for Rank Independent Cyclic Data Encoding |
US20160294949A1 (en) * | 2015-03-31 | 2016-10-06 | International Business Machines Corporation | Modifying storage capacity of a set of storage units |
US20170140018A1 (en) * | 2015-04-30 | 2017-05-18 | International Business Machines Corporation | Distributed sync list |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11233643B1 (en) * | 2009-04-20 | 2022-01-25 | Pure Storage, Inc. | Distributed data storage system data decoding and decryption |
US11991280B2 (en) | 2009-04-20 | 2024-05-21 | Pure Storage, Inc. | Randomized transforms in a dispersed data storage system |
CN108388748A (en) * | 2018-03-12 | 2018-08-10 | 北京理工大学 | Method is discontinuously calculated in a kind of detonation numerical simulation serial program |
CN108459922A (en) * | 2018-03-12 | 2018-08-28 | 北京理工大学 | Method is discontinuously calculated in a kind of detonation numerical simulation concurrent program |
Also Published As
Publication number | Publication date |
---|---|
US10089178B2 (en) | 2018-10-02 |
DE112017000220T5 (en) | 2018-08-09 |
US10248505B2 (en) | 2019-04-02 |
US20220083415A1 (en) | 2022-03-17 |
US20230315557A1 (en) | 2023-10-05 |
CN108701197A (en) | 2018-10-23 |
WO2017149410A1 (en) | 2017-09-08 |
US20170249086A1 (en) | 2017-08-31 |
US10678622B2 (en) | 2020-06-09 |
US20170249203A1 (en) | 2017-08-31 |
US11704184B2 (en) | 2023-07-18 |
US20170249551A1 (en) | 2017-08-31 |
US20180307561A1 (en) | 2018-10-25 |
US10476849B2 (en) | 2019-11-12 |
US12026044B2 (en) | 2024-07-02 |
US10824495B2 (en) | 2020-11-03 |
US20170249205A1 (en) | 2017-08-31 |
US20170249228A1 (en) | 2017-08-31 |
US11204822B1 (en) | 2021-12-21 |
US10673828B2 (en) | 2020-06-02 |
US20170250809A1 (en) | 2017-08-31 |
US10326740B2 (en) | 2019-06-18 |
US20170249084A1 (en) | 2017-08-31 |
US20170250965A1 (en) | 2017-08-31 |
US10120757B2 (en) | 2018-11-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10656871B2 (en) | Expanding slice count in response to low-level failures | |
US10387080B2 (en) | Rebuilding slices in a dispersed storage network | |
US10001950B2 (en) | Maintaining storage thresholds in a distributed storage network | |
US20170249212A1 (en) | Maximizing redundant information in a mirrored vault | |
US10372506B2 (en) | Compute architecture in a memory device of distributed computing system | |
US10061648B2 (en) | Efficient method for redundant storage of a set of encoded data slices | |
US10042706B2 (en) | Optimizing secondary storage in a dispersed storage network | |
US10298683B2 (en) | Consolidating data access in a dispersed storage network | |
US10296404B2 (en) | Determining slices used in a reconstruction | |
US10606700B2 (en) | Enhanced dispersed storage error encoding using multiple encoding layers | |
US9875158B2 (en) | Slice storage in a dispersed storage network | |
US10310763B2 (en) | Forming a distributed storage network memory without namespace aware distributed storage units | |
US10067822B2 (en) | Combined slice objects in alternate memory locations | |
US10417253B2 (en) | Multi-level data storage in a dispersed storage network | |
US10523241B2 (en) | Object fan out write operation | |
US10394476B2 (en) | Multi-level stage locality selection on a large system | |
US20180107421A1 (en) | Multi-site duplication via high-level storage unit processing modules | |
US20180052735A1 (en) | Efficient, secure, storage of meaningful content as part of a dsn memory | |
US10114697B2 (en) | Large object parallel writing | |
US20170322734A1 (en) | Using locks to prevent multiple rebuilds of the same source |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MCCAMMON, ROBERT C.;MCSHANE, NIALL J.;SHIRLEY, THOMAS F., JR.;REEL/FRAME:040956/0573 Effective date: 20170111 |
|
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 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
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 |
|
AS | Assignment |
Owner name: PURE STORAGE, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:050451/0549 Effective date: 20190906 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO PAY ISSUE FEE |