US20190026102A1 - Upgrading devices in a dispersed storage network - Google Patents

Upgrading devices in a dispersed storage network Download PDF

Info

Publication number
US20190026102A1
US20190026102A1 US16/143,754 US201816143754A US2019026102A1 US 20190026102 A1 US20190026102 A1 US 20190026102A1 US 201816143754 A US201816143754 A US 201816143754A US 2019026102 A1 US2019026102 A1 US 2019026102A1
Authority
US
United States
Prior art keywords
slices
storage unit
list
storage
memory
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.)
Pending
Application number
US16/143,754
Inventor
Andrew D. Baptist
Bart R. Cilfone
Thomas D. Cocagne
Sanjaya Kumar
Manish Motwani
Andrew G. Peake
Jason K. Resch
Thomas F. Shirley, Jr.
Sebastien Vas
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Pure Storage Inc
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to US201261605856P priority Critical
Priority to US13/775,491 priority patent/US10089344B2/en
Priority to US15/217,052 priority patent/US10157051B2/en
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to US16/143,754 priority patent/US20190026102A1/en
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: VAS, SEBASTIEN, MOTWANI, MANISH, BAPTIST, ANDREW D., CILFONE, BART R., KUMAR, SANJAYA, PEAKE, ANDREW G., RESCH, JASON K., SHIRLEY, THOMAS F., JR., COCAGNE, THOMAS D.
Publication of US20190026102A1 publication Critical patent/US20190026102A1/en
Assigned to PURE STORAGE, INC. reassignment PURE STORAGE, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: INTERNATIONAL BUSINESS MACHINES CORPORATION
Assigned to PURE STORAGE, INC. reassignment PURE STORAGE, INC. CORRECTIVE ASSIGNMENT TO CORRECT THE DELETE 15/174/279 AND 15/174/596 PROPERTY NUMBERS PREVIOUSLY RECORDED AT REEL: 49555 FRAME: 530. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Assignors: INTERNATIONAL BUSINESS MACHINES CORPORATION
Assigned to BARCLAYS BANK PLC AS ADMINISTRATIVE AGENT reassignment BARCLAYS BANK PLC AS ADMINISTRATIVE AGENT SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: PURE STORAGE, INC.
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/60Software deployment
    • G06F8/65Updates
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error 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/0706Error 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/0727Error 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
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error 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/0751Error or fault detection not based on redundancy
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error 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/0766Error or fault reporting or storing
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/13File access structures, e.g. distributed indices
    • G06F16/137Hash-based
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/18File system types
    • G06F16/182Distributed file systems
    • G06F16/1824Distributed file systems implemented using Network-attached Storage [NAS] architecture
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • G06F16/2365Ensuring data consistency and integrity
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures
    • G06F16/9027Trees
    • G06F17/30097
    • G06F17/30197
    • G06F17/30371
    • G06F17/30961
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from or digital output to record carriers, e.g. RAID, emulated record carriers, networked record carriers
    • G06F3/0601Dedicated interfaces to storage systems
    • G06F3/0668Dedicated interfaces to storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H04L67/1097Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for distributed storage of data in a network, e.g. network file system [NFS], transport mechanisms for storage area networks [SAN] or network attached storage [NAS]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/34Network-specific arrangements or communication protocols supporting networked applications involving the movement of software or configuration parameters
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1076Parity data used in redundant arrays of independent storages, e.g. in RAID systems

Abstract

A method for execution by a dispersed storage and task (DST) processing unit includes obtaining distributed storage and task network (DSTN) address range information for each memory device of a set of memory devices associated with a storage unit targeted for an upgrade; obtaining a list of slice names associated with selected slices stored in each memory device of the storage unit; retrieving the selected slices associated with the list of slice names; generating an integrity check value for the selected slices; storing one or more of: the integrity check value, the selected slices, or the list of slice names as original integrity information in a memory; and enabling an upgrade sequence of the DST execution unit.

Description

    CROSS REFERENCE TO RELATED PATENTS
  • The present U.S. Utility Patent Application claims priority pursuant to 35 U.S.C. § 120 as a continuation of U.S. Utility application Ser. No. 15/217,052, entitled “UPGRADING DEVICES IN A DISPERSED STORAGE NETWORK,”, filed Jul. 22, 2016, which is a continuation-in-part of U.S. Utility application Ser. No. 13/775,491, entitled “LISTING DATA OBJECTS USING A HIERARCHICAL DISPERSED STORAGE INDEX”, filed Feb. 25, 2013, which claims priority pursuant to 35 U.S.C. § 119(e) to U.S. Provisional Application No. 61/605,856, entitled “UTILIZING AN INDEX OF A DISTRIBUTED STORAGE AND TASK NETWORK”, filed Mar. 2, 2012, all of which are hereby incorporated herein by reference in their entirety and made part of the present U.S. Utility Patent Application for all purposes.
  • STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT
  • Not Applicable
  • INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC
  • Not applicable.
  • BACKGROUND OF THE INVENTION Technical Field of the Invention
  • This invention relates generally to computer networks and more particularly to dispersing error encoded data.
  • Description of Related Art
  • Computing devices are known to communicate data, process data, and/or store data. Such computing devices range from wireless smart phones, laptops, tablets, personal computers (PC), work stations, and video game devices, to data centers that support millions of web searches, stock trades, or on-line purchases every day. In general, a computing device includes a central processing unit (CPU), a memory system, user input/output interfaces, peripheral device interfaces, and an interconnecting bus structure.
  • As is further known, a computer may effectively extend its CPU by using “cloud computing” to perform one or more computing functions (e.g., a service, an application, an algorithm, an arithmetic logic function, etc.) on behalf of the computer. Further, for large services, applications, and/or functions, cloud computing may be performed by multiple cloud computing resources in a distributed manner to improve the response time for completion of the service, application, and/or function. For example, Hadoop is an open source software framework that supports distributed applications enabling application execution by thousands of computers.
  • In addition to cloud computing, a computer may use “cloud storage” as part of its memory system. As is known, cloud storage enables a user, via its computer, to store files, applications, etc. on an Internet storage system. The Internet storage system may include a RAID (redundant array of independent disks) system and/or a dispersed storage system that uses an error correction scheme to encode data for storage.
  • BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)
  • 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 an embodiment of a dispersed or distributed storage network (DSN) in accordance with the present invention;
  • FIG. 10A is a flowchart illustrating an example of preparing for an upgrade in accordance with the present invention; and
  • FIG. 10B is a flowchart illustrating an example of verifying an upgrade in accordance with the present invention.
  • DETAILED DESCRIPTION OF THE 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).
  • The DSN memory 22 includes a plurality of storage units 36 that may be located at geographically different sites (e.g., one in Chicago, one in Milwaukee, etc.), at a common site, or a combination thereof. For example, if the DSN memory 22 includes eight storage units 36, each storage unit is located at a different site. As another example, if the DSN memory 22 includes eight storage units 36, all eight storage units are located at the same site. As yet another example, if the DSN memory 22 includes eight storage units 36, a first pair of storage units are at a first common site, a second pair of storage units are at a second common site, a third pair of storage units are at a third common site, and a fourth pair of storage units are at a fourth common site. Note that a DSN memory 22 may include more or less than eight storage units 36. Further note that each storage unit 36 includes a computing core (as shown in FIG. 2, or components thereof) and a plurality of memory devices for storing dispersed error encoded data.
  • In various embodiments, each of the storage units operates as a distributed storage and task (DST) execution unit, and is operable to store dispersed error encoded data and/or to execute, in a distributed manner, one or more tasks on data. The tasks may be a simple function (e.g., a mathematical function, a logic function, an identify function, a find function, a search engine function, a replace function, etc.), a complex function (e.g., compression, human and/or computer language translation, text-to-voice conversion, voice-to-text conversion, etc.), multiple simple and/or complex functions, one or more algorithms, one or more applications, etc. Hereafter, a storage unit may be interchangeably referred to as a DST execution unit and a set of storage units may be interchangeably referred to as a set of DST execution units.
  • Each of the computing devices 12-16, the managing unit 18, and the integrity processing unit 20 include a computing core 26, which includes network interfaces 30-33. Computing devices 12-16 may each be a portable computing device and/or a fixed computing device. A portable computing device may be a social networking device, a gaming device, a cell phone, a smart phone, a digital assistant, a digital music player, a digital video player, a laptop computer, a handheld computer, a tablet, a video game controller, and/or any other portable device that includes a computing core. A fixed computing device may be a computer (PC), a computer server, a cable set-top box, a satellite receiver, a television set, a printer, a fax machine, home entertainment equipment, a video game console, and/or any type of home or office computing equipment. Note that each of the managing unit 18 and the integrity processing unit 20 may be separate computing devices, may be a common computing device, and/or may be integrated into one or more of the computing devices 12-16 and/or into one or more of the storage units 36.
  • Each interface 30, 32, and 33 includes software and hardware to support one or more communication links via the network 24 indirectly and/or directly. For example, interface 30 supports a communication link (e.g., wired, wireless, direct, via a LAN, via the network 24, etc.) between computing devices 14 and 16. As another example, interface 32 supports communication links (e.g., a wired connection, a wireless connection, a LAN connection, and/or any other type of connection to/from the network 24) between computing devices 12 & 16 and the DSN memory 22. As yet another example, interface 33 supports a communication link for each of the managing unit 18 and the integrity processing unit 20 to the network 24.
  • Computing devices 12 and 16 include a dispersed storage (DS) client module 34, which enables the computing device to dispersed storage error encode and decode data as subsequently described with reference to one or more of FIGS. 3-8. In this example embodiment, computing device 16 functions as a dispersed storage processing agent for computing device 14. In this role, computing device 16 dispersed storage error encodes and decodes data on behalf of computing device 14. With the use of dispersed storage error encoding and decoding, the DSN 10 is tolerant of a significant number of storage unit failures (the number of failures is based on parameters of the dispersed storage error encoding function) without loss of data and without the need for a redundant or backup copies of the data. Further, the DSN 10 stores data for an indefinite period of time without data loss and in a secure manner (e.g., the system is very resistant to unauthorized attempts at accessing the data).
  • In operation, the managing unit 18 performs DS management services. For example, the managing unit 18 establishes distributed data storage parameters (e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.) for computing devices 12-14 individually or as part of a group of user devices. As a specific example, the managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within the DSN memory 22 for a user device, a group of devices, or for public access and establishes per vault dispersed storage (DS) error encoding parameters for a vault. The managing unit 18 facilitates storage of DS error encoding parameters for each vault by updating registry information of the DSN 10, where the registry information may be stored in the DSN memory 22, a computing device 12-16, the managing unit 18, and/or the integrity processing unit 20.
  • The 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 DSN 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 DSN managing unit 18 tracks the amount of data stored and/or retrieved by a user device and/or a user group, which can be used to generate a per-data-amount billing information.
  • As another example, the managing unit 18 performs network operations, network administration, and/or network maintenance. Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, storage units, and/or computing devices with a DS client module 34) to/from the DSN 10, and/or establishing authentication credentials for the storage units 36. Network administration includes monitoring devices and/or units for failures, maintaining vault information, determining device and/or unit activation status, determining device and/or unit loading, and/or determining any other system level operation that affects the performance level of the DSN 10. Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of the DSN 10.
  • The integrity processing unit 20 performs rebuilding of ‘bad’ or missing encoded data slices. At a high level, the integrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from the DSN memory 22. For retrieved encoded slices, they are checked for errors due to data corruption, outdated version, etc. If a slice includes an error, it is flagged as a ‘bad’ slice. For encoded data slices that were not received and/or not listed, they are flagged as missing slices. Bad and/or missing slices are subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices to produce rebuilt slices. The rebuilt slices are stored in the DSN memory 22.
  • FIG. 2 is a schematic block diagram of an embodiment of a computing core 26 that includes a processing module 50, a memory controller 52, main memory 54, a video graphics processing unit 55, an input/output (TO) controller 56, a peripheral component interconnect (PCI) interface 58, an IO interface module 60, at least one IO device interface module 62, a read only memory (ROM) basic input output system (BIOS) 64, and one or more memory interface modules. The one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66, a host bus adapter (HBA) interface module 68, a network interface module 70, a flash interface module 72, a hard drive interface module 74, and a DSN interface module 76.
  • The DSN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.). The DSN interface module 76 and/or the network interface module 70 may function as one or more of the interface 30-33 of FIG. 1. Note that the IO device interface module 62 and/or the memory interface modules 66-76 may be collectively or individually referred to as IO ports.
  • FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data. When a computing device 12 or 16 has data to store it disperse storage error encodes the data in accordance with a dispersed storage error encoding process based on dispersed storage error encoding parameters. Here, the computing device stores data object 40, which can include a file (e.g., text, video, audio, etc.), or other data arrangement. The dispersed storage error encoding parameters include an encoding function (e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.), a data segmenting protocol (e.g., data segment size, fixed, variable, etc.), and per data segment encoding values. The per data segment encoding values include a total, or pillar width, number (T) of encoded data slices per encoding of a data segment i.e., in a set of encoded data slices); a decode threshold number (D) of encoded data slices of a set of encoded data slices that are needed to recover the data segment; a read threshold number (R) of encoded data slices to indicate a number of encoded data slices per set to be read from storage for decoding of the data segment; and/or a write threshold number (W) to indicate a number of encoded data slices per set that must be accurately stored before the encoded data segment is deemed to have been properly stored. The dispersed storage error encoding parameters may further include slicing information (e.g., the number of encoded data slices that will be created for each data segment) and/or slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).
  • In the present example, Cauchy Reed-Solomon has been selected as the encoding function (a generic example is shown in FIG. 4 and a specific example is shown in FIG. 5); the data segmenting protocol is to divide the data object into fixed sized data segments; and the per data segment encoding values include: a pillar width of 5, a decode threshold of 3, a read threshold of 4, and a write threshold of 4. In accordance with the data segmenting protocol, the computing device 12 or 16 divides data object 40 into a plurality of fixed sized data segments (e.g., 1 through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more). The number of data segments created is dependent of the size of the data and the data segmenting protocol.
  • The computing device 12 or 16 then disperse storage error encodes a data segment using the selected encoding function (e.g., Cauchy Reed-Solomon) to produce a set of encoded data slices. FIG. 4 illustrates a generic Cauchy Reed-Solomon encoding function, which includes an encoding matrix (EM), a data matrix (DM), and a coded matrix (CM). The size of the encoding matrix (EM) is dependent on the pillar width number (T) and the decode threshold number (D) of selected per data segment encoding values. To produce the data matrix (DM), the data segment is divided into a plurality of data blocks and the data blocks are arranged into D number of rows with Z data blocks per row. Note that Z is a function of the number of data blocks created from the data segment and the decode threshold number (D). The coded matrix is produced by matrix multiplying the data matrix by the encoding matrix.
  • FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encoding with a pillar number (T) of five and decode threshold number of three. In this example, a first data segment is divided into twelve data blocks (D1-D12). The coded matrix includes five rows of coded data blocks, where the first row of X11-X14 corresponds to a first encoded data slice (EDS 1_1), the second row of X21-X24 corresponds to a second encoded data slice (EDS 2_1), the third row of X31-X34 corresponds to a third encoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to a fourth encoded data slice (EDS 4_1), and the fifth row of X51-X54 corresponds to a fifth encoded data slice (EDS 5_1). Note that the second number of the EDS designation corresponds to the data segment number.
  • Returning to the discussion of FIG. 3, the computing device also creates a slice name (SN) for each encoded data slice (EDS) in the set of encoded data slices. A typical format for a slice name 80 is shown in FIG. 6. As shown, the slice name (SN) 80 includes a pillar number of the encoded data slice (e.g., one of 1-T), a data segment number (e.g., one of 1-Y), a vault identifier (ID), a data object identifier (ID), and may further include revision level information of the encoded data slices. The slice name functions as, at least part of, a DSN address for the encoded data slice for storage and retrieval from the DSN memory 22.
  • As a result of encoding, the computing device 12 or 16 produces a plurality of sets of encoded data slices, which are provided with their respective slice names to the storage units for storage. As shown, the first set of encoded data slices includes EDS 1_1 through EDS 5_1 and the first set of slice names includes SN 1_1 through SN 5_1 and the last set of encoded data slices includes EDS 1_Y through EDS 5_Y and the last set of slice names includes SN 1_Y through SN 5_Y.
  • FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of a data object that was dispersed storage error encoded and stored in the example of FIG. 4. In this example, the computing device 12 or 16 retrieves from the storage units at least the decode threshold number of encoded data slices per data segment. As a specific example, the computing device retrieves a read threshold number of encoded data slices.
  • To recover a data segment from a decode threshold number of encoded data slices, the computing device uses a decoding function as shown in FIG. 8. As shown, the decoding function is essentially an inverse of the encoding function of FIG. 4. The coded matrix includes a decode threshold number of rows (e.g., three in this example) and the decoding matrix in an inversion of the encoding matrix that includes the corresponding rows of the coded matrix. For example, if the coded matrix includes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2, and 4, and then inverted to produce the decoding matrix.
  • FIG. 9 is a schematic block diagram of another embodiment of a dispersed storage network (DSN) that includes a computing device 16 of FIG. 1, the network 24 of FIG. 1, and a plurality of storage units 1-n. Each computing device 16 can include the interface 32 of FIG. 1, the computing core 26 of FIG. 1, and the DS client module 34 of FIG. 1. The computing device 16 can function as a dispersed storage processing agent for computing device 14 as described previously, and may hereafter be referred to as a distributed storage and task (DST) processing unit. Each storage unit may be implemented utilizing the storage unit 36 of FIG. 1. The DSN functions to upgrade the storage units 1-n from time to time when hardware and/or software upgrades become available. In particular, the integrity of the storage units 1-n can be checked prior to, in preparation for an upgrade, and after an upgrade has taken place. IN the example shown, selected slices for storage unit one are retrieved in the performance of such an integrity check.
  • In various embodiments, a processing system of a dispersed storage and task (DST) processing unit includes at least one processor and a memory that stores operational instructions, that when executed by the at least one processor cause the processing system to obtain distributed storage and task network (DSTN) address range information for each memory device of a set of memory devices associated with a storage unit targeted for an upgrade; obtain a list of slice names associated with selected slices stored in each memory device of the storage unit; retrieve the selected slices associated with the list of slice names; generate an integrity check value for the selected slices; store one or more of: the integrity check value, the selected slices, or the list of slice names as original integrity information; and enable an upgrade sequence of the storage unit.
  • In various embodiments, obtaining the DSTN address range information includes at least one of: receiving the address range information, performing a lookup in a DSTN address to physical location table, generating an address range request, retrieving an address range of a previous upgrade, or initiating a query requesting the DSTN address range information. Obtaining the list of the selected slice names can include selecting a portion of the address range based on the DSTN address range information, generating a list request, sending the list request to the storage unit, and receiving a list response from the storage unit that includes the list of the selected slice names. Retrieving the selected slices can include generating read slice requests that includes the selected slice names, sending the read slice requests to the storage unit, and receiving the selected slices from the storage.
  • In addition, the selected slices can include two or more slices for a corresponding slice name of the list of the selected slice names when more than one revision is associated with the corresponding slice name. The original integrity information can be stored in a memory associated with one of: the storage unit, a DST client module of the DST processing unit, or another storage unit. Generating the integrity check value can utilize a hashing function to produce a hash value over the selected slices as the integrity check value. Enabling the upgrade sequence can include at least one of: caching new slices being written to the storage unit prior to the upgrade sequence, or sending the new slices to an alternate storage unit.
  • The processing system can further operate by retrieving additional integrity information for the storage unit; and comparing the additional integrity information to the original integrity information, and indicating an unfavorable condition when the comparison is unfavorable. In various embodiments, the additional integrity information can be retrieved for the storage unit after the upgrade sequence. The processing system can further operate by determining that the additional integrity information compares unfavorably to the original integrity information when the integrity check value fails to match an additional integrity check value included in the additional integrity information; initiating a rebuilding process when the additional integrity information compares unfavorably to the original integrity information, when the additional integrity information compares unfavorably to the original integrity information, identifying not corrupted slices of the storage unit; and/or generating an indication that the upgrade sequence was successful with respect to the not corrupted slices of the storage unit.
  • While the DST processing unit is described above in conjunction with the operation of computing unit 16, the audit objects may likewise be generated by other DST processing units, including integrity processing unit 20 and/or managing unit 18 of FIG. 1.
  • FIG. 10A is a flowchart illustrating an example of preparing for an upgrade. In particular, a method is presented for use in conjunction with one or more functions and features described in conjunction with FIGS. 1-9 is presented for execution by a dispersed storage and task (DST) processing unit that includes a processor or via another processing system of a dispersed storage network that includes at least one processor and memory that stores instruction that configure the processor or processors to perform the steps described below. Step 830 includes obtaining distributed storage and task network (DSTN) address range information for each memory device of a set of memory devices associated with a DST execution unit targeted for an upgrade (e.g., a software upgrade, a hardware upgrade). The obtaining can include at least one of receiving the address range information, performing a lookup in a DSTN address to physical location table, generating an address range request, retrieving an address range of a previous upgrade, or initiating a query.
  • Step 832 includes obtaining a list of at least some slice names associated with slices stored in each memory device of the DST execution unit. The obtaining can include includes selecting a portion of the address range based on the DSTN address range information, generating a list request, sending the list request to the DST execution unit, and receiving a list response from the DST execution unit that includes the list of at least some of the slice names. Step 834 includes retrieving the slices associated with the at least some of the slice names. The retrieving can include generating read slice requests that includes the slice names, sending the resource requests to the DST execution unit, and receiving the slices from the DST execution unit. The slices may include two or more slices for each slice name when more than one revision is associated with the slice name.
  • Step 836 includes generating an integrity check value for the slices. For example, the processing module utilizes a hashing function to produce a hash value over the slices as the integrity check value. Step 838 includes storing one or more of the integrity check failure, the slices, and the slice names as integrity information in a local memory (e.g., in one or more of the DST execution unit, a memory associated with a DST client module, in one or more other DST execution units). Step 840 includes enabling an upgrade sequence of the DST execution unit. The enabling may include caching new slices being written to the DST execution unit prior to the upgrade sequence. The caching may include sending the new slices to an alternate DST execution unit.
  • FIG. 10B is a flowchart illustrating an example of verifying an upgrade, which include similar steps to FIG. 10A. In particular, a method is presented for use in conjunction with one or more functions and features described in conjunction with FIGS. 1-9 is presented for execution by a dispersed storage and task (DST) processing unit that includes a processor or via another processing system of a dispersed storage network that includes at least one processor and memory that stores instruction that configure the processor or processors to perform the steps described below. Step 842 includes retrieving integrity information for a DST execution unit as retrieved integrity information. The retrieving can include identifying a storage location and sending a bigger information retrieval request to the storage location. The method continues with the steps 830-836 of FIG. 10A of obtaining distributed storage and task network (DSTN) address range information for each vault of each memory device of a set of memory devices of the DST execution unit (e.g., utilizing slice names of the retrieved integrity information), obtaining a list of at least some slice names associated with slices stored on each memory device of the DST execution unit, retrieving the slices associated with the at least some of the slice names, and generating an integrity check value for the slices.
  • Step 844 includes combining the integrity check value, the slices, and the slice names as integrity information. Step 846 includes comparing the integrity information compares to the retrieved integrity information, and indicating an unfavorable condition when the comparison is unfavorable. The method can determine that the integrity information compares unfavorably to the retrieved integrity information when an integrity check value is not substantially the same as the retrieved integrity check value for at least one memory device. In addition, the method may initiate a rebuilding process when the integrity information compares unfavorably to the retrieved integrity information. Alternatively, when the processing system determines that the integrity information compares favorably to the retrieved integrity information, the processing system generates an indication that the upgrade was successful with respect to not corrupting slices stored in the DST execution unit.
  • In various embodiments, a non-transitory computer readable storage medium includes at least one memory section that stores operational instructions that, when executed by a processing system of a dispersed storage network (DSN) that includes a processor and a memory, causes the processing system to obtain distributed storage and task network (DSTN) address range information for each memory device of a set of memory devices associated with a storage unit targeted for an upgrade; obtain a list of slice names associated with selected slices stored in each memory device of the storage unit; retrieve the selected slices associated with the list of slice names; generate an integrity check value for the selected slices; store one or more of: the integrity check value, the selected slices, or the list of slice names as original integrity information; and enable an upgrade sequence of 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 than signal 2, a favorable comparison may be achieved when the magnitude of signal 1 is greater than that of signal 2 or when the magnitude of signal 2 is less than that of signal 1. As may be used herein, the term “compares unfavorably”, indicates that a comparison between two or more items, signals, etc., fails to provide the desired relationship.
  • As may 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)

What is claimed is:
1. A method for execution by a dispersed storage and task (DST) processing unit that includes a processor, the method comprises:
obtaining a list of slice names associated with selected slices stored in a storage unit, wherein a data segment was dispersed storage error encoded to produce a set of encoded data slices for storage in a set of storage units that includes the storage unit, and wherein the set of encoded data slices includes at least one of the selected slices;
retrieving the selected slices associated with the list of slice names;
generating an integrity check value for the selected slices;
storing one or more of: the integrity check value, the selected slices, or the list of slice names as original integrity information in a memory;
enabling an upgrade sequence of the storage unit;
retrieving additional integrity information for the storage unit; and
comparing the additional integrity information to the original integrity information, and indicating an unfavorable condition when the comparison is unfavorable.
2. The method of claim 1 wherein the storage unit is targeted for an upgrade.
3. The method of claim 1 wherein obtaining the list of the selected slice names includes selecting a portion of an address range based on DSTN address range information, generating a list request, sending the list request to the storage unit, and receiving a list response from the storage unit that includes the list of the selected slice names.
4. The method of claim 1 wherein retrieving the selected slices includes generating read slice requests that includes the selected slice names, sending the read slice requests to the storage unit, and receiving the selected slices from the storage.
5. The method of claim 1 wherein the selected slices include two or more slices for a corresponding slice name of the list of the selected slice names when more than one revision is associated with the corresponding slice name.
6. The method of claim 1 wherein the memory is associated with one of: the storage unit, a DST client module of the DST processing unit, or another storage unit.
7. The method of claim 1 wherein generating the integrity check value utilizes a hashing function to produce a hash value over the selected slices as the integrity check value.
8. The method of claim 1 wherein enabling the upgrade sequence includes at least one of: caching new slices being written to the storage unit prior to the upgrade sequence, or sending the new slices to an alternate storage unit.
9. The method of claim 1 further comprising:
when the additional integrity information compares unfavorably to the original integrity information, identifying not corrupted slices of the storage unit.
10. The method of claim 9 further comprising:
generating an indication that the upgrade sequence was successful with respect to the not corrupted slices of the storage unit.
11. The method of claim 1 wherein the additional integrity information is retrieved for the storage unit after the upgrade sequence.
12. The method of claim 1 further comprising:
determining that the additional integrity information compares unfavorably to the original integrity information when the integrity check value fails to match an additional integrity check value included in the additional integrity information.
13. The method of claim 1 further comprising:
initiating a rebuilding process when the additional integrity information compares unfavorably to the original integrity information.
14. A processing system of a dispersed storage and task (DST) processing unit comprises:
at least one processor;
a memory that stores operational instructions, that when executed by the at least one processor cause the processing system to:
obtain a list of slice names associated with selected slices stored in a storage unit, wherein a data segment was dispersed storage error encoded to produce a set of encoded data slices for storage in a set of storage units that includes the storage unit, and wherein the set of encoded data slices includes at least one of the selected slices;
retrieve the selected slices associated with the list of slice names;
generate an integrity check value for the selected slices;
store one or more of: the integrity check value, the selected slices, or the list of slice names as original integrity information;
enable an upgrade sequence of the storage unit;
retrieve additional integrity information for the storage unit; and
compare the additional integrity information to the original integrity information, and indicate an unfavorable condition when the comparison is unfavorable.
15. The processing system of claim 14 wherein obtaining the DSTN address range information includes at least one of: receiving the DSTN address range information, performing a lookup in a DSTN address to physical location table, generating an address range request, retrieving an address range of a previous upgrade, or initiating a query requesting the DSTN address range information.
16. The processing system of claim 14 wherein obtaining the list of the selected slice names includes selecting a portion of an address range based on DSTN address range information, generating a list request, sending the list request to the storage unit, and receiving a list response from the storage unit that includes the list of the selected slice names.
17. The processing system of claim 14 wherein retrieving the selected slices includes generating read slice requests that includes the selected slice names, sending the read slice requests to the storage unit, and receiving the selected slices from the storage.
18. The processing system of claim 14 wherein the selected slices include two or more slices for a corresponding slice name of the list of the selected slice names when more than one revision is associated with the corresponding slice name.
19. The processing system of claim 14 wherein enabling the upgrade sequence includes at least one of: caching new slices being written to the storage unit prior to the upgrade sequence, or sending the new slices to an alternate storage unit.
20. A non-transitory computer readable storage medium comprises:
at least one memory section that stores operational instructions that, when executed by a processing system of a dispersed storage network (DSN) that includes a processor and a memory, causes the processing system to:
obtain a list of slice names associated with selected slices stored in a storage unit, wherein a data segment was dispersed storage error encoded to produce a set of encoded data slices for storage in a set of storage units that includes the storage unit, and wherein the set of encoded data slices includes at least one of the selected slices;
retrieve the selected slices associated with the list of slice names;
generate an integrity check value for the selected slices;
store one or more of: the integrity check value, the selected slices, or the list of slice names as original integrity information in a memory;
enable an upgrade sequence of the storage unit;
retrieve additional integrity information for the storage unit; and
compare the additional integrity information to the original integrity information, and indicate an unfavorable condition when the comparison is unfavorable.
US16/143,754 2012-03-02 2018-09-27 Upgrading devices in a dispersed storage network Pending US20190026102A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US201261605856P true 2012-03-02 2012-03-02
US13/775,491 US10089344B2 (en) 2012-03-02 2013-02-25 Listing data objects using a hierarchical dispersed storage index
US15/217,052 US10157051B2 (en) 2012-03-02 2016-07-22 Upgrading devices in a dispersed storage network
US16/143,754 US20190026102A1 (en) 2012-03-02 2018-09-27 Upgrading devices in a dispersed storage network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US16/143,754 US20190026102A1 (en) 2012-03-02 2018-09-27 Upgrading devices in a dispersed storage network

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US15/217,052 Continuation US10157051B2 (en) 2012-03-02 2016-07-22 Upgrading devices in a dispersed storage network

Publications (1)

Publication Number Publication Date
US20190026102A1 true US20190026102A1 (en) 2019-01-24

Family

ID=57223272

Family Applications (2)

Application Number Title Priority Date Filing Date
US15/217,052 Active 2033-10-04 US10157051B2 (en) 2012-03-02 2016-07-22 Upgrading devices in a dispersed storage network
US16/143,754 Pending US20190026102A1 (en) 2012-03-02 2018-09-27 Upgrading devices in a dispersed storage network

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US15/217,052 Active 2033-10-04 US10157051B2 (en) 2012-03-02 2016-07-22 Upgrading devices in a dispersed storage network

Country Status (1)

Country Link
US (2) US10157051B2 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107025121B (en) * 2017-03-31 2020-10-09 Oppo广东移动通信有限公司 Software upgrading method and device and electronic device
US10599421B2 (en) * 2017-07-14 2020-03-24 Calamp Corp. Systems and methods for failsafe firmware upgrades

Family Cites Families (90)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4092732A (en) 1977-05-31 1978-05-30 International Business Machines Corporation System for recovering data stored in failed memory unit
US5485474A (en) 1988-02-25 1996-01-16 The President And Fellows Of Harvard College Scheme for information dispersal and reconstruction
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
US6415373B1 (en) 1997-12-24 2002-07-02 Avid Technology, Inc. Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner
US6374336B1 (en) 1997-12-24 2002-04-16 Avid Technology, Inc. Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner
JP3385957B2 (en) * 1998-03-04 2003-03-10 日本電気株式会社 Distributed system, memory management device and method, and recording medium
CA2341014A1 (en) 1998-08-19 2000-03-02 Alexander Roger Deas A system and method for defining transforms of memory device addresses
US6275919B1 (en) * 1998-10-15 2001-08-14 Creative Technology Ltd. Memory storage and retrieval with multiple hashing functions
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
GB2359955B (en) * 2000-03-01 2003-07-23 3Com Corp Network unit including address hashing
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
US20030037261A1 (en) 2001-03-26 2003-02-20 Ilumin Corporation Secured content delivery system and method
US7272613B2 (en) 2000-10-26 2007-09-18 Intel Corporation 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
US7146644B2 (en) 2000-11-13 2006-12-05 Digital Doors, Inc. Data security system and method responsive to electronic attacks
US7140044B2 (en) 2000-11-13 2006-11-21 Digital Doors, Inc. Data security system and method for separation of user communities
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
US6629198B2 (en) * 2000-12-08 2003-09-30 Sun Microsystems, Inc. Data storage system and method employing a write-ahead hash log
US20030084020A1 (en) 2000-12-22 2003-05-01 Li Shu Distributed fault tolerant and secure storage
WO2002065275A1 (en) 2001-01-11 2002-08-22 Yottayotta, Inc. Storage virtualization system and methods
US6745286B2 (en) 2001-01-29 2004-06-01 Snap Appliance, Inc. Interface architecture
US6879596B1 (en) 2001-04-11 2005-04-12 Applied Micro Circuits Corporation System and method for systolic array sorting of information segments
US7024609B2 (en) 2001-04-20 2006-04-04 Kencast, Inc. System for protecting the transmission of live data streams, and upon reception, for reconstructing the live data streams and recording them into files
GB2377049A (en) 2001-06-30 2002-12-31 Hewlett Packard Co Billing for utilisation of a data storage array
US6944785B2 (en) 2001-07-23 2005-09-13 Network Appliance, Inc. High-availability cluster virtual server system
US7636724B2 (en) 2001-08-31 2009-12-22 Peerify Technologies LLC Data storage system and method by shredding and deshredding
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
TWI240861B (en) * 2002-01-11 2005-10-01 Integrated Circuit Solution In Data access method and architecture of flash memory
US7085271B2 (en) * 2002-03-14 2006-08-01 Hewlett-Packard Development Company, L.P. Method and system for performing flow based hash transformation to generate hash pointers for a network device
US7126948B2 (en) * 2002-03-21 2006-10-24 Hewlett-Packard Development Company, L.P. Method and system for performing a hash transformation to generate a hash pointer for an address input by using rotation
EP1547252A4 (en) 2002-07-29 2011-04-20 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
JP4274311B2 (en) * 2002-12-25 2009-06-03 富士通株式会社 IDENTIFICATION INFORMATION CREATION METHOD, INFORMATION PROCESSING DEVICE, AND COMPUTER PROGRAM
US7228306B1 (en) * 2002-12-31 2007-06-05 Emc Corporation Population of discovery data
WO2004084020A2 (en) 2003-03-13 2004-09-30 Drm Technologies, Llc Secure streaming container
GB0308264D0 (en) 2003-04-10 2003-05-14 Ibm Recovery from failures within data processing systems
GB0308262D0 (en) 2003-04-10 2003-05-14 Ibm Recovery from failures within data processing systems
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
US7185144B2 (en) 2003-11-24 2007-02-27 Network Appliance, Inc. Semi-static distribution technique
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
US7272654B1 (en) * 2004-03-04 2007-09-18 Sandbox Networks, Inc. Virtualizing network-attached-storage (NAS) with a compact table that stores lossy hashes of file names and parent handles rather than full names
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
US7203871B2 (en) * 2004-06-03 2007-04-10 Cisco Technology, Inc. Arrangement in a network node for secure storage and retrieval of encoded data distributed among multiple network nodes
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
JP4772375B2 (en) * 2005-04-28 2011-09-14 株式会社東芝 Electronic device and content management method
US7808971B2 (en) * 2005-07-01 2010-10-05 Miller John L Routing cache for distributed hash tables
US7574579B2 (en) 2005-09-30 2009-08-11 Cleversafe, Inc. Metadata management system for an information dispersed storage system
US7953937B2 (en) 2005-09-30 2011-05-31 Cleversafe, Inc. Systems, methods, and apparatus for subdividing data for storage in a dispersed data storage grid
US7546427B2 (en) 2005-09-30 2009-06-09 Cleversafe, Inc. System for rebuilding dispersed data
US8171101B2 (en) 2005-09-30 2012-05-01 Cleversafe, Inc. Smart access to a dispersed data storage network
US7574570B2 (en) 2005-09-30 2009-08-11 Cleversafe Inc Billing system for information dispersal system
US20070214285A1 (en) 2006-03-08 2007-09-13 Omneon Video Networks Gateway server
US7974218B2 (en) * 2007-04-20 2011-07-05 Cisco Technology, Inc. Intersection-based configuration management
US8464024B2 (en) * 2007-04-27 2013-06-11 Hewlett-Packard Development Company, L.P. Virtual address hashing
US8285878B2 (en) 2007-10-09 2012-10-09 Cleversafe, Inc. Block based access to a dispersed data storage network
US7904475B2 (en) 2007-10-09 2011-03-08 Cleversafe, Inc. Virtualized data storage vaults on a dispersed data storage network
JP2010028551A (en) * 2008-07-22 2010-02-04 Brother Ind Ltd Content distributed storage system, node device, node processing program, and address information change notifying method
WO2010114006A1 (en) * 2009-03-31 2010-10-07 日本電気株式会社 Storage system and storage access method and program
US8381025B2 (en) * 2009-09-30 2013-02-19 Cleversafe, Inc. Method and apparatus for dispersed storage memory device selection

Also Published As

Publication number Publication date
US20160328228A1 (en) 2016-11-10
US10157051B2 (en) 2018-12-18

Similar Documents

Publication Publication Date Title
US9817597B2 (en) Using temporary write locations for increased power efficiency
US10061648B2 (en) Efficient method for redundant storage of a set of encoded data slices
US10846025B2 (en) Utilizing fast memory devices to optimize different functions
US10372506B2 (en) Compute architecture in a memory device of distributed computing system
US10824495B2 (en) Cryptographic key storage in a dispersed storage network
US20180060351A1 (en) Using dispersed queues for rebuilding functions and prioritization
US10853173B2 (en) Proxying slice access requests during a data evacuation
US10656871B2 (en) Expanding slice count in response to low-level failures
US10558526B2 (en) Apportioning storage units amongst storage sites in a dispersed storage network
US10423476B2 (en) Aggressive searching for missing data in a DSN memory that has had migrations
US10853174B2 (en) Utilizing storage unit latency data in a dispersed storage network
US10042566B2 (en) Intelligent read strategy within a dispersed storage network (DSN)
US10216443B2 (en) Proactively deselect storage units for access during major geographic events
US9823845B2 (en) Adaptive dispersed storage network (DSN) and system
US10296263B2 (en) Dispersed bloom filter for determining presence of an object
US20170286088A1 (en) Configuration of automated update routines
US10042577B2 (en) Storing and retrieving mutable objects
US20170017671A1 (en) Deleting data in a dispersed storage network
US20190243808A1 (en) Policy-based storage in a dispersed storage network
US20190166197A1 (en) Consolidating data access in a dispersed storage network
US10082970B2 (en) Storing an effective dynamic width of encoded data slices
US20170192705A1 (en) Data formats of self-contained audit objects
US20170192684A1 (en) Auditing a transaction in a dispersed storage network
US9817701B2 (en) Threshold computing in a distributed computing system
US10104168B2 (en) Method for managing throughput in a distributed 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;ASSIGNORS:BAPTIST, ANDREW D.;CILFONE, BART R.;COCAGNE, THOMAS D.;AND OTHERS;SIGNING DATES FROM 20160717 TO 20160721;REEL/FRAME:046992/0531

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

Free format text: APPLICATION DISPATCHED FROM PREEXAM, NOT YET DOCKETED

AS Assignment

Owner name: PURE STORAGE, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:049555/0530

Effective date: 20190611

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

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

AS Assignment

Owner name: PURE STORAGE, INC., CALIFORNIA

Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE DELETE 15/174/279 AND 15/174/596 PROPERTY NUMBERS PREVIOUSLY RECORDED AT REEL: 49555 FRAME: 530. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:051495/0831

Effective date: 20190611

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

Free format text: NON FINAL ACTION MAILED

AS Assignment

Owner name: BARCLAYS BANK PLC AS ADMINISTRATIVE AGENT, NEW YORK

Free format text: SECURITY INTEREST;ASSIGNOR:PURE STORAGE, INC.;REEL/FRAME:053867/0581

Effective date: 20200824