US20170155719A1 - Selectively setting dsn slice data in motion within dsn memory based on conditions at the final data rest points - Google Patents
Selectively setting dsn slice data in motion within dsn memory based on conditions at the final data rest points Download PDFInfo
- Publication number
- US20170155719A1 US20170155719A1 US15/340,628 US201615340628A US2017155719A1 US 20170155719 A1 US20170155719 A1 US 20170155719A1 US 201615340628 A US201615340628 A US 201615340628A US 2017155719 A1 US2017155719 A1 US 2017155719A1
- Authority
- US
- United States
- Prior art keywords
- unit
- access request
- storage
- performance
- storage units
- 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
- 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
- G06F3/0635—Configuration or reconfiguration of storage systems by changing the path, e.g. traffic rerouting, path reconfiguration
-
- 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/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/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
- G06F11/1092—Rebuilding, e.g. when physically replacing a failing disk
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/258—Data format conversion from or to a database
-
- 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/061—Improving I/O performance
- G06F3/0611—Improving I/O performance in relation to response time
-
- 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/0617—Improving the reliability of storage systems in relation to availability
-
- 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/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
- G06F3/0631—Configuration or reconfiguration of storage systems by allocating resources to 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/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]
-
- 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/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
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/565—Conversion or adaptation of application format or content
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.
- One or more memory units used to implement the dispersed storage system may be offline or slow due to network connection limitations or other conditions. Unfortunately, using conventional techniques to access data using these slow or offline memory units can adversely impact the performance of the system as a whole.
- 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. 10 is a flowchart illustrating another example of optimizing performance of a set of storage units 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 a 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 a per-data-amount billing information.
- the managing unit 18 performs network operations, network administration, and/or network maintenance.
- Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, storage units, and/or computing devices with a DS client module 34 ) to/from the DSN 10 , and/or establishing authentication credentials for the storage units 36 .
- Network administration includes monitoring devices and/or units for failures, maintaining vault information, determining device and/or unit activation status, determining device and/or unit loading, and/or determining any other system level operation that affects the performance level of the DSN 10 .
- Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of the DSN 10 .
- the integrity processing unit 20 performs rebuilding of ‘bad’ or missing encoded data slices.
- the integrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from the DSN memory 22 .
- retrieved encoded slices they are checked for errors due to data corruption, outdated version, etc. If a slice includes an error, it is flagged as a ‘bad’ slice.
- encoded data slices that were not received and/or not listed they are flagged as missing slices.
- Bad and/or missing slices are subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices to produce rebuilt slices.
- the rebuilt slices are stored in the 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 (IO) controller 56 , a peripheral component interconnect (PCI) interface 58 , an IO interface module 60 , at least one IO device interface module 62 , a read only memory (ROM) basic input output system (BIOS) 64 , and one or more memory interface modules.
- IO input/output
- PCI peripheral component interconnect
- IO interface module 60 at least one IO device interface module 62
- ROM read only memory
- BIOS basic input output system
- the one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66 , a host bus adapter (HBA) interface module 68 , a network interface module 70 , a flash interface module 72 , a hard drive interface module 74 , and a DSN interface module 76 .
- USB universal serial bus
- HBA host bus adapter
- the DSN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.).
- OS operating system
- the DSN interface module 76 and/or the network interface module 70 may function as one or more of the interface 30 - 33 of FIG. 1 .
- the IO device interface module 62 and/or the memory interface modules 66 - 76 may be collectively or individually referred to as IO ports.
- FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data.
- a computing device 12 or 16 When a computing device 12 or 16 has data to store it disperse storage error encodes the data in accordance with a dispersed storage error encoding process based on dispersed storage error encoding parameters.
- the dispersed storage error encoding parameters include an encoding function (e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.), a data segmenting protocol (e.g., data segment size, fixed, variable, etc.), and per data segment encoding values.
- an encoding function e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.
- a data segmenting protocol e.g., data segment size
- the per data segment encoding values include a total, or pillar width, number (T) of encoded data slices per encoding of a data segment i.e., in a set of encoded data slices); a decode threshold number (D) of encoded data slices of a set of encoded data slices that are needed to recover the data segment; a read threshold number (R) of encoded data slices to indicate a number of encoded data slices per set to be read from storage for decoding of the data segment; and/or a write threshold number (W) to indicate a number of encoded data slices per set that must be accurately stored before the encoded data segment is deemed to have been properly stored.
- T total, or pillar width, number
- D decode threshold number
- R read threshold number
- W write threshold number
- the dispersed storage error encoding parameters may further include slicing information (e.g., the number of encoded data slices that will be created for each data segment) and/or slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).
- slicing information e.g., the number of encoded data slices that will be created for each data segment
- slice security information e.g., per encoded data slice encryption, compression, integrity checksum, etc.
- the encoding function has been selected as Cauchy Reed-Solomon (a generic example is shown in FIG. 4 and a specific example is shown in FIG. 5 );
- the data segmenting protocol is to divide the data object into fixed sized data segments; and the per data segment encoding values include: a pillar width of 5 , a decode threshold of 3 , a read threshold of 4 , and a write threshold of 4 .
- the computing device 12 or 16 divides the data (e.g., a file (e.g., text, video, audio, etc.), a data object, or other data arrangement) into a plurality of fixed sized data segments (e.g., 1 through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more).
- the number of data segments created is dependent of the size of the data and the data segmenting protocol.
- FIG. 4 illustrates a generic Cauchy Reed-Solomon encoding function, which includes an encoding matrix (EM), a data matrix (DM), and a coded matrix (CM).
- the size of the encoding matrix (EM) is dependent on the pillar width number (T) and the decode threshold number (D) of selected per data segment encoding values.
- EM encoding matrix
- T pillar width number
- D decode threshold number
- Z is a function of the number of data blocks created from the data segment and the decode threshold number (D).
- the coded matrix is produced by matrix multiplying the data matrix by the encoding matrix.
- FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encoding with a pillar number (T) of five and decode threshold number of three.
- a first data segment is divided into twelve data blocks (D 1 -D 12 ).
- the coded matrix includes five rows of coded data blocks, where the first row of X 11 -X 14 corresponds to a first encoded data slice (EDS 1 _ 1 ), the second row of X 21 -X 24 corresponds to a second encoded data slice (EDS 2 _ 1 ), the third row of X 31 -X 34 corresponds to a third encoded data slice (EDS 3 _ 1 ), the fourth row of X 41 -X 44 corresponds to a fourth encoded data slice (EDS 4 _ 1 ), and the fifth row of X 51 -X 54 corresponds to a fifth encoded data slice (EDS 5 _ 1 ).
- the second number of the EDS designation corresponds to the data segment number.
- the computing device also creates a slice name (SN) for each encoded data slice (EDS) in the set of encoded data slices.
- a typical format for a slice name 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 DSN memory automatically sets slice data in motion by sending selective slice data to “pseudo” DS storage units, when the “real” DS storage units are offline or slow.
- a “pseudo” DS unit for example a distributed storage and task (DST) processing unit, or a DST execution/storage unit are deployed within a DSN memory, to be used when the “real”DS storage units are offline or are slow due to network connection limitations or other conditions.
- DST distributed storage and task
- the “pseudo” DS storage units are capable of understanding DSN network protocol, but have minimal ability to store data, and act primarily as either forwarding or loopback agents with the introduction of some desired latency in the data forwarding or loopback operation, using store and forward principles.
- the “pseudo” DS storage units can act as queues for multiple “real” DS storage units, using “real” DS storage unit IDs or addresses to hash into a unique non-reserved TCP port on the “pseudo”DS storage unit.
- the “pseudo”DS storage units behave just like real DS storage units in all aspects of protocol negotiation and data transfer, but not in storage of the data. They may, for instance, return ErrorResponses to all WriteRequests received, and empty read and listing responses.
- the selection of slice data can be based on object size, as well as known performance and real time status of “real” DSN memory unit.
- the available throughput at the “pseudo” DS storage unit, along with the object size and real DSN memory unit performance and status would determine the desired latency needed to set data in motion.
- the DS processing unit can use DSN network protocol with a “pseudo” DS storage unit address, hashed TCP port (based on real ds unit address or ID), desired latency and other attributes similar to those used in sending DSN slice data to “real” DS storage units.
- the DS processing unit sends slice data received from the “pseudo” DS storage units to the real DS storage units, while sending other slices directly to the real ds unit for the same object.
- the DS processing unit has to change only the destination address and TCP port for fast switching the slice data destination from “pseudo” DS storage units to “real” DS storage units.
- FIG. 9 is a schematic block diagram of another embodiment of a dispersed storage network (DSN) that includes the computing device 16 of FIG. 1 , the network 24 of FIG. 1 , a performance unit 91 , and a set of storage units 1 - n .
- the performance unit 91 may be implemented utilizing one or more of the computing device 16 , a distributed storage and task (DST) execution unit, a server, and a user device. Each storage unit may be implemented utilizing the a DST execution unit, such as storage unit 36 of FIG. 1 .
- the performance unit 91 includes processing module 84 and memory 88 .
- the DSN functions to optimize performance of the set of storage units 1 - n .
- Computing device 16 is sometimes referred to herein as a DS processing unit, or a distributed storage and task (DST) processing unit.
- the computing device 16 determines a storage unit status level.
- the storage unit status level includes one or more of a storage unit performance level, an available storage unit capacity level, a utilized storage capacity level, etc., the determining includes at least one of interpreting a query response, interpreting a test result, and receiving status information that includes the status level. For example, the Computing device 16 receives status information from the storage unit 2 indicating that the storage unit 2 is an underperforming storage unit.
- the computing device 16 sends a corresponding access request (e.g., access request 2 ) of a set of access requests (e.g., access requests 1 - n ) to access data utilizing the set of storage units, to the performance unit to facilitate execution of an alternative approach to processing the access request.
- a corresponding access request e.g., access request 2
- a set of access requests e.g., access requests 1 - n
- the sending includes indicating that the alternative approach is to be utilized, obtaining the access request (e.g., access request 2 ) corresponding to the storage unit (e.g., storage unit 2 ), and sending, via the network 24 , the access request to the performance unit, where the performance unit temporarily stores a received slice in the memory 88 when the access request is a write request, issues a forwarded access request (e.g., forwarded access request 2 ) to the corresponding storage unit (e.g., storage unit 2 ), where the request includes the received slice, and issues a proxy access response (e.g., proxy access response 2 ) to the computing device 16 , where the response indicates that the slice has been stored.
- a forwarded access request e.g., forwarded access request 2
- proxy access response e.g., proxy access response 2
- the computing device 16 When the request is a read request, the computing device 16 attempts to retrieve a temporarily stored slice from the memory 88 of the performance unit and/or by the performance unit issuing a forwarded access request (e.g., another forwarded access request 2 ) to the corresponding storage unit (e.g., storage unit 2 ), receiving an access response from the corresponding storage unit that includes a retrieved slice, and issuing a proxy access response (e.g., proxy access 2 ) to the computing device 16 , where the response includes retrieved slice from either of the performance unit or from the corresponding storage unit.
- a forwarded access request e.g., another forwarded access request 2
- proxy access response e.g., proxy access 2
- the storage unit status level compares favorably to the storage unit status threshold level, then sends, via the network 24 , the corresponding access request directly to the storage unit.
- the computing device 16 sends, via the network 24 , access requests 1 , 3 - n to the storage units 1 , 3 -n and receives, via the network 24 , access responses 1 , 3 - n from the storage units 1 , 3 - n.
- FIG. 10 is a flowchart illustrating another example of optimizing performance of a set of storage units.
- the method includes block 94 where a processing unit (e.g., of a distributed storage and task (DST) processing unit), for each storage unit of a set of storage units of a dispersed storage network (DSN), determines a storage unit status level.
- the determining includes at least one of interpreting a query response, interpreting a test result, and receiving status information that includes the status level.
- the storage unit status level compares favorably to a storage unit status threshold level
- the method branches to the step where the processing unit sends the corresponding access request to the storage unit.
- the storage unit status level compares unfavorably to the storage unit status threshold level, the method continues to the next step.
- the method continues at block 95 , where the processing unit sends a corresponding access request of a set of access requests to a performance unit to facilitate execution of alternative approach to processing the access request, where the set of access requests is generated to access data utilizing the set of storage units.
- the sending includes one or more of indicating utilization of the alternative approach when the storage unit status level is less than the storage unit status threshold level, obtaining the access request corresponding to the storage unit, sending the access request to the performance unit where the performance unit Early stores a received slice in the memory when the access request is a write request, issues a forwarded access request to the corresponding storage unit, where the request includes the received slice, and issues a proxy access response to the processing unit, where the response indicates that the slice has been stored.
- the processing unit When the request is a read request, the processing unit facilitates the performance unit to retrieve a temporarily stored slice from local memory of the performance unit and/or by sending a forwarded access request to the corresponding storage unit, receiving an access response from the storage unit that includes a retrieved slice, and issuing a proxy access response to the processing unit, where the response includes the retrieved slice (e.g., from either of the local memory or from the corresponding storage unit).
- the method continues at block 96 , where the processing unit sends the corresponding access request of the set of access requests to the storage unit. For example, the processing unit sends the access request of the storage unit and receives an access response from the storage unit.
- 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)
- Human Computer Interaction (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Quality & Reliability (AREA)
- Pure & Applied Mathematics (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Detection And Correction Of Errors (AREA)
- Retry When Errors Occur (AREA)
- Storage Device Security (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
Description
- This application claims priority pursuant to 35 U.S.C. §119(e) to U.S. Provisional Application No. 62/260,43, entitled “COMMUNICATING DISPERSED STORAGE NETWORK STORAGE UNIT TASK EXECUTION STATUS,” filed Nov. 30, 2015, 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 the 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.
- One or more memory units used to implement the dispersed storage system may be offline or slow due to network connection limitations or other conditions. Unfortunately, using conventional techniques to access data using these slow or offline memory units can adversely impact the performance of the system as a whole.
-
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. 10 is a flowchart illustrating another example of optimizing performance of a set of storage units 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 a 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 a per-data-amount billing information. - As another example, the managing
unit 18 performs network operations, network administration, and/or network maintenance. Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, storage units, and/or computing devices with a DS client module 34) to/from 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 (IO)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 harddrive interface module 74, and aDSN 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.). TheDSN interface module 76 and/or thenetwork 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 - Referring next to
FIGS. 9 and 10 , various embodiments employing one or more “pseudo” DS storage units, sometimes referred to herein as “performance units” to assist in selectively setting DSN slice data in motion within a DSN memory based on conditions at the final data rest points will be discussed. A DSN memory automatically sets slice data in motion by sending selective slice data to “pseudo” DS storage units, when the “real” DS storage units are offline or slow. A “pseudo” DS unit, for example a distributed storage and task (DST) processing unit, or a DST execution/storage unit are deployed within a DSN memory, to be used when the “real”DS storage units are offline or are slow due to network connection limitations or other conditions. These “pseudo” DS storage units are capable of understanding DSN network protocol, but have minimal ability to store data, and act primarily as either forwarding or loopback agents with the introduction of some desired latency in the data forwarding or loopback operation, using store and forward principles. The “pseudo” DS storage units can act as queues for multiple “real” DS storage units, using “real” DS storage unit IDs or addresses to hash into a unique non-reserved TCP port on the “pseudo”DS storage unit. The “pseudo”DS storage units behave just like real DS storage units in all aspects of protocol negotiation and data transfer, but not in storage of the data. They may, for instance, return ErrorResponses to all WriteRequests received, and empty read and listing responses. - The selection of slice data can be based on object size, as well as known performance and real time status of “real” DSN memory unit. The available throughput at the “pseudo” DS storage unit, along with the object size and real DSN memory unit performance and status would determine the desired latency needed to set data in motion. In some embodiments, the DS processing unit can use DSN network protocol with a “pseudo” DS storage unit address, hashed TCP port (based on real ds unit address or ID), desired latency and other attributes similar to those used in sending DSN slice data to “real” DS storage units. The DS processing unit sends slice data received from the “pseudo” DS storage units to the real DS storage units, while sending other slices directly to the real ds unit for the same object. The DS processing unit has to change only the destination address and TCP port for fast switching the slice data destination from “pseudo” DS storage units to “real” DS storage units.
-
FIG. 9 is a schematic block diagram of another embodiment of a dispersed storage network (DSN) that includes thecomputing device 16 ofFIG. 1 , thenetwork 24 ofFIG. 1 , aperformance unit 91, and a set of storage units 1-n. Theperformance unit 91 may be implemented utilizing one or more of thecomputing device 16, a distributed storage and task (DST) execution unit, a server, and a user device. Each storage unit may be implemented utilizing the a DST execution unit, such asstorage unit 36 ofFIG. 1 . Theperformance unit 91 includesprocessing module 84 andmemory 88. The DSN functions to optimize performance of the set of storage units 1-n.Computing device 16 is sometimes referred to herein as a DS processing unit, or a distributed storage and task (DST) processing unit. - In an example of operation of the optimizing of the performance of the set of storage units, for each storage unit of the set of storage units, the
computing device 16 determines a storage unit status level. The storage unit status level includes one or more of a storage unit performance level, an available storage unit capacity level, a utilized storage capacity level, etc., the determining includes at least one of interpreting a query response, interpreting a test result, and receiving status information that includes the status level. For example, theComputing device 16 receives status information from thestorage unit 2 indicating that thestorage unit 2 is an underperforming storage unit. - When the storage unit status level compares unfavorably to a storage unit status threshold level, the
computing device 16 sends a corresponding access request (e.g., access request 2) of a set of access requests (e.g., access requests 1-n) to access data utilizing the set of storage units, to the performance unit to facilitate execution of an alternative approach to processing the access request. The sending includes indicating that the alternative approach is to be utilized, obtaining the access request (e.g., access request 2) corresponding to the storage unit (e.g., storage unit 2), and sending, via thenetwork 24, the access request to the performance unit, where the performance unit temporarily stores a received slice in thememory 88 when the access request is a write request, issues a forwarded access request (e.g., forwarded access request 2) to the corresponding storage unit (e.g., storage unit 2), where the request includes the received slice, and issues a proxy access response (e.g., proxy access response 2) to thecomputing device 16, where the response indicates that the slice has been stored. When the request is a read request, thecomputing device 16 attempts to retrieve a temporarily stored slice from thememory 88 of the performance unit and/or by the performance unit issuing a forwarded access request (e.g., another forwarded access request 2) to the corresponding storage unit (e.g., storage unit 2), receiving an access response from the corresponding storage unit that includes a retrieved slice, and issuing a proxy access response (e.g., proxy access 2) to thecomputing device 16, where the response includes retrieved slice from either of the performance unit or from the corresponding storage unit. - When the storage unit status level compares favorably to the storage unit status threshold level, then sends, via the
network 24, the corresponding access request directly to the storage unit. For example, thecomputing device 16 sends, via thenetwork 24,access requests 1, 3-n to thestorage units 1, 3-n and receives, via thenetwork 24,access responses 1, 3-n from thestorage units 1, 3-n. -
FIG. 10 is a flowchart illustrating another example of optimizing performance of a set of storage units. The method includesblock 94 where a processing unit (e.g., of a distributed storage and task (DST) processing unit), for each storage unit of a set of storage units of a dispersed storage network (DSN), determines a storage unit status level. The determining includes at least one of interpreting a query response, interpreting a test result, and receiving status information that includes the status level. When the storage unit status level compares favorably to a storage unit status threshold level, the method branches to the step where the processing unit sends the corresponding access request to the storage unit. When the storage unit status level compares unfavorably to the storage unit status threshold level, the method continues to the next step. - When the storage unit status level compares unfavorably to a storage unit status threshold level, the method continues at
block 95, where the processing unit sends a corresponding access request of a set of access requests to a performance unit to facilitate execution of alternative approach to processing the access request, where the set of access requests is generated to access data utilizing the set of storage units. The sending includes one or more of indicating utilization of the alternative approach when the storage unit status level is less than the storage unit status threshold level, obtaining the access request corresponding to the storage unit, sending the access request to the performance unit where the performance unit Early stores a received slice in the memory when the access request is a write request, issues a forwarded access request to the corresponding storage unit, where the request includes the received slice, and issues a proxy access response to the processing unit, where the response indicates that the slice has been stored. When the request is a read request, the processing unit facilitates the performance unit to retrieve a temporarily stored slice from local memory of the performance unit and/or by sending a forwarded access request to the corresponding storage unit, receiving an access response from the storage unit that includes a retrieved slice, and issuing a proxy access response to the processing unit, where the response includes the retrieved slice (e.g., from either of the local memory or from the corresponding storage unit). - When the storage unit status level compares favorably to the storage unit status threshold level, the method continues at
block 96, where the processing unit sends the corresponding access request of the set of access requests to the storage unit. For example, the processing unit sends the access request of the storage unit and receives an access response from the storage unit. - 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/340,628 US20170155719A1 (en) | 2015-11-30 | 2016-11-01 | Selectively setting dsn slice data in motion within dsn memory based on conditions at the final data rest points |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201562260743P | 2015-11-30 | 2015-11-30 | |
US15/340,628 US20170155719A1 (en) | 2015-11-30 | 2016-11-01 | Selectively setting dsn slice data in motion within dsn memory based on conditions at the final data rest points |
Publications (1)
Publication Number | Publication Date |
---|---|
US20170155719A1 true US20170155719A1 (en) | 2017-06-01 |
Family
ID=58776974
Family Applications (11)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/332,557 Active 2037-05-05 US10409514B2 (en) | 2015-11-30 | 2016-10-24 | IP multicast message transmission for event notifications |
US15/340,628 Abandoned US20170155719A1 (en) | 2015-11-30 | 2016-11-01 | Selectively setting dsn slice data in motion within dsn memory based on conditions at the final data rest points |
US15/340,310 Expired - Fee Related US10496308B2 (en) | 2015-11-30 | 2016-11-01 | Using pseudo DSN memory units to handle data in motion within a DSN memory |
US15/340,017 Expired - Fee Related US10216443B2 (en) | 2015-11-30 | 2016-11-01 | Proactively deselect storage units for access during major geographic events |
US15/353,024 Active US10216444B2 (en) | 2015-11-30 | 2016-11-16 | Requester specified transformations of encoded data in dispersed storage network memory |
US15/356,929 Active US9971538B2 (en) | 2015-11-30 | 2016-11-21 | Load balancing and service differentiation within a dispersed storage network |
US15/357,670 Abandoned US20170155709A1 (en) | 2015-11-30 | 2016-11-21 | Dynamic resource selection for uploading multi-part data in a dispersed storage network |
US15/357,293 Expired - Fee Related US9933969B2 (en) | 2015-11-30 | 2016-11-21 | Securing encoding data slices using an integrity check value list |
US15/363,622 Expired - Fee Related US10073645B2 (en) | 2015-11-30 | 2016-11-29 | Initiating rebuild actions from DS processing unit errors |
US15/899,626 Expired - Fee Related US10387063B2 (en) | 2015-11-30 | 2018-02-20 | Securing encoding data slices using an integrity check value list |
US16/251,831 Abandoned US20190163389A1 (en) | 2015-11-30 | 2019-01-18 | Requester specified transformations of encoded data in dispersed storage network memory |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/332,557 Active 2037-05-05 US10409514B2 (en) | 2015-11-30 | 2016-10-24 | IP multicast message transmission for event notifications |
Family Applications After (9)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/340,310 Expired - Fee Related US10496308B2 (en) | 2015-11-30 | 2016-11-01 | Using pseudo DSN memory units to handle data in motion within a DSN memory |
US15/340,017 Expired - Fee Related US10216443B2 (en) | 2015-11-30 | 2016-11-01 | Proactively deselect storage units for access during major geographic events |
US15/353,024 Active US10216444B2 (en) | 2015-11-30 | 2016-11-16 | Requester specified transformations of encoded data in dispersed storage network memory |
US15/356,929 Active US9971538B2 (en) | 2015-11-30 | 2016-11-21 | Load balancing and service differentiation within a dispersed storage network |
US15/357,670 Abandoned US20170155709A1 (en) | 2015-11-30 | 2016-11-21 | Dynamic resource selection for uploading multi-part data in a dispersed storage network |
US15/357,293 Expired - Fee Related US9933969B2 (en) | 2015-11-30 | 2016-11-21 | Securing encoding data slices using an integrity check value list |
US15/363,622 Expired - Fee Related US10073645B2 (en) | 2015-11-30 | 2016-11-29 | Initiating rebuild actions from DS processing unit errors |
US15/899,626 Expired - Fee Related US10387063B2 (en) | 2015-11-30 | 2018-02-20 | Securing encoding data slices using an integrity check value list |
US16/251,831 Abandoned US20190163389A1 (en) | 2015-11-30 | 2019-01-18 | Requester specified transformations of encoded data in dispersed storage network memory |
Country Status (1)
Country | Link |
---|---|
US (11) | US10409514B2 (en) |
Families Citing this family (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10802915B2 (en) * | 2015-01-30 | 2020-10-13 | Pure Storage, Inc. | Time based storage of encoded data slices |
US10409514B2 (en) * | 2015-11-30 | 2019-09-10 | International Business Machines Corporation | IP multicast message transmission for event notifications |
US10394650B2 (en) * | 2016-06-03 | 2019-08-27 | International Business Machines Corporation | Multiple writes using inter-site storage unit relationship |
US10387079B2 (en) * | 2016-09-09 | 2019-08-20 | International Business Machines Corporation | Placement of dispersed storage data based on requestor properties |
US10481977B2 (en) * | 2016-10-27 | 2019-11-19 | International Business Machines Corporation | Dispersed storage of error encoded data objects having multiple resolutions |
JP6399127B2 (en) * | 2017-03-08 | 2018-10-03 | 日本電気株式会社 | System management apparatus, system management method, program, information processing system |
US10509699B2 (en) | 2017-08-07 | 2019-12-17 | International Business Machines Corporation | Zone aware request scheduling and data placement |
KR102488149B1 (en) * | 2018-01-08 | 2023-01-16 | 삼성전자주식회사 | Display apparatus and control method thereof |
CN110597453A (en) * | 2018-06-13 | 2019-12-20 | 杭州海康威视***技术有限公司 | Video data storage method and device in cloud storage system |
US11122120B2 (en) | 2019-05-28 | 2021-09-14 | International Business Machines Corporation | Object notification wherein compare and swap is performed |
US11429417B2 (en) | 2019-07-31 | 2022-08-30 | Rubrik, Inc. | Asynchronous input and output for snapshots of virtual machines |
US11429418B2 (en) * | 2019-07-31 | 2022-08-30 | Rubrik, Inc. | Asynchronous input and output for snapshots of virtual machines |
CN111263184B (en) * | 2020-02-27 | 2021-04-16 | 腾讯科技(深圳)有限公司 | Method, device and equipment for detecting coding and decoding consistency |
US11734117B2 (en) * | 2021-04-29 | 2023-08-22 | Vast Data Ltd. | Data recovery in a storage system |
Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110072208A1 (en) * | 2009-09-24 | 2011-03-24 | Vmware, Inc. | Distributed Storage Resource Scheduler and Load Balancer |
US20120102316A1 (en) * | 2010-06-09 | 2012-04-26 | Cleversafe, Inc. | Storing encoded data slices in a dispersed storage network |
US20120198197A1 (en) * | 2011-02-01 | 2012-08-02 | Cleversafe, Inc. | Transferring data in response to detection of a memory system imbalance |
US20120254690A1 (en) * | 2011-04-01 | 2012-10-04 | Cleversafe, Inc. | Utilizing local memory and dispersed storage memory to access encoded data slices |
US20140351632A1 (en) * | 2010-02-27 | 2014-11-27 | Cleversafe, Inc. | Storing data in multiple formats including a dispersed storage format |
US20150046769A1 (en) * | 2011-04-01 | 2015-02-12 | Cleversafe, Inc. | Pre-fetching data segments stored in a dispersed storage network |
US20150067101A1 (en) * | 2013-08-29 | 2015-03-05 | Cleversafe, Inc. | Dispersed storage based on estimated life and methods for use therewith |
US20150301748A1 (en) * | 2014-04-21 | 2015-10-22 | Samsung Electronics Co., Ltd. | Storage operating system |
US20170153837A1 (en) * | 2015-11-30 | 2017-06-01 | International Business Machines Corporation | Using pseudo dsn memory units to handle data in motion within a dsn memory |
US20170359438A1 (en) * | 2009-10-29 | 2017-12-14 | International Business Machines Corporation | Determining how to service requests based on several indicators |
Family Cites Families (102)
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 |
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 |
US6374336B1 (en) | 1997-12-24 | 2002-04-16 | Avid Technology, Inc. | Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner |
US6415373B1 (en) | 1997-12-24 | 2002-07-02 | Avid Technology, Inc. | Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner |
CA2341014A1 (en) | 1998-08-19 | 2000-03-02 | Alexander Roger Deas | A system and method for defining transforms 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 |
US6609223B1 (en) | 1999-04-06 | 2003-08-19 | Kencast, Inc. | Method for packet-level fec encoding, in which on a source packet-by-source packet basis, the error correction contributions of a source packet to a plurality of wildcard packets are computed, and the source packet is transmitted thereafter |
US6571282B1 (en) | 1999-08-31 | 2003-05-27 | Accenture Llp | Block-based communication in a communication services patterns environment |
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 |
DE60131900T2 (en) | 2000-10-26 | 2008-12-04 | Flood, James C. jun., Portland | 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 |
US7140044B2 (en) | 2000-11-13 | 2006-11-21 | Digital Doors, Inc. | Data security system and method for separation of user communities |
US7146644B2 (en) | 2000-11-13 | 2006-12-05 | Digital Doors, Inc. | Data security system and method responsive to electronic attacks |
US7103915B2 (en) | 2000-11-13 | 2006-09-05 | Digital Doors, Inc. | Data security system and method |
GB2369206B (en) | 2000-11-18 | 2004-11-03 | Ibm | Method for rebuilding meta-data in a data storage system and a data storage system |
US6785783B2 (en) | 2000-11-30 | 2004-08-31 | International Business Machines Corporation | NUMA system with redundant main memory architecture |
US7080101B1 (en) | 2000-12-01 | 2006-07-18 | Ncr Corp. | Method and apparatus for partitioning data for storage in a database |
US20020080888A1 (en) | 2000-12-22 | 2002-06-27 | Li Shu | Message splitting and spatially diversified message routing for increasing transmission assurance and data security over distributed networks |
US6857059B2 (en) | 2001-01-11 | 2005-02-15 | Yottayotta, Inc. | Storage virtualization system and methods |
US20020174295A1 (en) | 2001-01-29 | 2002-11-21 | Ulrich Thomas R. | Enhanced file system failure tolerance |
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 |
US6876656B2 (en) * | 2001-06-15 | 2005-04-05 | Broadcom Corporation | Switch assisted frame aliasing for storage virtualization |
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 |
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 |
US7321926B1 (en) * | 2002-02-11 | 2008-01-22 | Extreme Networks | Method of and system for allocating resources to resource requests |
AU2003263800B2 (en) | 2002-07-29 | 2008-08-21 | Robert Halford | Multi-dimensional data protection and mirroring method for micro level data |
US7051155B2 (en) | 2002-08-05 | 2006-05-23 | Sun Microsystems, Inc. | Method and system for striping data to accommodate integrity metadata |
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 |
EP1668486A2 (en) | 2003-08-14 | 2006-06-14 | Compellent Technologies | Virtual disk drive system and method |
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 |
JP4446839B2 (en) | 2004-08-30 | 2010-04-07 | 株式会社日立製作所 | Storage device and storage management device |
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 |
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 |
US7574570B2 (en) | 2005-09-30 | 2009-08-11 | Cleversafe Inc | Billing system for information dispersal system |
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 |
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 |
US7574579B2 (en) | 2005-09-30 | 2009-08-11 | Cleversafe, Inc. | Metadata management system for an information dispersed storage system |
US7904475B2 (en) | 2007-10-09 | 2011-03-08 | Cleversafe, Inc. | Virtualized data storage vaults on a dispersed data storage network |
US20070214285A1 (en) | 2006-03-08 | 2007-09-13 | Omneon Video Networks | Gateway server |
US7979771B2 (en) * | 2006-04-04 | 2011-07-12 | Permabit Technology Corporation | Erasure coding technique for scalable and fault tolerant storage system |
US8549351B2 (en) * | 2007-10-09 | 2013-10-01 | Cleversafe, Inc. | Pessimistic data reading in a dispersed storage network |
WO2009109684A1 (en) * | 2008-03-05 | 2009-09-11 | Media Patents, S. L. | Method for monitoring or managing devices connected to a data network |
US10395054B2 (en) * | 2011-06-06 | 2019-08-27 | Pure Storage, Inc. | Updating distributed storage network software |
US8938675B2 (en) * | 2009-06-16 | 2015-01-20 | Harman International Industries, Incorporated | System for automated generation of audio/video control interfaces |
US9043489B2 (en) * | 2009-10-30 | 2015-05-26 | Cleversafe, Inc. | Router-based dispersed storage network method and apparatus |
US8479078B2 (en) * | 2009-10-30 | 2013-07-02 | Cleversafe, Inc. | Distributed storage network for modification of a data object |
US9311185B2 (en) * | 2009-10-30 | 2016-04-12 | Cleversafe, Inc. | Dispersed storage unit solicitation method and apparatus |
US8589637B2 (en) * | 2009-10-30 | 2013-11-19 | Cleversafe, Inc. | Concurrent set storage in distributed storage network |
US10158648B2 (en) * | 2009-12-29 | 2018-12-18 | International Business Machines Corporation | Policy-based access in a dispersed storage network |
US9092386B2 (en) * | 2010-04-26 | 2015-07-28 | Cleversafe, Inc. | Indicating an error within a dispersed storage network |
US9047218B2 (en) * | 2010-04-26 | 2015-06-02 | Cleversafe, Inc. | Dispersed storage network slice name verification |
US8938552B2 (en) * | 2010-08-02 | 2015-01-20 | Cleversafe, Inc. | Resolving a protocol issue within a dispersed storage network |
US9231768B2 (en) * | 2010-06-22 | 2016-01-05 | International Business Machines Corporation | Utilizing a deterministic all or nothing transformation in a dispersed storage network |
US8782106B2 (en) * | 2010-07-02 | 2014-07-15 | Code Systems Corporation | Method and system for managing execution of virtual applications |
US9571230B2 (en) * | 2010-10-06 | 2017-02-14 | International Business Machines Corporation | Adjusting routing of data within a network path |
US8677214B2 (en) * | 2011-10-04 | 2014-03-18 | Cleversafe, Inc. | Encoding data utilizing a zero information gain function |
US8607122B2 (en) * | 2011-11-01 | 2013-12-10 | Cleversafe, Inc. | Accessing a large data object in a dispersed storage network |
US9798616B2 (en) * | 2011-11-01 | 2017-10-24 | International Business Machines Corporation | Wireless sending a set of encoded data slices |
US9584326B2 (en) * | 2011-11-28 | 2017-02-28 | International Business Machines Corporation | Creating a new file for a dispersed storage network |
US9298548B2 (en) * | 2011-12-12 | 2016-03-29 | Cleversafe, Inc. | Distributed computing in a distributed storage and task network |
WO2013118195A1 (en) * | 2012-02-10 | 2013-08-15 | Hitachi, Ltd. | Storage management method and storage system in virtual volume having data arranged astride storage devices |
US8554963B1 (en) * | 2012-03-23 | 2013-10-08 | DSSD, Inc. | Storage system with multicast DMA and unified address space |
US8370567B1 (en) * | 2012-03-23 | 2013-02-05 | DSSD, Inc. | Storage system with self describing data |
US8935761B2 (en) * | 2012-06-25 | 2015-01-13 | Cleversafe, Inc. | Accessing storage nodes in an on-line media storage system |
CA2867585A1 (en) * | 2013-10-15 | 2015-04-15 | Coho Data Inc. | Methods, devices and systems for coordinating network-based communication in distributed server systems with sdn switching |
US9819722B2 (en) * | 2014-12-23 | 2017-11-14 | Dell Products, L.P. | System and method for controlling an information handling system in response to environmental events |
US20170083603A1 (en) * | 2015-09-18 | 2017-03-23 | Qualcomm Incorporated | Co-derived data storage patterns for distributed storage systems |
-
2016
- 2016-10-24 US US15/332,557 patent/US10409514B2/en active Active
- 2016-11-01 US US15/340,628 patent/US20170155719A1/en not_active Abandoned
- 2016-11-01 US US15/340,310 patent/US10496308B2/en not_active Expired - Fee Related
- 2016-11-01 US US15/340,017 patent/US10216443B2/en not_active Expired - Fee Related
- 2016-11-16 US US15/353,024 patent/US10216444B2/en active Active
- 2016-11-21 US US15/356,929 patent/US9971538B2/en active Active
- 2016-11-21 US US15/357,670 patent/US20170155709A1/en not_active Abandoned
- 2016-11-21 US US15/357,293 patent/US9933969B2/en not_active Expired - Fee Related
- 2016-11-29 US US15/363,622 patent/US10073645B2/en not_active Expired - Fee Related
-
2018
- 2018-02-20 US US15/899,626 patent/US10387063B2/en not_active Expired - Fee Related
-
2019
- 2019-01-18 US US16/251,831 patent/US20190163389A1/en not_active Abandoned
Patent Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110072208A1 (en) * | 2009-09-24 | 2011-03-24 | Vmware, Inc. | Distributed Storage Resource Scheduler and Load Balancer |
US20170359438A1 (en) * | 2009-10-29 | 2017-12-14 | International Business Machines Corporation | Determining how to service requests based on several indicators |
US10389845B2 (en) * | 2009-10-29 | 2019-08-20 | Pure Storage, Inc. | Determining how to service requests based on several indicators |
US20140351632A1 (en) * | 2010-02-27 | 2014-11-27 | Cleversafe, Inc. | Storing data in multiple formats including a dispersed storage format |
US20120102316A1 (en) * | 2010-06-09 | 2012-04-26 | Cleversafe, Inc. | Storing encoded data slices in a dispersed storage network |
US20120198197A1 (en) * | 2011-02-01 | 2012-08-02 | Cleversafe, Inc. | Transferring data in response to detection of a memory system imbalance |
US20120254690A1 (en) * | 2011-04-01 | 2012-10-04 | Cleversafe, Inc. | Utilizing local memory and dispersed storage memory to access encoded data slices |
US20150046769A1 (en) * | 2011-04-01 | 2015-02-12 | Cleversafe, Inc. | Pre-fetching data segments stored in a dispersed storage network |
US20150067101A1 (en) * | 2013-08-29 | 2015-03-05 | Cleversafe, Inc. | Dispersed storage based on estimated life and methods for use therewith |
US20150301748A1 (en) * | 2014-04-21 | 2015-10-22 | Samsung Electronics Co., Ltd. | Storage operating system |
US20170153837A1 (en) * | 2015-11-30 | 2017-06-01 | International Business Machines Corporation | Using pseudo dsn memory units to handle data in motion within a dsn memory |
Also Published As
Publication number | Publication date |
---|---|
US20190163389A1 (en) | 2019-05-30 |
US20170153853A1 (en) | 2017-06-01 |
US20180188992A1 (en) | 2018-07-05 |
US20170153837A1 (en) | 2017-06-01 |
US9933969B2 (en) | 2018-04-03 |
US10387063B2 (en) | 2019-08-20 |
US10216443B2 (en) | 2019-02-26 |
US10073645B2 (en) | 2018-09-11 |
US9971538B2 (en) | 2018-05-15 |
US20170153943A1 (en) | 2017-06-01 |
US20170153937A1 (en) | 2017-06-01 |
US20170153828A1 (en) | 2017-06-01 |
US10409514B2 (en) | 2019-09-10 |
US20170155520A1 (en) | 2017-06-01 |
US20170155709A1 (en) | 2017-06-01 |
US10216444B2 (en) | 2019-02-26 |
US20170153948A1 (en) | 2017-06-01 |
US10496308B2 (en) | 2019-12-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10387080B2 (en) | Rebuilding slices in a dispersed storage network | |
US10489070B2 (en) | Proxying read requests when performance or availability failure is anticipated | |
US10496308B2 (en) | Using pseudo DSN memory units to handle data in motion within a DSN memory | |
US20170091032A1 (en) | Generating additional slices based on data access frequency | |
US10616330B2 (en) | Utilizing tree storage structures in a dispersed storage network | |
US20170063991A1 (en) | Utilizing site write thresholds in a dispersed storage network | |
US10642489B2 (en) | Determining when to initiate an intra-distributed storage unit rebuild vs. an inter-distributed storage unit rebuild | |
US10748055B2 (en) | Validating system registry files in a dispersed storage network | |
US20190026102A1 (en) | Upgrading devices in a dispersed storage network | |
US10268554B2 (en) | Using dispersed computation to change dispersal characteristics | |
US10057351B2 (en) | Modifying information dispersal algorithm configurations in a dispersed storage network | |
US10417253B2 (en) | Multi-level data storage in a dispersed storage network | |
US20190056996A1 (en) | Managing unavailable storage in a dispersed storage network | |
US10127112B2 (en) | Assigning prioritized rebuild resources optimally | |
US20170003915A1 (en) | Retrieving data in a dispersed storage network | |
US10459792B2 (en) | Using an eventually consistent dispersed memory to implement storage tiers | |
US11232093B2 (en) | Slice migration in a dispersed storage network | |
US10387071B2 (en) | On-the-fly cancellation of unnecessary read requests | |
US10402393B2 (en) | Slice migration in a dispersed storage network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HEGDE, HARSHA;REEL/FRAME:040189/0641 Effective date: 20161027 |
|
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 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
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 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO PAY ISSUE FEE |