WO2016164092A1 - Ability to partition an array into two or more logical arrays with independently running software - Google Patents

Ability to partition an array into two or more logical arrays with independently running software Download PDF

Info

Publication number
WO2016164092A1
WO2016164092A1 PCT/US2016/014356 US2016014356W WO2016164092A1 WO 2016164092 A1 WO2016164092 A1 WO 2016164092A1 US 2016014356 W US2016014356 W US 2016014356W WO 2016164092 A1 WO2016164092 A1 WO 2016164092A1
Authority
WO
WIPO (PCT)
Prior art keywords
storage
cluster
nodes
storage nodes
user data
Prior art date
Application number
PCT/US2016/014356
Other languages
French (fr)
Inventor
Par Botes
John Colgrove
John Hayes
Original Assignee
Pure Storage, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Pure Storage, Inc. filed Critical Pure Storage, Inc.
Priority to EP16777006.4A priority Critical patent/EP3281099A4/en
Publication of WO2016164092A1 publication Critical patent/WO2016164092A1/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614Improving the reliability of storage systems
    • G06F3/0619Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1076Parity data used in redundant arrays of independent storages, e.g. in RAID systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16Error detection or correction of the data by redundancy in hardware
    • G06F11/20Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
    • G06F11/2053Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant
    • G06F11/2094Redundant storage or storage space
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • G06F3/0644Management of space entities, e.g. partitions, extents, pools
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/065Replication mechanisms
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0662Virtualisation aspects
    • G06F3/0665Virtualisation aspects at area level, e.g. provisioning of virtual or logical volumes
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0683Plurality of storage devices
    • G06F3/0689Disk arrays, e.g. RAID, JBOD
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14Error detection or correction of the data by redundancy in operation
    • G06F11/1402Saving, restoring, recovering or retrying
    • G06F11/1415Saving, restoring, recovering or retrying at system level
    • G06F11/1441Resetting or repowering

Definitions

  • Solid-state memory such as flash
  • solid-state drives
  • SSD solid-state drives
  • HDD hard disk drives
  • writable CD compact disk
  • writable DVD digital versatile disk drives
  • spinning media and tape drives
  • Flash and other solid-state memories have characteristics that differ from spinning media.
  • many solid-state drives are designed to conform to hard disk drive standards for compatibility reasons, which makes it difficult to provide enhanced features or take advantage of unique aspects of flash and other solid-state memory.
  • a plurality of storage nodes in a single chassis includes a first plurality of storage nodes configured to communicate together as a first storage cluster and a second plurality of storage nodes configured to communicate together as a second storage cluster.
  • Each of the first and second pluralities of storage nodes has nonvolatile solid-state memory for user data storage and each of the first and second pluralities of storage nodes is configured to distribute user data and metadata associated with the user data throughout a respective plurality of storage nodes such that a respective storage cluster maintains ability to read the user data, using erasure coding, despite a loss of one or more of the respective plurality of storage nodes.
  • a plurality of storage clusters includes a plurality of storage nodes, defining the plurality of storage clusters, within a single chassis.
  • Each of the plurality of storage nodes has nonvolatile solid- state memory for storage of user data and each of the plurality of storage nodes has exclusive membership to one of the plurality of storage clusters.
  • Each storage cluster of the plurality of storage clusters is configured to distribute user data of the storage cluster and metadata associated with the user data of the storage cluster throughout the storage nodes having membership to the storage cluster such that the storage nodes having membership to the storage cluster can access the user data of the storage cluster, via erasure coding, with a failure of at least one of the storage nodes having membership to the storage cluster.
  • a method for accessing user data in a plurality of storage nodes having nonvolatile solid-state memory includes assigning a first subset of the plurality of storage nodes as members of a first storage cluster, wherein the plurality of storage nodes is housed within a single chassis.
  • the method includes assigning a second subset of the plurality of storage nodes as members of a second storage cluster, which is independent of the first storage cluster and distributing the user data throughout the first subset of the plurality of storage nodes through erasure coding.
  • the method includes determining that one of the first subset of the plurality of storage nodes is unreachable and accessing the user data, via the erasure coding, from a remainder of the first subset of the plurality of storage nodes.
  • FIG. 1 is a perspective view of a storage cluster with multiple storage nodes and internal storage coupled to each storage node to provide network attached storage, in accordance with some embodiments.
  • FIG. 2 is a block diagram showing an interconnect switch coupling multiple storage nodes in accordance with some embodiments.
  • Fig. 3 is a multiple level block diagram, showing contents of a storage node and contents of one of the non-volatile solid state storage units in accordance with some embodiments.
  • FIG. 4 is a front view of a storage cluster, in a single chassis, partitioned into multiple logical arrays or clusters.
  • FIG. 5 is a front view of a storage cluster spanning two chassis, partitioned into multiple logical arrays or clusters.
  • Fig. 6 is a flow diagram of a method for partitioning a storage cluster into multiple logical arrays, which can be practiced on embodiments of the storage cluster, storage nodes and storage units of Figs. 1-5.
  • FIG. 7 is an illustration showing an exemplary computing device which may implement the embodiments described herein.
  • a storage cluster with storage nodes and storage units that have storage memory, can be partitioned into two or more logical arrays. In some embodiments, this occurs in a single chassis, and in some embodiments this can occur across multiple chassis.
  • Each logical array acts as a storage cluster and can have software independent of another logical array.
  • Various degrees of sharing or isolation from one logical array to another are possible in various embodiments. Aspects of the storage cluster, storage nodes and storage units are described herein with reference to Figs. 1-3. Aspects of partitioning into multiple logical arrays are described with reference to Figs. 4-6.
  • the embodiments below describe a storage cluster that stores user data, such as user data originating from one or more user or client systems or other sources external to the storage cluster.
  • the storage cluster distributes user data across storage nodes housed within a chassis, using erasure coding and redundant copies of metadata.
  • Erasure coding refers to a method of data protection or reconstruction in which data is stored across a set of different locations, such as disks, storage nodes or geographic locations.
  • Flash memory is one type of solid-state memory that may be integrated with the embodiments, although the embodiments may be extended to other types of solid-state memory or other storage medium, including non-solid state memory. Control of storage locations and workloads are distributed across the storage locations in a clustered peer-to-peer system. Tasks such as mediating
  • a storage node may be referred to as a cluster node, a blade, or a server.
  • the storage cluster is contained within a chassis, i.e., an enclosure housing one or more storage nodes.
  • a mechanism to provide power to each storage node, such as a power distribution bus, and a communication mechanism, such as a communication bus that enables communication between the storage nodes are included within the chassis.
  • the storage cluster can run as an independent system in one location according to some embodiments.
  • a chassis contains at least two instances of both the power distribution and the communication bus which may be enabled or disabled independently.
  • the internal communication bus may be an Ethernet bus, however, other technologies such as Peripheral Component Interconnect (PCI) Express, InfiniBand, and others, are equally suitable.
  • PCI Peripheral Component Interconnect Express
  • the chassis provides a port for an external communication bus for enabling communication between multiple chassis, directly or through a switch, and with client systems.
  • the external communication may use a technology such as Ethernet, InfiniBand, Fibre Channel, etc.
  • the external communication bus uses different communication bus technologies for inter-chassis and client communication.
  • a switch is deployed within or between chassis, the switch may act as a translation between multiple protocols or technologies.
  • the storage cluster may be accessed by a client using either proprietary interfaces or standard interfaces such as network file system (NFS), common internet file system (CIFS), small computer system interface (SCSI) or hypertext transfer protocol (HTTP). Translation from the client protocol may occur at the switch, chassis external communication bus or within each storage node.
  • NFS network file system
  • CIFS common internet file system
  • SCSI small computer system interface
  • HTTP hypertext transfer protocol
  • Each storage node may be one or more storage servers and each storage server is connected to one or more non-volatile solid state memory units, which may be referred to as storage units.
  • the storage server may include a processor, dynamic random access memory (DRAM) and interfaces for the internal communication bus and power distribution for each of the power buses.
  • DRAM dynamic random access memory
  • the non-volatile solid state memory units may directly access the internal communication bus interface through a storage node communication bus, or request the storage node to access the bus interface.
  • the nonvolatile solid state memory unit contains an embedded central processing unit (CPU), solid state storage controller, and a quantity of solid state mass storage, e.g., between 2-32 terabytes (TB) in some embodiments.
  • An embedded volatile storage medium, such as DRAM, and an energy reserve apparatus are included in the non-volatile solid state memory unit.
  • the energy reserve apparatus is a capacitor, super-capacitor, or battery that enables transferring a subset of DRAM contents to a stable storage medium in the case of power loss.
  • the non-volatile solid state memory unit is constructed with a storage class memory, such as phase change or magnetoresistive random access memory (MRAM) that substitutes for DRAM and enables a reduced power hold-up apparatus.
  • MRAM magnetoresistive random access memory
  • One of many features of the storage nodes and non-volatile solid state storage is the ability to proactively rebuild data in a storage cluster.
  • the storage nodes and non-volatile solid state storage can determine when a storage node or non-volatile solid state storage in the storage cluster is unreachable, independent of whether there is an attempt to read data involving that storage node or non-volatile solid state storage.
  • the storage nodes and nonvolatile solid state storage then cooperate to recover and rebuild the data in at least partially new locations. This constitutes a proactive rebuild, in that the system rebuilds data without waiting until the data is needed for a read access initiated from a client system employing the storage cluster.
  • FIG. 1 is a perspective view of a storage cluster 160, with multiple storage nodes 150 and internal solid-state memory coupled to each storage node to provide network attached storage or storage area network, in accordance with some embodiments.
  • a network attached storage, storage area network, or a storage cluster, or other storage memory could include one or more storage clusters 160, each having one or more storage nodes 150, in a flexible and reconfigurable arrangement of both the physical components and the amount of storage memory provided thereby.
  • the storage cluster 160 is designed to fit in a rack, and one or more racks can be set up and populated as desired for the storage memory.
  • the storage cluster 160 has a chassis 138 having multiple slots 142.
  • chassis 138 may be referred to as a housing, enclosure, or rack unit.
  • the chassis 138 has fourteen slots 142, although other numbers of slots are readily devised. For example, some embodiments have four slots, eight slots, sixteen slots, thirty-two slots, or other suitable number of slots.
  • Each slot 142 can accommodate one storage node 150 in some embodiments.
  • Chassis 138 includes flaps 148 that can be utilized to mount the chassis 138 on a rack.
  • Fans 144 provide air circulation for cooling of the storage nodes 150 and components thereof, although other cooling components could be used, or an embodiment could be devised without cooling components.
  • a switch fabric 146 couples storage nodes 150 within chassis 138 together and to a network for communication to the memory. In an embodiment depicted in Fig.
  • Storage nodes 150 are hot pluggable, meaning that a storage node 150 can be inserted into a slot 142 in the chassis 138, or removed from a slot 142, without stopping or powering down the system.
  • the system automatically reconfigures in order to recognize and adapt to the change.
  • Reconfiguration includes restoring redundancy and/or rebalancing data or load.
  • Each storage node 150 can have multiple components.
  • the storage node 150 includes a printed circuit board 158 populated by a CPU 156, i.e., processor, a memory 154 coupled to the CPU 156, and a non-volatile solid state storage 152 coupled to the CPU 156, although other mountings and/or components could be used in further embodiments.
  • the memory 154 has instructions which are executed by the CPU 156 and/or data operated on by the CPU 156.
  • the non-volatile solid state storage 152 includes flash or, in further embodiments, other types of solid-state memory.
  • storage cluster 160 is scalable, meaning that storage capacity with non-uniform storage sizes is readily added, as described above.
  • One or more storage nodes 150 can be plugged into or removed from each chassis and the storage cluster self- configures in some embodiments.
  • Plug-in storage nodes 150 whether installed in a chassis as delivered or later added, can have different sizes.
  • a storage node 150 can have any multiple of 4 TB, e.g., 8 TB, 12 TB, 16 TB, 32 TB, etc.
  • a storage node 150 could have any multiple of other storage amounts or capacities.
  • Storage capacity of each storage node 150 is broadcast, and influences decisions of how to stripe the data. For maximum storage efficiency, an embodiment can self- configure as wide as possible in the stripe, subject to a predetermined requirement of continued operation with loss of up to one, or up to two, non-volatile solid state storage units 152 or storage nodes 150 within the chassis.
  • Fig. 2 is a block diagram showing a communications interconnect 170 and power distribution bus 172 coupling multiple storage nodes 150.
  • the communications interconnect 170 can be included in or implemented with the switch fabric 146 in some embodiments. Where multiple storage clusters 160 occupy a rack, the communications interconnect 170 can be included in or implemented with a top of rack switch, in some embodiments. As illustrated in Fig. 2, storage cluster 160 is enclosed within a single chassis 138. External port 176 is coupled to storage nodes 150 through
  • Storage nodes 150 may include varying amounts and differing capacities of non-volatile solid state storage 152 as described with reference to Fig. 1. In addition, one or more storage nodes 150 may be a compute only storage node as illustrated in Fig. 2.
  • Authorities 168 are implemented on the non-volatile solid state storages 152, for example as lists or other data structures stored in memory. In some embodiments the authorities are stored within the non-volatile solid state storage 152 and supported by software executing on a controller or other processor of the non-volatile solid state storage 152. In a further embodiment, authorities 168 are
  • Each authority 168 may be assigned to a non-volatile solid state storage 152. Each authority may control a range of inode numbers, segment numbers, or other data identifiers which are assigned to data by a file system, by the storage nodes 150, or by the non-volatile solid state storage 152, in various embodiments.
  • every piece of data and every piece of metadata has an owner, which may be referred to as an authority. If that authority is unreachable, for example through failure of a storage node, there is a plan of succession for how to find that data or that metadata.
  • authorities 168 there are redundant copies of authorities 168.
  • Authorities 168 have a relationship to storage nodes 150 and non-volatile solid state storage 152 in some embodiments. Each authority 168, covering a range of data segment numbers or other identifiers of the data, may be assigned to a specific non-volatile solid state storage 152.
  • the authorities 168 for all of such ranges are distributed over the nonvolatile solid state storages 152 of a storage cluster.
  • Each storage node 150 has a network port that provides access to the non-volatile solid state storage(s) 152 of that storage node 150.
  • Data can be stored in a segment, which is associated with a segment number and that segment number is an indirection for a configuration of a RAID (redundant array of independent disks) stripe in some embodiments.
  • the assignment and use of the authorities 168 thus establishes an indirection to data. Indirection may be referred to as the ability to reference data indirectly, in this case via an authority 168, in accordance with some embodiments.
  • a segment identifies a set of non-volatile solid state storage 152 and a local identifier into the set of non-volatile solid state storage 152 that may contain data.
  • the local identifier is an offset into the device and may be reused sequentially by multiple segments. In other embodiments the local identifier is unique for a specific segment and never reused.
  • the offsets in the non-volatile solid state storage 152 are applied to locating data for writing to or reading from the non-volatile solid state storage 152 (in the form of a RAID stripe). Data is striped across multiple units of non-volatile solid state storage 152, which may include or be different from the non-volatile solid state storage 152 having the authority 168 for a particular data segment.
  • the authority 168 for that data segment should be consulted, at that non-volatile solid state storage 152 or storage node 150 having that authority 168.
  • embodiments calculate a hash value for a data segment or apply an inode number or a data segment number. The output of this operation points to a non-volatile solid state storage 152 having the authority 168 for that particular piece of data. In some embodiments there are two stages to this operation.
  • the first stage maps an entity identifier (ID), e.g., a segment number, inode number, or directory number to an authority identifier. This mapping may include a calculation such as a hash or a bit mask.
  • ID entity identifier
  • the second stage is mapping the authority identifier to a particular non-volatile solid state storage 152, which may be done through an explicit mapping.
  • the operation is repeatable, so that when the calculation is performed, the result of the calculation repeatably and reliably points to a particular non-volatile solid state storage 152 having that authority 168.
  • the operation may include the set of reachable storage nodes as input. If the set of reachable non-volatile solid state storage units changes the optimal set changes.
  • the persisted value is the current assignment (which is always true) and the calculated value is the target assignment the cluster will attempt to reconfigure towards.
  • This calculation may be used to determine the optimal non-volatile solid state storage 152 for an authority in the presence of a set of non-volatile solid state storage 152 that are reachable and constitute the same cluster.
  • the calculation also determines an ordered set of peer non- volatile solid state storage 152 that will also record the authority to non-volatile solid state storage mapping so that the authority may be determined even if the assigned non-volatile solid state storage is unreachable.
  • a duplicate or substitute authority 168 may be consulted if a specific authority 168 is unavailable in some embodiments.
  • the request to write is forwarded to the non-volatile solid state storage 152 currently determined to be the host of the authority 168 determined from the segment.
  • the host CPU 156 of the storage node 150 on which the nonvolatile solid state storage 152 and corresponding authority 168 reside, then breaks up or shards the data and transmits the data out to various non-volatile solid state storage 152.
  • the transmitted data is written as a data stripe in accordance with an erasure coding scheme. In some embodiments, data is requested to be pulled, and in other embodiments, data is pushed. In reverse, when data is read, the authority 168 for the segment ID containing the data is located as described above.
  • the host CPU 156 of the storage node 150 on which the nonvolatile solid state storage 152 and corresponding authority 168 reside requests the data from the non-volatile solid state storage and corresponding storage nodes pointed to by the authority.
  • the data is read from flash storage as a data stripe.
  • the host CPU 156 of storage node 150 then reassembles the read data, correcting any errors (if present) according to the appropriate erasure coding scheme, and forwards the reassembled data to the network.
  • some or all of these tasks can be handled in the non-volatile solid state storage 152.
  • the segment host requests the data be sent to storage node 150 by requesting pages from storage and then sending the data to the storage node making the original request.
  • data is handled with an index node or inode, which specifies a data structure that represents an object in a file system.
  • the obj ect could be a file or a directory, for example.
  • Metadata may accompany the obj ect, as attributes such as permission data and a creation timestamp, among other attributes.
  • a segment number could be assigned to all or a portion of such an obj ect in a file system.
  • data segments are handled with a segment number assigned elsewhere.
  • the unit of distribution is an entity, and an entity can be a file, a directory or a segment.
  • entities are units of data or metadata stored by a storage system. Entities are grouped into sets called authorities. Each authority has an authority owner, which is a storage node that has the exclusive right to update the entities in the authority. In other words, a storage node contains the authority, and that the authority, in turn, contains entities.
  • a segment is a logical container of data in accordance with some embodiments.
  • a segment is an address space between medium address space and physical flash locations, i.e., the data segment number, are in this address space. Segments may also contain metadata, which enable data redundancy to be restored (rewritten to different flash locations or devices) without the involvement of higher level software.
  • an internal format of a segment contains client data and medium mappings to determine the position of that data. Each data segment is protected, e.g., from memory and other failures, by breaking the segment into a number of data and parity shards, where applicable.
  • the data and parity shards are distributed, i.e., striped, across non-volatile solid state storage 152 coupled to the host CPUs 156 (See Fig. 5) in accordance with an erasure coding scheme.
  • Usage of the term segments refers to the container and its place in the address space of segments in some embodiments.
  • Usage of the term stripe refers to the same set of shards as a segment and includes how the shards are distributed along with redundancy or parity information in accordance with some embodiments.
  • a series of address-space transformations takes place across an entire storage system.
  • the directory entries file names
  • Inodes point into medium address space, where data is logically stored.
  • Medium addresses may be mapped through a series of indirect mediums to spread the load of large files, or implement data services like deduplication or snapshots.
  • Medium addresses may be mapped through a series of indirect mediums to spread the load of large files, or implement data services like deduplication or snapshots. Segment addresses are then translated into physical flash locations. Physical flash locations have an address range bounded by the amount of flash in the system in accordance with some embodiments.
  • Medium addresses and segment addresses are logical containers, and in some embodiments use a 128 bit or larger identifier so as to be practically infinite, with a likelihood of reuse calculated as longer than the expected life of the system. Addresses from logical containers are allocated in a hierarchical fashion in some embodiments. Initially, each non-volatile solid state storage 152 may be assigned a range of address space. Within this assigned range, the non-volatile solid state storage 152 is able to allocate addresses without synchronization with other non-volatile solid state storage 152. [0030] Data and metadata is stored by a set of underlying storage layouts that are optimized for varying workload patterns and storage devices. These layouts incorporate multiple redundancy schemes, compression formats and index algorithms.
  • the redundancy schemes include error correction codes that tolerate corrupted bits within a single storage device (such as a NAND flash chip), erasure codes that tolerate the failure of multiple storage nodes, and replication schemes that tolerate data center or regional failures.
  • low density parity check (LDPC) code is used within a single storage unit.
  • Reed-Solomon encoding is used within a storage cluster, and mirroring is used within a storage grid in some embodiments.
  • Metadata may be stored using an ordered log structured index (such as a Log Structured Merge Tree), and large data may not be stored in a log structured layout.
  • the storage nodes agree implicitly on two things through calculations: (1) the authority that contains the entity, and (2) the storage node that contains the authority.
  • the assignment of entities to authorities can be done by pseudorandomly assigning entities to authorities, by splitting entities into ranges based upon an externally produced key, or by placing a single entity into each authority. Examples of pseudorandom schemes are linear hashing and the Replication Under Scalable Hashing (RUSH) family of hashes, including Controlled Replication Under Scalable Hashing (CRUSH).
  • RUSH Replication Under Scalable Hashing
  • CUSH Controlled Replication Under Scalable Hashing
  • pseudo-random assignment is utilized only for assigning authorities to nodes because the set of nodes can change. The set of authorities cannot change so any subjective function may be applied in these embodiments.
  • a pseudorandom scheme is utilized to map from each authority to a set of candidate authority owners.
  • a pseudorandom data distribution function related to CRUSH may assign authorities to storage nodes and create a list of where the authorities are assigned.
  • Each storage node has a copy of the pseudorandom data distribution function, and can arrive at the same calculation for distributing, and later finding or locating an authority.
  • Each of the pseudorandom schemes requires the reachable set of storage nodes as input in some embodiments in order to conclude the same target nodes.
  • rebalancing algorithms attempt to store the copies of all entities within an authority in the same layout and on the same set of machines.
  • Examples of expected failures include device failures, stolen machines, datacenter fires, and regional disasters, such as nuclear or geological events. Different failures lead to different levels of acceptable data loss.
  • a stolen storage node impacts neither the security nor the reliability of the system, while depending on system
  • a regional event could lead to no loss of data, a few seconds or minutes of lost updates, or even complete data loss.
  • the placement of data for storage redundancy is independent of the placement of authorities for data consistency.
  • storage nodes that contain authorities do not contain any persistent storage. Instead, the storage nodes are connected to non-volatile solid state storage units that do not contain authorities.
  • the communications interconnect between storage nodes and non-volatile solid state storage units consists of multiple communication technologies and has non-uniform performance and fault tolerance characteristics.
  • non-volatile solid state storage units are connected to storage nodes via PCI express, storage nodes are connected together within a single chassis using Ethernet backplane, and chassis are connected together to form a storage cluster.
  • Storage clusters are connected to clients using Ethernet or fiber channel in some embodiments. If multiple storage clusters are configured into a storage grid, the multiple storage clusters are connected using the Internet or other long-distance networking links, such as a "metro scale" link or private link that does not traverse the internet.
  • Authority owners have the exclusive right to modify entities, to migrate entities from one non-volatile solid state storage unit to another non-volatile solid state storage unit, and to add and remove copies of entities. This allows for maintaining the redundancy of the underlying data.
  • an authority owner fails, is going to be decommissioned, or is overloaded, the authority is transferred to a new storage node. Transient failures make it non- trivial to ensure that all non-faulty machines agree upon the new authority location.
  • the ambiguity that arises due to transient failures can be achieved automatically by a consensus protocol such as Paxos, hot-warm failover schemes, via manual intervention by a remote system administrator, or by a local hardware administrator (such as by physically removing the failed machine from the cluster, or pressing a button on the failed machine).
  • a consensus protocol is used, and failover is automatic. If too many failures or replication events occur in too short a time period, the system goes into a self-preservation mode and halts replication and data movement activities until an administrator intervenes in accordance with some embodiments.
  • authorities are transferred between storage nodes and authority owners update entities in their authorities, the system transfers messages between the storage nodes and nonvolatile solid state storage units.
  • messages that have different purposes are of different types.
  • the system maintains different ordering and durability guarantees.
  • the messages are temporarily stored in multiple durable and non-durable storage hardware technologies.
  • messages are stored in RAM, NVRAM and on NAND flash devices, and a variety of protocols are used in order to make efficient use of each storage medium. Latency-sensitive client requests may be persisted in replicated NVRAM, and then later NAND, while background rebalancing operations are persisted directly to NAND.
  • Persistent messages are persistently stored prior to being replicated. This allows the system to continue to serve client requests despite failures and component replacement.
  • many hardware components contain unique identifiers that are visible to system administrators, manufacturer, hardware supply chain and ongoing monitoring quality control infrastructure, applications running on top of the infrastructure address virtualize addresses. These virtualized addresses do not change over the lifetime of the storage system, regardless of component failures and replacements. This allows each component of the storage system to be replaced over time without reconfiguration or disruptions of client request processing.
  • the virtualized addresses are stored with sufficient redundancy.
  • a continuous monitoring system correlates hardware and software status and the hardware identifiers. This allows detection and prediction of failures due to faulty components and manufacturing details. The monitoring system also enables the proactive transfer of authorities and entities away from impacted devices before failure occurs by removing the component from the critical path in some embodiments.
  • Fig. 3 is a multiple level block diagram, showing contents of a storage node 150 and contents of a non-volatile solid state storage 152 of the storage node 150. Data is communicated to and from the storage node 150 by a network interface controller (NIC) 202 in some embodiments.
  • NIC network interface controller
  • Each storage node 150 has a CPU 156, and one or more non-volatile solid state storage 152, as discussed above. Moving down one level in Fig. 3, each nonvolatile solid state storage 152 has a relatively fast non-volatile solid state memory, such as nonvolatile random access memory (NVRAM) 204, and flash memory 206.
  • NVRAM nonvolatile random access memory
  • NVRAM 204 may be a component that does not require program/erase cycles (DRAM, MRAM, PCM), and can be a memory that can support being written vastly more often than the memory is read from.
  • DRAM dynamic random access memory
  • the NVRAM 204 is implemented in one embodiment as high speed volatile memory, such as dynamic random access memory (DRAM) 216, backed up by energy reserve 218.
  • Energy reserve 218 provides sufficient electrical power to keep the DRAM 216 powered long enough for contents to be transferred to the flash memory 206 in the event of power failure.
  • energy reserve 218 is a capacitor, super-capacitor, battery, or other device, that supplies a suitable supply of energy sufficient to enable the transfer of the contents of DRAM 216 to a stable storage medium in the case of power loss.
  • the flash memory 206 is implemented as multiple flash dies 222, which may be referred to as packages of flash dies 222 or an array of flash dies 222. It should be appreciated that the flash dies 222 could be packaged in any number of ways, with a single die per package, multiple dies per package (i.e. multichip packages), in hybrid packages, as bare dies on a printed circuit board or other substrate, as encapsulated dies, etc.
  • the non-volatile solid state storage 152 has a controller 212 or other processor, and an input output (I/O) port 210 coupled to the controller 212.
  • I/O port 210 is coupled to the CPU 156 and/or the network interface controller 202 of the flash storage node 150.
  • Flash input output (I/O) port 220 is coupled to the flash dies 222, and a direct memory access unit (DMA) 214 is coupled to the controller 212, the DRAM 216 and the flash dies 222.
  • DMA direct memory access unit
  • the I/O port 210, controller 212, DMA unit 214 and flash I/O port 220 are implemented on a programmable logic device (PLD) 208, e.g., a field programmable gate array (FPGA).
  • PLD programmable logic device
  • FPGA field programmable gate array
  • each flash die 222 has pages, organized as sixteen kB (kilobyte) pages 224, and a register 226 through which data can be written to or read from the flash die 222.
  • other types of solid-state memory are used in place of, or in addition to flash memory illustrated within flash die 222.
  • Storage clusters 160 in various embodiments as disclosed herein, can be contrasted with storage arrays in general.
  • the storage nodes 150 are part of a collection that creates the storage cluster 160. Each storage node 150 owns a slice of data and computing required to provide the data. Multiple storage nodes 150 cooperate to store and retrieve the data.
  • Storage memory or storage devices, as used in storage arrays in general, are less involved with processing and manipulating the data. Storage memory or storage devices in a storage array receive commands to read, write, or erase data. The storage memory or storage devices in a storage array are not aware of a larger system in which they are embedded, or what the data means.
  • Storage memory or storage devices in storage arrays can include various types of storage memory, such as RAM, solid state drives, hard disk drives, etc.
  • the storage units 152 described herein have multiple interfaces active simultaneously and serving multiple purposes. In some embodiments, some of the functionality of a storage node 150 is shifted into a storage unit 152, transforming the storage unit 152 into a combination of storage unit 152 and storage node 150. Placing computing (relative to storage data) into the storage unit 152 places this computing closer to the data itself.
  • the various system embodiments have a hierarchy of storage node layers with different capabilities. By contrast, in a storage array, a controller owns and knows everything about all of the data that the controller manages in a shelf or storage devices.
  • multiple controllers in multiple storage units 152 and/or storage nodes 150 cooperate in various ways (e.g., for erasure coding, data sharding, metadata communication and redundancy, storage capacity expansion or contraction, data recovery, and so on).
  • Fig. 4 is a front view of a storage cluster 160, in a single chassis 138, partitioned into multiple logical arrays 404, 406 or clusters.
  • Each logical array 404 functions as a storage cluster, with a unique cluster identifier.
  • the chassis houses the storage nodes 150 of the storage cluster 160, and also houses a switch fabric 146 or other bus or network that couples the storage nodes 150 as the storage cluster.
  • a power supply 402 occupies part of the chassis 138, or could be external to the chassis 138 in various embodiments.
  • the storage cluster 160 which may be considered a physical array, is partitioned into two logical arrays 404, 406. In various embodiments, the storage cluster 160 could be partitioned into more than two logical arrays.
  • a visual indicator 412 on each storage node 150 shows a number, letter, symbol, color or other visual indication corresponding to the assignment of the storage node 150 relative to one or more logical arrays 404, 406. That is, the visual indicator 412 shows the membership of a particular storage node 150 to a particular logical array 404, or other membership or assignment status of the storage node 150. For example, the visual indicator 412 could show the letter "A", the number "1", or other name or label for a storage node 150 assigned to a particular logical array 404. In some embodiments, the visual indicator 412 can indicate when a storage node 150 is unassigned, for example when the storage node 150 is an unassigned spare.
  • the visual indicator 412 can indicate when a storage node 150 is shared by multiple logical arrays 404, 406. Since each storage unit 152 and each storage node 150 has a processor and local memory, the storage units 152 and storage nodes 150 of the storage cluster 160 can be programmed for various features as will be further described below. Various embodiments can have one or a small number of these features, or a larger number of features, in various combinations. [0042]
  • Fig. 5 is a front view of a storage cluster 160 spanning two chassis 138, partitioned into multiple logical arrays 404, 406, 408, 410 or clusters. As in Fig. 4, storage nodes 150 in one chassis 138 can be assigned to a particular logical array 404, 406.
  • a logical array 408 can span more than one chassis 138. That is, storage nodes 150 in two or more chassis 138 can be assigned to a particular logical array 408. To facilitate communication among such storage nodes 150 in a logical array 408 spanning two or more chassis 138, these chassis 138 are coupled together, for example by a bus or a network that couples the storage nodes 150 of the two or more chassis 138 together. With reference to Figs. 4 and 5, various features are possible with the storage systems described herein. In some embodiments, the assignment of a storage node 150 to a logical array 404 depends on the slot 142 of the chassis 148 (see Fig. 1).
  • the assignment of a storage node 150 to a logical array 404, 406, 408, 410 is slot independent. It is not necessary to have all slots 142 in a chassis 138 occupied by storage nodes 150, since a storage node 150 can be hot plugged into a slot 142, and assigned to a logical array 404, 406, 408, 410. Alternatively, a storage node 150 could occupy a slot but be unassigned, and then assigned to one of the logical arrays 404, 406, 408, 410.
  • the storage cluster 160 could have a shared physical network, and also have network separation using virtual local area networks, one for each logical array 404, 406, 408, 410.
  • Each logical array 404, 406 could have a unique Internet protocol address, a unique virtual local area network name, unique software image and version, etc. Flow-based control could be applied to reconfigure one or more of these virtual local area networks or route communication over different paths in the virtual local area networks.
  • each logical array 404, 406 could have its own operating system, software, software upgrades, operating system upgrades, hardware upgrades, etc.
  • Management isolation allows for separate ports and separate management of each logical array 404, 406.
  • each logical array 404 could be accessed and managed via a port belonging to one of the storage nodes 150 assigned to that logical array 404, or a port belonging to a virtual local area network assigned to that logical array 404.
  • the number of storage nodes 150 assigned to one logical array 404 is independent of the number of storage nodes 150 assigned to another logical array 406.
  • Total storage capacity, or utilized or spare storage capacity, of one logical array 404 is independent of that of another logical array 406. Redundancy schemes and/or encryption schemes can differ from one logical array 404 to another logical array 406.
  • Logical arrays 404, 406, 408, 410 can have administrative domain isolation.
  • Some embodiments have complete or perfect isolation, with data, data striping, metadata, control, processing, and communication of one logical array 404 isolated and independent of that of another logical array 406. With complete isolation, there is no communication from members of one storage cluster (e.g., storage nodes 150 assigned to one logical array 404) to members of another storage cluster (e.g., storage nodes 150 assigned to another logical array 406), and vice versa. No data from one logical array 404, and no metadata from one logical array 404, is found in storage nodes 150 assigned to another logical array 406, and vice versa. Complete isolation allows for corruption isolation, for example arising from faults in processing. That is, a corruption in one logical array 404 or cluster does not affect another logical array 406 or cluster.
  • Some embodiments can dynamically shift compute resources from one logical array 404 to another logical array 406.
  • the storage cluster 160 has one or more compute nodes, such as shown in Fig. 2 as a "storage nodes compute only" storage node 150.
  • Logical arrays 404, 406 could be provisioned with one or more compute nodes each.
  • the compute node or nodes communicate with other storage nodes 150 of the logical array 404.
  • a logical array 404, 406, 408, 410 can function as both a storage array and a computing facility, and execute applications as well as store user data, for example.
  • one or more compute nodes from one chassis 138 could be assigned to logical arrays 404, 406, 408, 410 with storage nodes 150 of either or any of the multiple chassis 138. It should be appreciated that this is regardless of the slot 142 (see Fig. 1) any of these occupies.
  • Some embodiments have ability to remove a storage node 150 from a logical array 404. If a storage node 150 fails, the system can recover user data, using erasure coding, reconfigure, and redistribute user data among remaining storage nodes 150, using the same or a differing version of erasure coding. Physically removing a storage node 150 from a chassis 138 could trigger such actions, as if the storage node 150 had failed. In this case, the removed storage node 150 still contains portions of user data and metadata, which can be recovered upon reinsertion of the storage node 150 into the same chassis 138, or a differing chassis 138 in some embodiments.
  • a command to evacuate a storage node 150 of data and metadata causes the corresponding logical array 404 (of which that storage node 150 is a member) to do so and to redistribute the data and the metadata throughout the remaining storage nodes 150 of that logical array 404.
  • the evacuated storage node 150 can then be physically removed from the chassis 138 as empty, left in the chassis 138 as unassigned (e.g., a spare, or reserve capacity), or assigned to another logical array 406.
  • one or more of the storage nodes 150 has the capability of being evacuated and removed or reassigned, and one or more of the storage nodes 150 lacks this capability and should not be removed from a logical array 404 once assigned to that logical array 404.
  • the visual indicator 412 could show a symbol, color or message, etc., to indicate that this storage node 150 is prevented from being removed.
  • the visual indicator 412 could show a storage node 150 is removable, if such is the case.
  • a request to remove a storage node 150 could be followed by a determination of whether that storage node 150 is of a type that is removable, or a type that is not removable, which could then be communicated by message or report.
  • Some embodiments have automatic provisioning of a logical array 404. Other embodiments have manual provisioning of each logical array 404.
  • a storage cluster 160 could be setup for manual provisioning of one or more logical arrays 404, and automatic provision of one or more logical arrays 406.
  • a licensing model can be implemented in some embodiments of the storage cluster 160.
  • a manufacturer would supply one or more chassis 138 populated by storage nodes 150, but not all of the storage nodes 150 would be assigned to a particular logical array 404 (or multiple logical arrays 404, 406).
  • the storage cluster 160 would self-monitor, and communicate back to the manufacturer regarding utilized storage capacity.
  • the storage cluster 160 When the storage cluster 160 assigns an unassigned storage node 150 to a logical array 404, whether automatically or by client instruction, the storage cluster 160 communicates this event and situation (e.g., in a report or message) back to the manufacturer. The manufacturer can then bill or debit the user for the additional storage capacity at the time this additional capacity is brought online. This may be referred to as a "purchase on first use model".
  • the storage cluster 160 communicates when a storage node 150 is removed from a logical array 404 and associated cluster. The manufacturer could then refund or credit a user, or discontinue billing for any removed storage node 150, in a flexible billing plan based on storage usage.
  • a storage node 150 can be assigned to be removable or non-removable.
  • Non-removable storage nodes 150 would remain as assigned to a logical array 404, and could not be removed, nor would a refund or credit be issued if storage capacity of such a non-removable storage node 150 is not used, in the flexible billing plan.
  • Fig. 6 is a flow diagram of a method for partitioning a storage cluster into multiple logical arrays, which can be practiced on embodiments of the storage cluster, storage nodes and storage units of Figs. 1-5. The method can be practiced by processors of storage nodes and storage units.
  • a first set of storage nodes is assigned to a first logical array as a first storage cluster.
  • the first set of storage nodes can be selected from among storage nodes in a single chassis, or from among storage nodes in multiple chassis, in various embodiments.
  • a second set of storage nodes is assigned to a second logical array as a second storage cluster.
  • the second set of storage nodes can be selected from among the storage nodes in the single chassis, in some embodiments, or from among the storage nodes in multiple chassis, in further embodiments.
  • an action 606 user data is distributed throughout the storage nodes of the first logical array, using a first erasure coding scheme.
  • further user data is distributed throughout storage nodes of the second logical array using a second erasure coding scheme. Erasure coding schemes and distribution of user data are described above with reference to Figs. 1-3.
  • a decision action 610 it is determined whether a storage node in the first logical array is unreachable. If all storage nodes in the first logical array are reachable, flow loops back to the decision action 610, and data is accessed normally, e.g., from the storage nodes of the first logical array. If a storage node in the first logical array is found unreachable, flow proceeds to the action 612. In the action 612, the user data is accessed via the first erasure coding scheme from the remaining storage nodes of the first logical array.
  • Fig. 7 is an illustration showing an exemplary computing device which may implement the embodiments described herein.
  • the computing device of Fig. 7 may be used to perform embodiments of the functionality for a storage node or a nonvolatile solid state storage in accordance with some embodiments.
  • the computing device includes a central processing unit (CPU) 701, which is coupled through a bus 705 to a memory 703, and mass storage device 707.
  • Mass storage device 707 represents a persistent data storage device such as a disc drive, which may be local or remote in some embodiments.
  • the mass storage device 707 could implement a backup storage, in some embodiments.
  • Memory 703 may include read only memory, random access memory, etc.
  • Applications resident on the computing device may be stored on or accessed via a computer readable medium such as memory 703 or mass storage device 707 in some embodiments.
  • CPU 701 may be embodied in a general-purpose processor, a special purpose processor, or a specially programmed logic device in some embodiments.
  • Display 711 is in communication with CPU 701, memory 703, and mass storage device 707, through bus 705.
  • Display 711 is configured to display any visualization tools or reports associated with the system described herein.
  • Input/output device 709 is coupled to bus 705 in order to communicate information in command selections to CPU 701. It should be appreciated that data to and from external devices may be communicated through the input/output device 709.
  • CPU 701 can be defined to execute the functionality described herein to enable the functionality described with reference to Figs. 1-6.
  • the code embodying this functionality may be stored within memory 703 or mass storage device 707 for execution by a processor such as CPU 701 in some embodiments.
  • the operating system on the computing device may be MS-WINDOWSTM, UNIXTM, LINUXTM, iOSTM, CentOSTM, AndroidTM, Redhat LinuxTM, z/OSTM, or other known operating systems. It should be appreciated that the embodiments described herein may be integrated with virtualized computing system also.
  • the embodiments might employ various computer-implemented operations involving data stored in computer systems. These operations are those requiring physical manipulation of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. Further, the manipulations performed are often referred to in terms, such as producing, identifying, determining, or comparing. Any of the operations described herein that form part of the embodiments are useful machine operations. The embodiments also relate to a device or an apparatus for performing these operations. The apparatus can be specially constructed for the required purpose, or the apparatus can be a general-purpose computer selectively activated or configured by a computer program stored in the computer.
  • a module, an application, a layer, an agent or other method-operable entity could be implemented as hardware, firmware, or a processor executing software, or combinations thereof. It should be appreciated that, where a software-based embodiment is disclosed herein, the software can be embodied in a physical machine such as a controller. For example, a controller could include a first module and a second module. A controller could be configured to perform various actions, e.g., of a method, an application, a layer or an agent.
  • the embodiments can also be embodied as computer readable code on a non- transitory computer readable medium.
  • the computer readable medium is any data storage device that can store data, which can be thereafter read by a computer system. Examples of the computer readable medium include hard drives, network attached storage (NAS), readonly memory, random-access memory, CD-ROMs, CD-Rs, CD-RWs, magnetic tapes, and other optical and non-optical data storage devices.
  • the computer readable medium can also be distributed over a network coupled computer system so that the computer readable code is stored and executed in a distributed fashion.
  • Embodiments described herein may be practiced with various computer system configurations including hand-held devices, tablets, microprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers and the like.
  • the embodiments can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a wire-based or wireless network.
  • one or more portions of the methods and mechanisms described herein may form part of a cloud-computing environment.
  • resources may be provided over the Internet as services according to one or more various models.
  • models may include Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS).
  • IaaS Infrastructure as a Service
  • PaaS Platform as a Service
  • SaaS Software as a Service
  • SaaS software tools and underlying equipment used by developers to develop software solutions
  • SaaS typically includes a service provider licensing software as a service on demand. The service provider may host the software, or may deploy the software to a customer for a given period of time. Numerous combinations of the above models are possible and are contemplated.
  • unit/circuit/component can be said to be configured to perform the task even when the specified unit/circuit/component is not currently operational (e.g., is not on).
  • the units/circuits/components used with the "configured to” language include hardware—for example, circuits, memory storing program instructions executable to implement the operation, etc. Reciting that a unit/circuit/component is "configured to" perform one or more tasks is expressly intended not to invoke 35 U.S.C. 112, sixth paragraph, for that unit/circuit/component.
  • “configured to” can include generic structure (e.g., generic circuitry) that is manipulated by software and/or firmware (e.g., an FPGA or a general-purpose processor executing software) to operate in manner that is capable of performing the task(s) at issue. "Configured to” may also include adapting a manufacturing process (e.g., a semiconductor fabrication facility) to fabricate devices (e.g., integrated circuits) that are adapted to implement or perform one or more tasks.
  • a manufacturing process e.g., a semiconductor fabrication facility
  • devices e.g., integrated circuits

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Quality & Reliability (AREA)
  • Computer Security & Cryptography (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

A plurality of storage nodes in a single chassis is provided. The plurality of storage nodes includes a first plurality of storage nodes configured to communicate together as a first storage cluster and a second plurality of storage nodes configured to communicate together as a second storage cluster. Each of the first and second pluralities of storage nodes has nonvolatile solid-state memory for user data storage and each of the first and second pluralities of storage nodes is configured to distribute user data and metadata associated with the user data throughout a respective plurality of storage nodes such that a respective storage cluster maintains ability to read the user data, using erasure coding, despite a loss of one or more of the respective plurality of storage nodes.

Description

ABILITY TO PARTITION AN ARRAY INTO TWO OR MORE LOGICAL ARRAYS WITH INDEPENDENTLY RUNNING SOFTWARE
BACKGROUND
[0001] Solid-state memory, such as flash, is currently in use in solid-state drives
(SSD) to augment or replace conventional hard disk drives (HDD), writable CD (compact disk) or writable DVD (digital versatile disk) drives, collectively known as spinning media, and tape drives, for storage of large amounts of data. Flash and other solid-state memories have characteristics that differ from spinning media. Yet, many solid-state drives are designed to conform to hard disk drive standards for compatibility reasons, which makes it difficult to provide enhanced features or take advantage of unique aspects of flash and other solid-state memory.
[0002] It is within this context that the embodiments arise.
SUMMARY
[0003] In some embodiments, a plurality of storage nodes in a single chassis is provided. The plurality of storage nodes includes a first plurality of storage nodes configured to communicate together as a first storage cluster and a second plurality of storage nodes configured to communicate together as a second storage cluster. Each of the first and second pluralities of storage nodes has nonvolatile solid-state memory for user data storage and each of the first and second pluralities of storage nodes is configured to distribute user data and metadata associated with the user data throughout a respective plurality of storage nodes such that a respective storage cluster maintains ability to read the user data, using erasure coding, despite a loss of one or more of the respective plurality of storage nodes.
[0004] In some embodiments, a plurality of storage clusters is provided. The plurality of storage clusters includes a plurality of storage nodes, defining the plurality of storage clusters, within a single chassis. Each of the plurality of storage nodes has nonvolatile solid- state memory for storage of user data and each of the plurality of storage nodes has exclusive membership to one of the plurality of storage clusters. Each storage cluster of the plurality of storage clusters is configured to distribute user data of the storage cluster and metadata associated with the user data of the storage cluster throughout the storage nodes having membership to the storage cluster such that the storage nodes having membership to the storage cluster can access the user data of the storage cluster, via erasure coding, with a failure of at least one of the storage nodes having membership to the storage cluster. [0005] In some embodiments, a method for accessing user data in a plurality of storage nodes having nonvolatile solid-state memory is provided. The method includes assigning a first subset of the plurality of storage nodes as members of a first storage cluster, wherein the plurality of storage nodes is housed within a single chassis. The method includes assigning a second subset of the plurality of storage nodes as members of a second storage cluster, which is independent of the first storage cluster and distributing the user data throughout the first subset of the plurality of storage nodes through erasure coding. The method includes determining that one of the first subset of the plurality of storage nodes is unreachable and accessing the user data, via the erasure coding, from a remainder of the first subset of the plurality of storage nodes.
[0006] Other aspects and advantages of the embodiments will become apparent from the following detailed description taken in conjunction with the accompanying drawings which illustrate, by way of example, the principles of the described embodiments.
BRIEF DESCRIPTION OF THE DRAWINGS
[0007] The described embodiments and the advantages thereof may best be understood by reference to the following description taken in conjunction with the accompanying drawings. These drawings in no way limit any changes in form and detail that may be made to the described embodiments by one skilled in the art without departing from the spirit and scope of the described embodiments.
[0008] Fig. 1 is a perspective view of a storage cluster with multiple storage nodes and internal storage coupled to each storage node to provide network attached storage, in accordance with some embodiments.
[0009] Fig. 2 is a block diagram showing an interconnect switch coupling multiple storage nodes in accordance with some embodiments.
[0010] Fig. 3 is a multiple level block diagram, showing contents of a storage node and contents of one of the non-volatile solid state storage units in accordance with some embodiments.
[0011] Fig. 4 is a front view of a storage cluster, in a single chassis, partitioned into multiple logical arrays or clusters.
[0012] Fig. 5 is a front view of a storage cluster spanning two chassis, partitioned into multiple logical arrays or clusters. [0013] Fig. 6 is a flow diagram of a method for partitioning a storage cluster into multiple logical arrays, which can be practiced on embodiments of the storage cluster, storage nodes and storage units of Figs. 1-5.
[0014] Fig. 7 is an illustration showing an exemplary computing device which may implement the embodiments described herein.
DETAILED DESCRIPTION
[0015] A storage cluster, with storage nodes and storage units that have storage memory, can be partitioned into two or more logical arrays. In some embodiments, this occurs in a single chassis, and in some embodiments this can occur across multiple chassis. Each logical array acts as a storage cluster and can have software independent of another logical array. Various degrees of sharing or isolation from one logical array to another are possible in various embodiments. Aspects of the storage cluster, storage nodes and storage units are described herein with reference to Figs. 1-3. Aspects of partitioning into multiple logical arrays are described with reference to Figs. 4-6.
[0016] The embodiments below describe a storage cluster that stores user data, such as user data originating from one or more user or client systems or other sources external to the storage cluster. The storage cluster distributes user data across storage nodes housed within a chassis, using erasure coding and redundant copies of metadata. Erasure coding refers to a method of data protection or reconstruction in which data is stored across a set of different locations, such as disks, storage nodes or geographic locations. Flash memory is one type of solid-state memory that may be integrated with the embodiments, although the embodiments may be extended to other types of solid-state memory or other storage medium, including non-solid state memory. Control of storage locations and workloads are distributed across the storage locations in a clustered peer-to-peer system. Tasks such as mediating
communications between the various storage nodes, detecting when a storage node has become unavailable, and balancing I/Os (inputs and outputs) across the various storage nodes, are all handled on a distributed basis. Data is laid out or distributed across multiple storage nodes in data fragments or stripes that support data recovery in some embodiments. Ownership of data can be reassigned within a cluster, independent of input and output patterns. This architecture described in more detail below allows a storage node in the cluster to fail, with the system remaining operational, since the data can be reconstructed from other storage nodes and thus remain available for input and output operations. In various embodiments, a storage node may be referred to as a cluster node, a blade, or a server. [0017] The storage cluster is contained within a chassis, i.e., an enclosure housing one or more storage nodes. A mechanism to provide power to each storage node, such as a power distribution bus, and a communication mechanism, such as a communication bus that enables communication between the storage nodes are included within the chassis. The storage cluster can run as an independent system in one location according to some embodiments. In one embodiment, a chassis contains at least two instances of both the power distribution and the communication bus which may be enabled or disabled independently. The internal communication bus may be an Ethernet bus, however, other technologies such as Peripheral Component Interconnect (PCI) Express, InfiniBand, and others, are equally suitable. The chassis provides a port for an external communication bus for enabling communication between multiple chassis, directly or through a switch, and with client systems. The external communication may use a technology such as Ethernet, InfiniBand, Fibre Channel, etc. In some embodiments, the external communication bus uses different communication bus technologies for inter-chassis and client communication. If a switch is deployed within or between chassis, the switch may act as a translation between multiple protocols or technologies. When multiple chassis are connected to define a storage cluster, the storage cluster may be accessed by a client using either proprietary interfaces or standard interfaces such as network file system (NFS), common internet file system (CIFS), small computer system interface (SCSI) or hypertext transfer protocol (HTTP). Translation from the client protocol may occur at the switch, chassis external communication bus or within each storage node.
[0018] Each storage node may be one or more storage servers and each storage server is connected to one or more non-volatile solid state memory units, which may be referred to as storage units. One embodiment includes a single storage server in each storage node and between one to eight non-volatile solid state memory units, however this one example is not meant to be limiting. The storage server may include a processor, dynamic random access memory (DRAM) and interfaces for the internal communication bus and power distribution for each of the power buses. Inside the storage node, the interfaces and storage unit share a communication bus, e.g., PCI Express, in some embodiments. The non-volatile solid state memory units may directly access the internal communication bus interface through a storage node communication bus, or request the storage node to access the bus interface. The nonvolatile solid state memory unit contains an embedded central processing unit (CPU), solid state storage controller, and a quantity of solid state mass storage, e.g., between 2-32 terabytes (TB) in some embodiments. An embedded volatile storage medium, such as DRAM, and an energy reserve apparatus are included in the non-volatile solid state memory unit. In some embodiments, the energy reserve apparatus is a capacitor, super-capacitor, or battery that enables transferring a subset of DRAM contents to a stable storage medium in the case of power loss. In some embodiments, the non-volatile solid state memory unit is constructed with a storage class memory, such as phase change or magnetoresistive random access memory (MRAM) that substitutes for DRAM and enables a reduced power hold-up apparatus.
[0019] One of many features of the storage nodes and non-volatile solid state storage is the ability to proactively rebuild data in a storage cluster. The storage nodes and non-volatile solid state storage can determine when a storage node or non-volatile solid state storage in the storage cluster is unreachable, independent of whether there is an attempt to read data involving that storage node or non-volatile solid state storage. The storage nodes and nonvolatile solid state storage then cooperate to recover and rebuild the data in at least partially new locations. This constitutes a proactive rebuild, in that the system rebuilds data without waiting until the data is needed for a read access initiated from a client system employing the storage cluster. These and further details of the storage memory and operation thereof are discussed below.
[0020] Fig. 1 is a perspective view of a storage cluster 160, with multiple storage nodes 150 and internal solid-state memory coupled to each storage node to provide network attached storage or storage area network, in accordance with some embodiments. A network attached storage, storage area network, or a storage cluster, or other storage memory, could include one or more storage clusters 160, each having one or more storage nodes 150, in a flexible and reconfigurable arrangement of both the physical components and the amount of storage memory provided thereby. The storage cluster 160 is designed to fit in a rack, and one or more racks can be set up and populated as desired for the storage memory. The storage cluster 160 has a chassis 138 having multiple slots 142. It should be appreciated that chassis 138 may be referred to as a housing, enclosure, or rack unit. In one embodiment, the chassis 138 has fourteen slots 142, although other numbers of slots are readily devised. For example, some embodiments have four slots, eight slots, sixteen slots, thirty-two slots, or other suitable number of slots. Each slot 142 can accommodate one storage node 150 in some embodiments. Chassis 138 includes flaps 148 that can be utilized to mount the chassis 138 on a rack. Fans 144 provide air circulation for cooling of the storage nodes 150 and components thereof, although other cooling components could be used, or an embodiment could be devised without cooling components. A switch fabric 146 couples storage nodes 150 within chassis 138 together and to a network for communication to the memory. In an embodiment depicted in Fig. 1, the slots 142 to the left of the switch fabric 146 and fans 144 are shown occupied by storage nodes 150, while the slots 142 to the right of the switch fabric 146 and fans 144 are empty and available for insertion of storage node 150 for illustrative purposes. This configuration is one example, and one or more storage nodes 150 could occupy the slots 142 in various further arrangements. The storage node arrangements need not be sequential or adjacent in some embodiments. Storage nodes 150 are hot pluggable, meaning that a storage node 150 can be inserted into a slot 142 in the chassis 138, or removed from a slot 142, without stopping or powering down the system. Upon insertion or removal of storage node 150 from slot 142, the system automatically reconfigures in order to recognize and adapt to the change. Reconfiguration, in some embodiments, includes restoring redundancy and/or rebalancing data or load.
[0021] Each storage node 150 can have multiple components. In the embodiment shown here, the storage node 150 includes a printed circuit board 158 populated by a CPU 156, i.e., processor, a memory 154 coupled to the CPU 156, and a non-volatile solid state storage 152 coupled to the CPU 156, although other mountings and/or components could be used in further embodiments. The memory 154 has instructions which are executed by the CPU 156 and/or data operated on by the CPU 156. As further explained below, the non-volatile solid state storage 152 includes flash or, in further embodiments, other types of solid-state memory.
[0022] Referring to Fig. 1, storage cluster 160 is scalable, meaning that storage capacity with non-uniform storage sizes is readily added, as described above. One or more storage nodes 150 can be plugged into or removed from each chassis and the storage cluster self- configures in some embodiments. Plug-in storage nodes 150, whether installed in a chassis as delivered or later added, can have different sizes. For example, in one embodiment a storage node 150 can have any multiple of 4 TB, e.g., 8 TB, 12 TB, 16 TB, 32 TB, etc. In further embodiments, a storage node 150 could have any multiple of other storage amounts or capacities. Storage capacity of each storage node 150 is broadcast, and influences decisions of how to stripe the data. For maximum storage efficiency, an embodiment can self- configure as wide as possible in the stripe, subject to a predetermined requirement of continued operation with loss of up to one, or up to two, non-volatile solid state storage units 152 or storage nodes 150 within the chassis.
[0023] Fig. 2 is a block diagram showing a communications interconnect 170 and power distribution bus 172 coupling multiple storage nodes 150. Referring back to Fig. 1, the communications interconnect 170 can be included in or implemented with the switch fabric 146 in some embodiments. Where multiple storage clusters 160 occupy a rack, the communications interconnect 170 can be included in or implemented with a top of rack switch, in some embodiments. As illustrated in Fig. 2, storage cluster 160 is enclosed within a single chassis 138. External port 176 is coupled to storage nodes 150 through
communications interconnect 170, while external port 174 is coupled directly to a storage node. External power port 178 is coupled to power distribution bus 172. Storage nodes 150 may include varying amounts and differing capacities of non-volatile solid state storage 152 as described with reference to Fig. 1. In addition, one or more storage nodes 150 may be a compute only storage node as illustrated in Fig. 2. Authorities 168 are implemented on the non-volatile solid state storages 152, for example as lists or other data structures stored in memory. In some embodiments the authorities are stored within the non-volatile solid state storage 152 and supported by software executing on a controller or other processor of the non-volatile solid state storage 152. In a further embodiment, authorities 168 are
implemented on the storage nodes 150, for example as lists or other data structures stored in the memory 154 and supported by software executing on the CPU 156 of the storage node 150. Authorities 168 control how and where data is stored in the non-volatile solid state storages 152 in some embodiments. This control assists in determining which type of erasure coding scheme is applied to the data, and which storage nodes 150 have which portions of the data. Each authority 168 may be assigned to a non-volatile solid state storage 152. Each authority may control a range of inode numbers, segment numbers, or other data identifiers which are assigned to data by a file system, by the storage nodes 150, or by the non-volatile solid state storage 152, in various embodiments.
[0024] Every piece of data, and every piece of metadata, has redundancy in the system in some embodiments. In addition, every piece of data and every piece of metadata has an owner, which may be referred to as an authority. If that authority is unreachable, for example through failure of a storage node, there is a plan of succession for how to find that data or that metadata. In various embodiments, there are redundant copies of authorities 168. Authorities 168 have a relationship to storage nodes 150 and non-volatile solid state storage 152 in some embodiments. Each authority 168, covering a range of data segment numbers or other identifiers of the data, may be assigned to a specific non-volatile solid state storage 152. In some embodiments the authorities 168 for all of such ranges are distributed over the nonvolatile solid state storages 152 of a storage cluster. Each storage node 150 has a network port that provides access to the non-volatile solid state storage(s) 152 of that storage node 150. Data can be stored in a segment, which is associated with a segment number and that segment number is an indirection for a configuration of a RAID (redundant array of independent disks) stripe in some embodiments. The assignment and use of the authorities 168 thus establishes an indirection to data. Indirection may be referred to as the ability to reference data indirectly, in this case via an authority 168, in accordance with some embodiments. A segment identifies a set of non-volatile solid state storage 152 and a local identifier into the set of non-volatile solid state storage 152 that may contain data. In some embodiments, the local identifier is an offset into the device and may be reused sequentially by multiple segments. In other embodiments the local identifier is unique for a specific segment and never reused. The offsets in the non-volatile solid state storage 152 are applied to locating data for writing to or reading from the non-volatile solid state storage 152 (in the form of a RAID stripe). Data is striped across multiple units of non-volatile solid state storage 152, which may include or be different from the non-volatile solid state storage 152 having the authority 168 for a particular data segment.
[0025] If there is a change in where a particular segment of data is located, e.g., during a data move or a data reconstruction, the authority 168 for that data segment should be consulted, at that non-volatile solid state storage 152 or storage node 150 having that authority 168. In order to locate a particular piece of data, embodiments calculate a hash value for a data segment or apply an inode number or a data segment number. The output of this operation points to a non-volatile solid state storage 152 having the authority 168 for that particular piece of data. In some embodiments there are two stages to this operation. The first stage maps an entity identifier (ID), e.g., a segment number, inode number, or directory number to an authority identifier. This mapping may include a calculation such as a hash or a bit mask. The second stage is mapping the authority identifier to a particular non-volatile solid state storage 152, which may be done through an explicit mapping. The operation is repeatable, so that when the calculation is performed, the result of the calculation repeatably and reliably points to a particular non-volatile solid state storage 152 having that authority 168. The operation may include the set of reachable storage nodes as input. If the set of reachable non-volatile solid state storage units changes the optimal set changes. In some embodiments, the persisted value is the current assignment (which is always true) and the calculated value is the target assignment the cluster will attempt to reconfigure towards. This calculation may be used to determine the optimal non-volatile solid state storage 152 for an authority in the presence of a set of non-volatile solid state storage 152 that are reachable and constitute the same cluster. The calculation also determines an ordered set of peer non- volatile solid state storage 152 that will also record the authority to non-volatile solid state storage mapping so that the authority may be determined even if the assigned non-volatile solid state storage is unreachable. A duplicate or substitute authority 168 may be consulted if a specific authority 168 is unavailable in some embodiments.
[0026] With reference to Figs. 1 and 2, two of the many tasks of the CPU 156 on a storage node 150 are to break up write data, and reassemble read data. When the system has determined that data is to be written, the authority 168 for that data is located as above.
When the segment ID for data is already determined the request to write is forwarded to the non-volatile solid state storage 152 currently determined to be the host of the authority 168 determined from the segment. The host CPU 156 of the storage node 150, on which the nonvolatile solid state storage 152 and corresponding authority 168 reside, then breaks up or shards the data and transmits the data out to various non-volatile solid state storage 152. The transmitted data is written as a data stripe in accordance with an erasure coding scheme. In some embodiments, data is requested to be pulled, and in other embodiments, data is pushed. In reverse, when data is read, the authority 168 for the segment ID containing the data is located as described above. The host CPU 156 of the storage node 150 on which the nonvolatile solid state storage 152 and corresponding authority 168 reside requests the data from the non-volatile solid state storage and corresponding storage nodes pointed to by the authority. In some embodiments the data is read from flash storage as a data stripe. The host CPU 156 of storage node 150 then reassembles the read data, correcting any errors (if present) according to the appropriate erasure coding scheme, and forwards the reassembled data to the network. In further embodiments, some or all of these tasks can be handled in the non-volatile solid state storage 152. In some embodiments, the segment host requests the data be sent to storage node 150 by requesting pages from storage and then sending the data to the storage node making the original request.
[0027] In some systems, for example in UNIX-style file systems, data is handled with an index node or inode, which specifies a data structure that represents an object in a file system. The obj ect could be a file or a directory, for example. Metadata may accompany the obj ect, as attributes such as permission data and a creation timestamp, among other attributes. A segment number could be assigned to all or a portion of such an obj ect in a file system. In other systems, data segments are handled with a segment number assigned elsewhere. For purposes of discussion, the unit of distribution is an entity, and an entity can be a file, a directory or a segment. That is, entities are units of data or metadata stored by a storage system. Entities are grouped into sets called authorities. Each authority has an authority owner, which is a storage node that has the exclusive right to update the entities in the authority. In other words, a storage node contains the authority, and that the authority, in turn, contains entities.
[0028] A segment is a logical container of data in accordance with some embodiments. A segment is an address space between medium address space and physical flash locations, i.e., the data segment number, are in this address space. Segments may also contain metadata, which enable data redundancy to be restored (rewritten to different flash locations or devices) without the involvement of higher level software. In one embodiment, an internal format of a segment contains client data and medium mappings to determine the position of that data. Each data segment is protected, e.g., from memory and other failures, by breaking the segment into a number of data and parity shards, where applicable. The data and parity shards are distributed, i.e., striped, across non-volatile solid state storage 152 coupled to the host CPUs 156 (See Fig. 5) in accordance with an erasure coding scheme. Usage of the term segments refers to the container and its place in the address space of segments in some embodiments. Usage of the term stripe refers to the same set of shards as a segment and includes how the shards are distributed along with redundancy or parity information in accordance with some embodiments.
[0029] A series of address-space transformations takes place across an entire storage system. At the top are the directory entries (file names) which link to an inode. Inodes point into medium address space, where data is logically stored. Medium addresses may be mapped through a series of indirect mediums to spread the load of large files, or implement data services like deduplication or snapshots. Medium addresses may be mapped through a series of indirect mediums to spread the load of large files, or implement data services like deduplication or snapshots. Segment addresses are then translated into physical flash locations. Physical flash locations have an address range bounded by the amount of flash in the system in accordance with some embodiments. Medium addresses and segment addresses are logical containers, and in some embodiments use a 128 bit or larger identifier so as to be practically infinite, with a likelihood of reuse calculated as longer than the expected life of the system. Addresses from logical containers are allocated in a hierarchical fashion in some embodiments. Initially, each non-volatile solid state storage 152 may be assigned a range of address space. Within this assigned range, the non-volatile solid state storage 152 is able to allocate addresses without synchronization with other non-volatile solid state storage 152. [0030] Data and metadata is stored by a set of underlying storage layouts that are optimized for varying workload patterns and storage devices. These layouts incorporate multiple redundancy schemes, compression formats and index algorithms. Some of these layouts store information about authorities and authority masters, while others store file metadata and file data. The redundancy schemes include error correction codes that tolerate corrupted bits within a single storage device (such as a NAND flash chip), erasure codes that tolerate the failure of multiple storage nodes, and replication schemes that tolerate data center or regional failures. In some embodiments, low density parity check (LDPC) code is used within a single storage unit. Reed-Solomon encoding is used within a storage cluster, and mirroring is used within a storage grid in some embodiments. Metadata may be stored using an ordered log structured index (such as a Log Structured Merge Tree), and large data may not be stored in a log structured layout.
[0031] In order to maintain consistency across multiple copies of an entity, the storage nodes agree implicitly on two things through calculations: (1) the authority that contains the entity, and (2) the storage node that contains the authority. The assignment of entities to authorities can be done by pseudorandomly assigning entities to authorities, by splitting entities into ranges based upon an externally produced key, or by placing a single entity into each authority. Examples of pseudorandom schemes are linear hashing and the Replication Under Scalable Hashing (RUSH) family of hashes, including Controlled Replication Under Scalable Hashing (CRUSH). In some embodiments, pseudo-random assignment is utilized only for assigning authorities to nodes because the set of nodes can change. The set of authorities cannot change so any subjective function may be applied in these embodiments. Some placement schemes automatically place authorities on storage nodes, while other placement schemes rely on an explicit mapping of authorities to storage nodes. In some embodiments, a pseudorandom scheme is utilized to map from each authority to a set of candidate authority owners. A pseudorandom data distribution function related to CRUSH may assign authorities to storage nodes and create a list of where the authorities are assigned. Each storage node has a copy of the pseudorandom data distribution function, and can arrive at the same calculation for distributing, and later finding or locating an authority. Each of the pseudorandom schemes requires the reachable set of storage nodes as input in some embodiments in order to conclude the same target nodes. Once an entity has been placed in an authority, the entity may be stored on physical devices so that no expected failure will lead to unexpected data loss. In some embodiments, rebalancing algorithms attempt to store the copies of all entities within an authority in the same layout and on the same set of machines. [0032] Examples of expected failures include device failures, stolen machines, datacenter fires, and regional disasters, such as nuclear or geological events. Different failures lead to different levels of acceptable data loss. In some embodiments, a stolen storage node impacts neither the security nor the reliability of the system, while depending on system
configuration, a regional event could lead to no loss of data, a few seconds or minutes of lost updates, or even complete data loss.
[0033] In the embodiments, the placement of data for storage redundancy is independent of the placement of authorities for data consistency. In some embodiments, storage nodes that contain authorities do not contain any persistent storage. Instead, the storage nodes are connected to non-volatile solid state storage units that do not contain authorities. The communications interconnect between storage nodes and non-volatile solid state storage units consists of multiple communication technologies and has non-uniform performance and fault tolerance characteristics. In some embodiments, as mentioned above, non-volatile solid state storage units are connected to storage nodes via PCI express, storage nodes are connected together within a single chassis using Ethernet backplane, and chassis are connected together to form a storage cluster. Storage clusters are connected to clients using Ethernet or fiber channel in some embodiments. If multiple storage clusters are configured into a storage grid, the multiple storage clusters are connected using the Internet or other long-distance networking links, such as a "metro scale" link or private link that does not traverse the internet.
[0034] Authority owners have the exclusive right to modify entities, to migrate entities from one non-volatile solid state storage unit to another non-volatile solid state storage unit, and to add and remove copies of entities. This allows for maintaining the redundancy of the underlying data. When an authority owner fails, is going to be decommissioned, or is overloaded, the authority is transferred to a new storage node. Transient failures make it non- trivial to ensure that all non-faulty machines agree upon the new authority location. The ambiguity that arises due to transient failures can be achieved automatically by a consensus protocol such as Paxos, hot-warm failover schemes, via manual intervention by a remote system administrator, or by a local hardware administrator (such as by physically removing the failed machine from the cluster, or pressing a button on the failed machine). In some embodiments, a consensus protocol is used, and failover is automatic. If too many failures or replication events occur in too short a time period, the system goes into a self-preservation mode and halts replication and data movement activities until an administrator intervenes in accordance with some embodiments. [0035] As authorities are transferred between storage nodes and authority owners update entities in their authorities, the system transfers messages between the storage nodes and nonvolatile solid state storage units. With regard to persistent messages, messages that have different purposes are of different types. Depending on the type of the message, the system maintains different ordering and durability guarantees. As the persistent messages are being processed, the messages are temporarily stored in multiple durable and non-durable storage hardware technologies. In some embodiments, messages are stored in RAM, NVRAM and on NAND flash devices, and a variety of protocols are used in order to make efficient use of each storage medium. Latency-sensitive client requests may be persisted in replicated NVRAM, and then later NAND, while background rebalancing operations are persisted directly to NAND.
[0036] Persistent messages are persistently stored prior to being replicated. This allows the system to continue to serve client requests despite failures and component replacement. Although many hardware components contain unique identifiers that are visible to system administrators, manufacturer, hardware supply chain and ongoing monitoring quality control infrastructure, applications running on top of the infrastructure address virtualize addresses. These virtualized addresses do not change over the lifetime of the storage system, regardless of component failures and replacements. This allows each component of the storage system to be replaced over time without reconfiguration or disruptions of client request processing.
[0037] In some embodiments, the virtualized addresses are stored with sufficient redundancy. A continuous monitoring system correlates hardware and software status and the hardware identifiers. This allows detection and prediction of failures due to faulty components and manufacturing details. The monitoring system also enables the proactive transfer of authorities and entities away from impacted devices before failure occurs by removing the component from the critical path in some embodiments.
[0038] Fig. 3 is a multiple level block diagram, showing contents of a storage node 150 and contents of a non-volatile solid state storage 152 of the storage node 150. Data is communicated to and from the storage node 150 by a network interface controller (NIC) 202 in some embodiments. Each storage node 150 has a CPU 156, and one or more non-volatile solid state storage 152, as discussed above. Moving down one level in Fig. 3, each nonvolatile solid state storage 152 has a relatively fast non-volatile solid state memory, such as nonvolatile random access memory (NVRAM) 204, and flash memory 206. In some embodiments, NVRAM 204 may be a component that does not require program/erase cycles (DRAM, MRAM, PCM), and can be a memory that can support being written vastly more often than the memory is read from. Moving down another level in Fig. 3, the NVRAM 204 is implemented in one embodiment as high speed volatile memory, such as dynamic random access memory (DRAM) 216, backed up by energy reserve 218. Energy reserve 218 provides sufficient electrical power to keep the DRAM 216 powered long enough for contents to be transferred to the flash memory 206 in the event of power failure. In some embodiments, energy reserve 218 is a capacitor, super-capacitor, battery, or other device, that supplies a suitable supply of energy sufficient to enable the transfer of the contents of DRAM 216 to a stable storage medium in the case of power loss. The flash memory 206 is implemented as multiple flash dies 222, which may be referred to as packages of flash dies 222 or an array of flash dies 222. It should be appreciated that the flash dies 222 could be packaged in any number of ways, with a single die per package, multiple dies per package (i.e. multichip packages), in hybrid packages, as bare dies on a printed circuit board or other substrate, as encapsulated dies, etc. In the embodiment shown, the non-volatile solid state storage 152 has a controller 212 or other processor, and an input output (I/O) port 210 coupled to the controller 212. I/O port 210 is coupled to the CPU 156 and/or the network interface controller 202 of the flash storage node 150. Flash input output (I/O) port 220 is coupled to the flash dies 222, and a direct memory access unit (DMA) 214 is coupled to the controller 212, the DRAM 216 and the flash dies 222. In the embodiment shown, the I/O port 210, controller 212, DMA unit 214 and flash I/O port 220 are implemented on a programmable logic device (PLD) 208, e.g., a field programmable gate array (FPGA). In this embodiment, each flash die 222 has pages, organized as sixteen kB (kilobyte) pages 224, and a register 226 through which data can be written to or read from the flash die 222. In further embodiments, other types of solid-state memory are used in place of, or in addition to flash memory illustrated within flash die 222.
[0039] Storage clusters 160, in various embodiments as disclosed herein, can be contrasted with storage arrays in general. The storage nodes 150 are part of a collection that creates the storage cluster 160. Each storage node 150 owns a slice of data and computing required to provide the data. Multiple storage nodes 150 cooperate to store and retrieve the data. Storage memory or storage devices, as used in storage arrays in general, are less involved with processing and manipulating the data. Storage memory or storage devices in a storage array receive commands to read, write, or erase data. The storage memory or storage devices in a storage array are not aware of a larger system in which they are embedded, or what the data means. Storage memory or storage devices in storage arrays can include various types of storage memory, such as RAM, solid state drives, hard disk drives, etc. The storage units 152 described herein have multiple interfaces active simultaneously and serving multiple purposes. In some embodiments, some of the functionality of a storage node 150 is shifted into a storage unit 152, transforming the storage unit 152 into a combination of storage unit 152 and storage node 150. Placing computing (relative to storage data) into the storage unit 152 places this computing closer to the data itself. The various system embodiments have a hierarchy of storage node layers with different capabilities. By contrast, in a storage array, a controller owns and knows everything about all of the data that the controller manages in a shelf or storage devices. In a storage cluster 160, as described herein, multiple controllers in multiple storage units 152 and/or storage nodes 150 cooperate in various ways (e.g., for erasure coding, data sharding, metadata communication and redundancy, storage capacity expansion or contraction, data recovery, and so on).
[0040] Fig. 4 is a front view of a storage cluster 160, in a single chassis 138, partitioned into multiple logical arrays 404, 406 or clusters. Each logical array 404 functions as a storage cluster, with a unique cluster identifier. The chassis houses the storage nodes 150 of the storage cluster 160, and also houses a switch fabric 146 or other bus or network that couples the storage nodes 150 as the storage cluster. A power supply 402 occupies part of the chassis 138, or could be external to the chassis 138 in various embodiments. As shown in Fig. 4, the storage cluster 160, which may be considered a physical array, is partitioned into two logical arrays 404, 406. In various embodiments, the storage cluster 160 could be partitioned into more than two logical arrays.
[0041] A visual indicator 412 on each storage node 150, in some embodiments, shows a number, letter, symbol, color or other visual indication corresponding to the assignment of the storage node 150 relative to one or more logical arrays 404, 406. That is, the visual indicator 412 shows the membership of a particular storage node 150 to a particular logical array 404, or other membership or assignment status of the storage node 150. For example, the visual indicator 412 could show the letter "A", the number "1", or other name or label for a storage node 150 assigned to a particular logical array 404. In some embodiments, the visual indicator 412 can indicate when a storage node 150 is unassigned, for example when the storage node 150 is an unassigned spare. In further embodiments, the visual indicator 412 can indicate when a storage node 150 is shared by multiple logical arrays 404, 406. Since each storage unit 152 and each storage node 150 has a processor and local memory, the storage units 152 and storage nodes 150 of the storage cluster 160 can be programmed for various features as will be further described below. Various embodiments can have one or a small number of these features, or a larger number of features, in various combinations. [0042] Fig. 5 is a front view of a storage cluster 160 spanning two chassis 138, partitioned into multiple logical arrays 404, 406, 408, 410 or clusters. As in Fig. 4, storage nodes 150 in one chassis 138 can be assigned to a particular logical array 404, 406. In the embodiment shown, a logical array 408 can span more than one chassis 138. That is, storage nodes 150 in two or more chassis 138 can be assigned to a particular logical array 408. To facilitate communication among such storage nodes 150 in a logical array 408 spanning two or more chassis 138, these chassis 138 are coupled together, for example by a bus or a network that couples the storage nodes 150 of the two or more chassis 138 together. With reference to Figs. 4 and 5, various features are possible with the storage systems described herein. In some embodiments, the assignment of a storage node 150 to a logical array 404 depends on the slot 142 of the chassis 148 (see Fig. 1). In other embodiments, the assignment of a storage node 150 to a logical array 404, 406, 408, 410 is slot independent. It is not necessary to have all slots 142 in a chassis 138 occupied by storage nodes 150, since a storage node 150 can be hot plugged into a slot 142, and assigned to a logical array 404, 406, 408, 410. Alternatively, a storage node 150 could occupy a slot but be unassigned, and then assigned to one of the logical arrays 404, 406, 408, 410. Various degrees and types of shared and separate facilities are possible. For example, the storage cluster 160 could have a shared physical network, and also have network separation using virtual local area networks, one for each logical array 404, 406, 408, 410. Each logical array 404, 406 could have a unique Internet protocol address, a unique virtual local area network name, unique software image and version, etc. Flow-based control could be applied to reconfigure one or more of these virtual local area networks or route communication over different paths in the virtual local area networks.
[0043] Software separation allows for independent software, independent operating systems, independent upgrades of software, independent upgrades of operating systems and so on. For example, each logical array 404, 406 could have its own operating system, software, software upgrades, operating system upgrades, hardware upgrades, etc.
Management isolation allows for separate ports and separate management of each logical array 404, 406. For example, each logical array 404 could be accessed and managed via a port belonging to one of the storage nodes 150 assigned to that logical array 404, or a port belonging to a virtual local area network assigned to that logical array 404. The number of storage nodes 150 assigned to one logical array 404 is independent of the number of storage nodes 150 assigned to another logical array 406. Total storage capacity, or utilized or spare storage capacity, of one logical array 404 is independent of that of another logical array 406. Redundancy schemes and/or encryption schemes can differ from one logical array 404 to another logical array 406. Logical arrays 404, 406, 408, 410 can have administrative domain isolation.
[0044] In some embodiments, there could be shared data and/or shared data striping across storage nodes 150 of multiple logical arrays 404, 406, and separate metadata and control for each logical array 404, 406. In other embodiments, there could be shared data and/or shared data striping, and shared metadata and control across storage nodes 150 of multiple logical arrays 404, 406. There could be shared data and/or shared data striping, and shared metadata across storage nodes 150 of multiple logical arrays 404, 406, and separate control and processing for each logical array 404, 406 in some embodiments. In
embodiments with shared data striping, there could be wider stripes (e.g., across most or all of the storage nodes 150 of a storage cluster 160) than would be possible for embodiments with the same total number of storage nodes 150 but data striping limited to the storage nodes 150 assigned to a particular logical array 404, 406. Data striping could even extend across storage nodes 150 of two or more chassis 138.
[0045] Some embodiments have complete or perfect isolation, with data, data striping, metadata, control, processing, and communication of one logical array 404 isolated and independent of that of another logical array 406. With complete isolation, there is no communication from members of one storage cluster (e.g., storage nodes 150 assigned to one logical array 404) to members of another storage cluster (e.g., storage nodes 150 assigned to another logical array 406), and vice versa. No data from one logical array 404, and no metadata from one logical array 404, is found in storage nodes 150 assigned to another logical array 406, and vice versa. Complete isolation allows for corruption isolation, for example arising from faults in processing. That is, a corruption in one logical array 404 or cluster does not affect another logical array 406 or cluster.
[0046] Some embodiments can dynamically shift compute resources from one logical array 404 to another logical array 406. In some versions, the storage cluster 160 has one or more compute nodes, such as shown in Fig. 2 as a "storage nodes compute only" storage node 150. Logical arrays 404, 406 could be provisioned with one or more compute nodes each. The compute node or nodes communicate with other storage nodes 150 of the logical array 404. With one or more compute nodes, a logical array 404, 406, 408, 410 can function as both a storage array and a computing facility, and execute applications as well as store user data, for example. In versions supporting multiple chassis 138, one or more compute nodes from one chassis 138 could be assigned to logical arrays 404, 406, 408, 410 with storage nodes 150 of either or any of the multiple chassis 138. It should be appreciated that this is regardless of the slot 142 (see Fig. 1) any of these occupies.
[0047] Some embodiments have ability to remove a storage node 150 from a logical array 404. If a storage node 150 fails, the system can recover user data, using erasure coding, reconfigure, and redistribute user data among remaining storage nodes 150, using the same or a differing version of erasure coding. Physically removing a storage node 150 from a chassis 138 could trigger such actions, as if the storage node 150 had failed. In this case, the removed storage node 150 still contains portions of user data and metadata, which can be recovered upon reinsertion of the storage node 150 into the same chassis 138, or a differing chassis 138 in some embodiments. However, in some embodiments, a command to evacuate a storage node 150 of data and metadata causes the corresponding logical array 404 (of which that storage node 150 is a member) to do so and to redistribute the data and the metadata throughout the remaining storage nodes 150 of that logical array 404. The evacuated storage node 150 can then be physically removed from the chassis 138 as empty, left in the chassis 138 as unassigned (e.g., a spare, or reserve capacity), or assigned to another logical array 406. In some versions, one or more of the storage nodes 150 has the capability of being evacuated and removed or reassigned, and one or more of the storage nodes 150 lacks this capability and should not be removed from a logical array 404 once assigned to that logical array 404. The visual indicator 412 could show a symbol, color or message, etc., to indicate that this storage node 150 is prevented from being removed. Similarly, the visual indicator 412 could show a storage node 150 is removable, if such is the case. A request to remove a storage node 150 could be followed by a determination of whether that storage node 150 is of a type that is removable, or a type that is not removable, which could then be communicated by message or report.
[0048] Some embodiments have automatic provisioning of a logical array 404. Other embodiments have manual provisioning of each logical array 404. A storage cluster 160 could be setup for manual provisioning of one or more logical arrays 404, and automatic provision of one or more logical arrays 406. A licensing model can be implemented in some embodiments of the storage cluster 160. A manufacturer would supply one or more chassis 138 populated by storage nodes 150, but not all of the storage nodes 150 would be assigned to a particular logical array 404 (or multiple logical arrays 404, 406). The storage cluster 160 would self-monitor, and communicate back to the manufacturer regarding utilized storage capacity. When the storage cluster 160 assigns an unassigned storage node 150 to a logical array 404, whether automatically or by client instruction, the storage cluster 160 communicates this event and situation (e.g., in a report or message) back to the manufacturer. The manufacturer can then bill or debit the user for the additional storage capacity at the time this additional capacity is brought online. This may be referred to as a "purchase on first use model". In some versions, the storage cluster 160 communicates when a storage node 150 is removed from a logical array 404 and associated cluster. The manufacturer could then refund or credit a user, or discontinue billing for any removed storage node 150, in a flexible billing plan based on storage usage. In some embodiments, a storage node 150 can be assigned to be removable or non-removable. Non-removable storage nodes 150 would remain as assigned to a logical array 404, and could not be removed, nor would a refund or credit be issued if storage capacity of such a non-removable storage node 150 is not used, in the flexible billing plan.
[0049] Fig. 6 is a flow diagram of a method for partitioning a storage cluster into multiple logical arrays, which can be practiced on embodiments of the storage cluster, storage nodes and storage units of Figs. 1-5. The method can be practiced by processors of storage nodes and storage units. In an action 602, a first set of storage nodes is assigned to a first logical array as a first storage cluster. The first set of storage nodes can be selected from among storage nodes in a single chassis, or from among storage nodes in multiple chassis, in various embodiments. In an action 604, a second set of storage nodes is assigned to a second logical array as a second storage cluster. The second set of storage nodes can be selected from among the storage nodes in the single chassis, in some embodiments, or from among the storage nodes in multiple chassis, in further embodiments.
[0050] In an action 606, user data is distributed throughout the storage nodes of the first logical array, using a first erasure coding scheme. In an action 608, further user data is distributed throughout storage nodes of the second logical array using a second erasure coding scheme. Erasure coding schemes and distribution of user data are described above with reference to Figs. 1-3. In a decision action 610, it is determined whether a storage node in the first logical array is unreachable. If all storage nodes in the first logical array are reachable, flow loops back to the decision action 610, and data is accessed normally, e.g., from the storage nodes of the first logical array. If a storage node in the first logical array is found unreachable, flow proceeds to the action 612. In the action 612, the user data is accessed via the first erasure coding scheme from the remaining storage nodes of the first logical array.
[0051] It should be appreciated that the methods described herein may be performed with a digital processing system, such as a conventional, general-purpose computer system. Special purpose computers, which are designed or programmed to perform only one function may be used in the alternative. Fig. 7 is an illustration showing an exemplary computing device which may implement the embodiments described herein. The computing device of Fig. 7 may be used to perform embodiments of the functionality for a storage node or a nonvolatile solid state storage in accordance with some embodiments. The computing device includes a central processing unit (CPU) 701, which is coupled through a bus 705 to a memory 703, and mass storage device 707. Mass storage device 707 represents a persistent data storage device such as a disc drive, which may be local or remote in some embodiments. The mass storage device 707 could implement a backup storage, in some embodiments. Memory 703 may include read only memory, random access memory, etc. Applications resident on the computing device may be stored on or accessed via a computer readable medium such as memory 703 or mass storage device 707 in some embodiments.
Applications may also be in the form of modulated electronic signals modulated accessed via a network modem or other network interface of the computing device. It should be appreciated that CPU 701 may be embodied in a general-purpose processor, a special purpose processor, or a specially programmed logic device in some embodiments.
[0052] Display 711 is in communication with CPU 701, memory 703, and mass storage device 707, through bus 705. Display 711 is configured to display any visualization tools or reports associated with the system described herein. Input/output device 709 is coupled to bus 705 in order to communicate information in command selections to CPU 701. It should be appreciated that data to and from external devices may be communicated through the input/output device 709. CPU 701 can be defined to execute the functionality described herein to enable the functionality described with reference to Figs. 1-6. The code embodying this functionality may be stored within memory 703 or mass storage device 707 for execution by a processor such as CPU 701 in some embodiments. The operating system on the computing device may be MS-WINDOWS™, UNIX™, LINUX™, iOS™, CentOS™, Android™, Redhat Linux™, z/OS™, or other known operating systems. It should be appreciated that the embodiments described herein may be integrated with virtualized computing system also.
[0053] Detailed illustrative embodiments are disclosed herein. However, specific functional details disclosed herein are merely representative for purposes of describing embodiments. Embodiments may, however, be embodied in many alternate forms and should not be construed as limited to only the embodiments set forth herein. [0054] It should be understood that although the terms first, second, etc. may be used herein to describe various steps or calculations, these steps or calculations should not be limited by these terms. These terms are only used to distinguish one step or calculation from another. For example, a first calculation could be termed a second calculation, and, similarly, a second step could be termed a first step, without departing from the scope of this disclosure. As used herein, the term "and/or" and the "/" symbol includes any and all combinations of one or more of the associated listed items.
[0055] As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises", "comprising", "includes", and/or "including", when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. Therefore, the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting.
[0056] It should also be noted that in some alternative implementations, the functions/acts noted may occur out of the order noted in the figures. For example, two figures shown in succession may in fact be executed substantially concurrently or may sometimes be executed in the reverse order, depending upon the functionality/acts involved.
[0057] With the above embodiments in mind, it should be understood that the embodiments might employ various computer-implemented operations involving data stored in computer systems. These operations are those requiring physical manipulation of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. Further, the manipulations performed are often referred to in terms, such as producing, identifying, determining, or comparing. Any of the operations described herein that form part of the embodiments are useful machine operations. The embodiments also relate to a device or an apparatus for performing these operations. The apparatus can be specially constructed for the required purpose, or the apparatus can be a general-purpose computer selectively activated or configured by a computer program stored in the computer. In particular, various general-purpose machines can be used with computer programs written in accordance with the teachings herein, or it may be more convenient to construct a more specialized apparatus to perform the required operations. [0058] A module, an application, a layer, an agent or other method-operable entity could be implemented as hardware, firmware, or a processor executing software, or combinations thereof. It should be appreciated that, where a software-based embodiment is disclosed herein, the software can be embodied in a physical machine such as a controller. For example, a controller could include a first module and a second module. A controller could be configured to perform various actions, e.g., of a method, an application, a layer or an agent.
[0059] The embodiments can also be embodied as computer readable code on a non- transitory computer readable medium. The computer readable medium is any data storage device that can store data, which can be thereafter read by a computer system. Examples of the computer readable medium include hard drives, network attached storage (NAS), readonly memory, random-access memory, CD-ROMs, CD-Rs, CD-RWs, magnetic tapes, and other optical and non-optical data storage devices. The computer readable medium can also be distributed over a network coupled computer system so that the computer readable code is stored and executed in a distributed fashion. Embodiments described herein may be practiced with various computer system configurations including hand-held devices, tablets, microprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers and the like. The embodiments can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a wire-based or wireless network.
[0060] Although the method operations were described in a specific order, it should be understood that other operations may be performed in between described operations, described operations may be adjusted so that they occur at slightly different times or the described operations may be distributed in a system which allows the occurrence of the processing operations at various intervals associated with the processing.
[0061] In various embodiments, one or more portions of the methods and mechanisms described herein may form part of a cloud-computing environment. In such embodiments, resources may be provided over the Internet as services according to one or more various models. Such models may include Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS). In IaaS, computer infrastructure is delivered as a service. In such a case, the computing equipment is generally owned and operated by the service provider. In the PaaS model, software tools and underlying equipment used by developers to develop software solutions may be provided as a service and hosted by the service provider. SaaS typically includes a service provider licensing software as a service on demand. The service provider may host the software, or may deploy the software to a customer for a given period of time. Numerous combinations of the above models are possible and are contemplated.
[0062] Various units, circuits, or other components may be described or claimed as "configured to" perform a task or tasks. In such contexts, the phrase "configured to" is used to connote structure by indicating that the units/circuits/components include structure (e.g., circuitry) that performs the task or tasks during operation. As such, the
unit/circuit/component can be said to be configured to perform the task even when the specified unit/circuit/component is not currently operational (e.g., is not on). The units/circuits/components used with the "configured to" language include hardware—for example, circuits, memory storing program instructions executable to implement the operation, etc. Reciting that a unit/circuit/component is "configured to" perform one or more tasks is expressly intended not to invoke 35 U.S.C. 112, sixth paragraph, for that unit/circuit/component. Additionally, "configured to" can include generic structure (e.g., generic circuitry) that is manipulated by software and/or firmware (e.g., an FPGA or a general-purpose processor executing software) to operate in manner that is capable of performing the task(s) at issue. "Configured to" may also include adapting a manufacturing process (e.g., a semiconductor fabrication facility) to fabricate devices (e.g., integrated circuits) that are adapted to implement or perform one or more tasks.
[0063] The foregoing description, for the purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the embodiments and its practical applications, to thereby enable others skilled in the art to best utilize the embodiments and various modifications as may be suited to the particular use contemplated. Accordingly, the present embodiments are to be considered as illustrative and not restrictive, and the invention is not to be limited to the details given herein, but may be modified within the scope and equivalents of the appended claims.

Claims

CLAIMS What is claimed is:
1. A plurality of storage nodes in a single chassis, comprising:
a first plurality of storage nodes configured to communicate together as a first storage cluster;
a second plurality of storage nodes configured to communicate together as a second storage cluster;
each of the first and second pluralities of storage nodes having nonvolatile solid-state memory for user data storage; and
each of the first and second pluralities of storage nodes configured to distribute user data and metadata associated with the user data throughout a respective plurality of storage nodes such that a respective storage cluster maintains ability to read the user data, using erasure coding, despite a loss of one or more of the respective plurality of storage nodes.
2. The plurality of storage nodes of claim 1, further comprising:
the first storage cluster configured to execute a first software;
the second storage cluster configured to execute a second software independent of the first storage cluster executing the first software; and
the first storage cluster configured to upgrade software or hardware independent of a software or hardware upgrade to the second storage cluster.
3. The plurality of storage nodes of claim 2, wherein the first software and the second software are different versions of software.
4. The plurality of storage nodes of claim 1, wherein each storage node of each of the pluralities of storage nodes includes a dedicated processor.
5. The plurality of storage nodes of claim 1, further comprising:
membership of each of the plurality of storage nodes to the first storage cluster or the second storage cluster is independent of slot position of each of the plurality of storage nodes in the single chassis.
6. The plurality of storage nodes of claim 1, wherein each of the first and second pluralities of storage nodes maintain ability to read the user data, using the erasure coding, despite a loss of two or more of the respective plurality of storage nodes.
7. The plurality of storage nodes of claim 1, further comprising:
at least one compute node in the single chassis, configured to communicate with at least one of the first plurality of storage nodes or the second plurality of storage nodes.
8. The plurality of storage nodes of claim 1, further comprising:
a third plurality of storage nodes, in the single chassis, configured to communicate together as a third storage cluster.
9. The plurality of storage nodes of claim 1, further comprising:
the first storage cluster having security and encryption differing from and independent of security and encryption of the second storage cluster.
10. A plurality of storage clusters, comprising: a plurality of storage nodes, defining the plurality of storage clusters, within a single chassis;
each of the plurality of storage nodes having nonvolatile solid-state memory for storage of user data;
each of the plurality of storage nodes having exclusive membership to one of the plurality of storage clusters; and
each storage cluster of the plurality of storage clusters configured to distribute user data of the storage cluster and metadata associated with the user data of the storage cluster throughout the storage nodes having membership to the storage cluster such that the storage nodes having membership to the storage cluster can access the user data of the storage cluster, via erasure coding, with a failure of at least one of the storage nodes having membership to the storage cluster.
11. The plurality of storage clusters of claim 10, further comprising:
each storage cluster defines a storage array; each storage cluster and associated storage array is independent of each other storage cluster and associated storage array, of the plurality of storage clusters; and
the storage nodes having membership to one of the plurality of storage clusters do not communicate with the storage nodes having membership to another of the plurality of storage clusters.
12. The plurality of storage clusters of claim 10, further comprising:
each storage cluster has a cluster identifier unique in the plurality of storage clusters.
13. The plurality of storage clusters of claim 10, further comprising:
at least one of the plurality of storage clusters includes at least one compute node in the single chassis.
14. The plurality of storage clusters of claim 10, further comprising:
a first storage cluster configured to execute a first software;
a second storage cluster configured to execute a second software independent of the first storage cluster executing the first software; and
the first storage cluster configured to upgrade software or hardware independent of a software or hardware upgrade to the second storage cluster.
15. A method performed by at least one processor for accessing user data in a plurality of storage nodes having nonvolatile solid-state memory, comprising:
assigning a first subset of the plurality of storage nodes as members of a first storage cluster, wherein the plurality of storage nodes is housed within a single chassis;
assigning a second subset of the plurality of storage nodes as members of a second storage cluster, which is independent of the first storage cluster;
distributing the user data throughout the first subset of the plurality of storage nodes through erasure coding;
determining that one of the first subset of the plurality of storage nodes is unreachable; and
accessing the user data, via the erasure coding, from a remainder of the first subset of the plurality of storage nodes.
16. The method of claim 15, further comprising: distributing further user data throughout the second subset of the plurality of storage nodes through erasure coding;
determining that one of the second subset of the plurality of storage nodes is unreachable; and
accessing the further user data, via the erasure coding, from a remainder of the second subset of the plurality of storage nodes.
17. The method of claim 15, further comprising:
determining that two of the second subset of the plurality of storage nodes are unreachable; and
accessing the user data, via the erasure coding, from a remainder of the second subset of the plurality of storage nodes.
18. The method of claim 15, further comprising:
assigning an unassigned one of the plurality of storage nodes within a single chassis to one of the first storage cluster or the second storage cluster.
19. The method of claim 15, further comprising:
executing a first software on the first storage cluster; and
executing a second software on the second storage cluster independent of the first storage cluster executing the first software, wherein the first storage cluster is configured to upgrade software or hardware independent of a software or hardware upgrade to the second storage cluster.
20. The method of claim 15, further comprising:
maintaining, in the first subset of the plurality of storage nodes, a first set of metadata pertaining to the user data of the first storage cluster, wherein no metadata pertaining to the user data of the first storage cluster is present in the second storage cluster; and
maintaining, in the second subset of the plurality of storage nodes, a second set of metadata pertaining to further user data of the second storage cluster, wherein no metadata pertaining to the further user data of the second storage cluster is present in the first storage cluster.
PCT/US2016/014356 2015-04-10 2016-01-21 Ability to partition an array into two or more logical arrays with independently running software WO2016164092A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP16777006.4A EP3281099A4 (en) 2015-04-10 2016-01-21 Ability to partition an array into two or more logical arrays with independently running software

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US14/684,183 2015-04-10
US14/684,183 US9672125B2 (en) 2015-04-10 2015-04-10 Ability to partition an array into two or more logical arrays with independently running software

Publications (1)

Publication Number Publication Date
WO2016164092A1 true WO2016164092A1 (en) 2016-10-13

Family

ID=57072837

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2016/014356 WO2016164092A1 (en) 2015-04-10 2016-01-21 Ability to partition an array into two or more logical arrays with independently running software

Country Status (3)

Country Link
US (3) US9672125B2 (en)
EP (1) EP3281099A4 (en)
WO (1) WO2016164092A1 (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10712968B2 (en) * 2017-04-11 2020-07-14 EMC IP Holding Company LLC Management of state information backup for an auxiliary storage service in a microservice architecture
US10860483B2 (en) * 2019-04-30 2020-12-08 EMC IP Holding Company LLC Handling metadata corruption to avoid data unavailability
US11789611B2 (en) 2020-04-24 2023-10-17 Netapp, Inc. Methods for handling input-output operations in zoned storage systems and devices thereof
US11340987B1 (en) 2021-03-04 2022-05-24 Netapp, Inc. Methods and systems for raid protection in zoned solid-state drives
US11797377B2 (en) 2021-10-05 2023-10-24 Netapp, Inc. Efficient parity determination in zoned solid-state drives of a storage system
US11803329B2 (en) 2021-11-22 2023-10-31 Netapp, Inc. Methods and systems for processing write requests in a storage system
US11861231B2 (en) 2021-12-16 2024-01-02 Netapp, Inc. Scalable solid-state storage system and methods thereof
US11940911B2 (en) 2021-12-17 2024-03-26 Netapp, Inc. Persistent key-value store and journaling system

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020169972A1 (en) 2001-01-25 2002-11-14 Makoto Tanaka Information storage medium, information processing system, content distribution server, methods and programs therefor, and storage medium for such programs
WO2008157081A2 (en) * 2007-06-15 2008-12-24 Microsoft Corporation Distributed data storage using erasure resilient coding
US20100162076A1 (en) * 2004-08-09 2010-06-24 Siew Yong Sim-Tang Method for lock-free clustered erasure coding and recovery of data across a plurality of data stores in a network
US20120060072A1 (en) * 2010-09-08 2012-03-08 Microsoft Corporation Erasure coding immutable data
US20140250303A1 (en) * 2012-09-26 2014-09-04 Pure Storage, Inc. Multi-drive cooperation to generate an encryption key
US8850108B1 (en) * 2014-06-04 2014-09-30 Pure Storage, Inc. Storage cluster
US8874836B1 (en) 2014-07-03 2014-10-28 Pure Storage, Inc. Scheduling policy for queues in a non-volatile solid-state storage

Family Cites Families (390)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US339818A (en) * 1886-04-13 Hay-stacker
JPH0812632B2 (en) 1992-04-30 1996-02-07 インターナショナル・ビジネス・マシーンズ・コーポレイション Information system and information method
JP2888401B2 (en) 1992-08-03 1999-05-10 インターナショナル・ビジネス・マシーンズ・コーポレイション Synchronization method for redundant disk drive arrays
US6269453B1 (en) 1993-06-29 2001-07-31 Compaq Computer Corporation Method for reorganizing the data on a RAID-4 or RAID-5 array in the absence of one disk
US5390327A (en) 1993-06-29 1995-02-14 Digital Equipment Corporation Method for on-line reorganization of the data on a RAID-4 or RAID-5 array in the absence of one disk and the on-line restoration of a replacement disk
US5504858A (en) 1993-06-29 1996-04-02 Digital Equipment Corporation Method and apparatus for preserving data integrity in a multiple disk raid organized storage system
US5479653A (en) 1994-07-14 1995-12-26 Dellusa, L.P. Disk array apparatus and method which supports compound raid configurations and spareless hot sparing
US5574882A (en) 1995-03-03 1996-11-12 International Business Machines Corporation System and method for identifying inconsistent parity in an array of storage
US5649093A (en) 1995-05-22 1997-07-15 Sun Microsystems, Inc. Server disk error recovery system
JP3641872B2 (en) 1996-04-08 2005-04-27 株式会社日立製作所 Storage system
US5883909A (en) 1996-11-06 1999-03-16 Lsi Logic Corporation Method and apparatus for reducing data transfers across a memory bus of a disk array controller
US6000010A (en) 1997-05-09 1999-12-07 Unisys Corporation Method of increasing the storage capacity of a level five RAID disk array by adding, in a single step, a new parity block and N--1 new data blocks which respectively reside in a new columns, where N is at least two
US6453428B1 (en) 1998-07-17 2002-09-17 Adaptec, Inc. Dual-drive fault tolerant method and system for assigning data chunks to column parity sets
US6260156B1 (en) 1998-12-04 2001-07-10 Datalight, Inc. Method and system for managing bad areas in flash memory
US7133511B2 (en) 1998-12-11 2006-11-07 Securelogix Corporation Telephony security system
US6725392B1 (en) 1999-03-03 2004-04-20 Adaptec, Inc. Controller fault recovery system for a distributed file system
KR100657062B1 (en) 1999-04-27 2006-12-12 발렌틴 알렉산드로비치 미스첸꼬 Method for encrypting information and device for realization of the method
US6275898B1 (en) 1999-05-13 2001-08-14 Lsi Logic Corporation Methods and structure for RAID level migration within a logical unit
GB2359153A (en) 2000-02-10 2001-08-15 Int Computers Ltd Device discovery in a shared data storage system
US6643748B1 (en) 2000-04-20 2003-11-04 Microsoft Corporation Programmatic masking of storage units
US6738875B1 (en) 2000-07-31 2004-05-18 Microsoft Corporation Efficient write-watch mechanism useful for garbage collection in a computer system
JP2002050183A (en) 2000-07-31 2002-02-15 Mitsubishi Electric Corp Semiconductor memory
US6658478B1 (en) 2000-08-04 2003-12-02 3Pardata, Inc. Data storage system
US8990367B2 (en) * 2006-09-29 2015-03-24 Dell Products L.P. Consistent binding of shared storage across clustered servers
US7107480B1 (en) 2000-12-22 2006-09-12 Simpletech, Inc. System and method for preventing data corruption in solid-state memory devices after a power failure
US6523087B2 (en) 2001-03-06 2003-02-18 Chaparral Network Storage, Inc. Utilizing parity caching and parity logging while closing the RAID5 write hole
US6836816B2 (en) 2001-03-28 2004-12-28 Intel Corporation Flash memory low-latency cache
US7444532B2 (en) 2001-12-03 2008-10-28 Dell Products L.P. System and method for autonomous power sequencing
US20030110205A1 (en) 2001-12-07 2003-06-12 Leith Johnson Virtualized resources in a partitionable server
US7055058B2 (en) 2001-12-26 2006-05-30 Boon Storage Technologies, Inc. Self-healing log-structured RAID
US7047358B2 (en) 2001-12-26 2006-05-16 Boon Storage Technologies, Inc. High-performance log-structured RAID
US6985995B2 (en) 2002-03-29 2006-01-10 Panasas, Inc. Data file migration from a mirrored RAID to a non-mirrored XOR-based RAID without rewriting the data
US7032125B2 (en) 2002-04-25 2006-04-18 Lsi Logic Corporation Method for loosely coupling metadata and data in a storage array
US7051155B2 (en) 2002-08-05 2006-05-23 Sun Microsystems, Inc. Method and system for striping data to accommodate integrity metadata
US7076606B2 (en) 2002-09-20 2006-07-11 Quantum Corporation Accelerated RAID with rewind capability
US7188270B1 (en) 2002-11-21 2007-03-06 Adaptec, Inc. Method and system for a disk fault tolerance in a disk array using rotating parity
US7162575B2 (en) 2002-12-20 2007-01-09 Veritas Operating Corporation Adaptive implementation of requested capabilities for a logical volume
US7159150B2 (en) 2002-12-31 2007-01-02 International Business Machines Corporation Distributed storage system capable of restoring data in case of a storage failure
US7424498B1 (en) 2003-06-30 2008-09-09 Data Domain, Inc. Probabilistic summary data structure based encoding for garbage collection
US7119572B2 (en) 2003-07-02 2006-10-10 Daniel Industries, Inc. Programmable logic device configuration via device communication lines
EP1649387B1 (en) 2003-07-16 2010-11-10 Joltid Ltd. Distributed database system
US7398285B2 (en) 2003-07-30 2008-07-08 International Business Machines Corporation Apparatus and system for asynchronous replication of a hierarchically-indexed data store
US7266820B2 (en) * 2003-08-14 2007-09-04 Dell Products L.P. Trunked customized connectivity process for installing software onto an information handling system
US7685436B2 (en) 2003-10-02 2010-03-23 Itt Manufacturing Enterprises, Inc. System and method for a secure I/O interface
US20050114595A1 (en) 2003-11-26 2005-05-26 Veritas Operating Corporation System and method for emulating operating system metadata to provide cross-platform access to storage volumes
US7370220B1 (en) 2003-12-26 2008-05-06 Storage Technology Corporation Method and apparatus for controlling power sequencing of a plurality of electrical/electronic devices
US7383375B2 (en) 2003-12-30 2008-06-03 Sandisk Corporation Data run programming
US7334156B2 (en) 2004-02-13 2008-02-19 Tandberg Data Corp. Method and apparatus for RAID conversion
US8090837B2 (en) 2004-05-27 2012-01-03 Hewlett-Packard Development Company, L.P. Communication in multiprocessor using proxy sockets
US7634566B2 (en) 2004-06-03 2009-12-15 Cisco Technology, Inc. Arrangement in a network for passing control of distributed data between network nodes for optimized client access based on locality
US7536506B2 (en) 2004-06-21 2009-05-19 Dot Hill Systems Corporation RAID controller using capacitor energy source to flush volatile cache data to non-volatile memory during main power outage
US7164608B2 (en) 2004-07-28 2007-01-16 Aplus Flash Technology, Inc. NVRAM memory cell architecture that integrates conventional SRAM and flash cells
US7424592B1 (en) 2004-07-30 2008-09-09 Symantec Operating Corporation System and method for implementing volume sets in a storage system
US7681104B1 (en) 2004-08-09 2010-03-16 Bakbone Software, Inc. Method for erasure coding data across a plurality of data stores in a network
US8375146B2 (en) 2004-08-09 2013-02-12 SanDisk Technologies, Inc. Ring bus structure and its use in flash memory systems
CA2590875C (en) 2004-11-05 2011-09-13 Data Robotics Incorporated Storage system condition indicator and method
US20060114930A1 (en) * 2004-11-17 2006-06-01 International Business Machines (Ibm) Corporation In-band control of indicators to identify devices distributed on the same domain
US7730257B2 (en) 2004-12-16 2010-06-01 Broadcom Corporation Method and computer program product to increase I/O write performance in a redundant array
US8180855B2 (en) 2005-01-27 2012-05-15 Netapp, Inc. Coordinated shared storage architecture
US8886778B2 (en) 2005-04-29 2014-11-11 Netapp, Inc. System and method for proxying network management protocol commands to enable cluster wide management of data backups
WO2006131879A2 (en) 2005-06-09 2006-12-14 Nxp B.V. Storage unit for a communication system node, method for data storage and communication system node
US7792017B2 (en) * 2005-06-24 2010-09-07 Infinera Corporation Virtual local area network configuration for multi-chassis network element
US7318138B1 (en) 2005-08-30 2008-01-08 Symantec Operating Corporation Preventing undesired trespass in storage arrays
US7856583B1 (en) 2005-09-16 2010-12-21 Network Equipment Technologies, Inc. Techniques for enhanced reliability of data transfer with dynamic scaling
US20070079068A1 (en) 2005-09-30 2007-04-05 Intel Corporation Storing data with different specified levels of data redundancy
US7386666B1 (en) 2005-09-30 2008-06-10 Emc Corporation Global sparing of storage capacity across multiple storage arrays
US7681109B2 (en) 2005-10-13 2010-03-16 Ramot At Tel Aviv University Ltd. Method of error correction in MBC flash memory
US7558859B2 (en) 2005-10-17 2009-07-07 Microsoft Corporation Peer-to-peer auction based data distribution
US8010829B1 (en) 2005-10-20 2011-08-30 American Megatrends, Inc. Distributed hot-spare storage in a storage cluster
US7778960B1 (en) 2005-10-20 2010-08-17 American Megatrends, Inc. Background movement of data between nodes in a storage cluster
US8010485B1 (en) 2005-10-20 2011-08-30 American Megatrends, Inc. Background movement of data between nodes in a storage cluster
US7730258B1 (en) 2005-11-01 2010-06-01 Netapp, Inc. System and method for managing hard and soft lock state information in a distributed storage system environment
US7634618B2 (en) 2006-01-03 2009-12-15 Emc Corporation Methods, systems, and computer program products for optimized copying of logical units (LUNs) in a redundant array of inexpensive disks (RAID) environment using buffers that are smaller than LUN delta map chunks
US7634617B2 (en) 2006-01-03 2009-12-15 Emc Corporation Methods, systems, and computer program products for optimized copying of logical units (LUNs) in a redundant array of inexpensive disks (RAID) environment using buffers that are larger than LUN delta map chunks
US8020047B2 (en) 2006-01-17 2011-09-13 Xyratex Technology Limited Method and apparatus for managing storage of data
US7783955B2 (en) 2006-01-18 2010-08-24 Sandisk Il Ltd. Method for implementing error-correction codes in flash memory
US9390019B2 (en) 2006-02-28 2016-07-12 Violin Memory Inc. Method and apparatus for providing high-performance and highly-scalable storage acceleration
US20070214194A1 (en) 2006-03-07 2007-09-13 James Reuter Consistency methods and systems
US20070214314A1 (en) 2006-03-07 2007-09-13 Reuter James M Methods and systems for hierarchical management of distributed data
US7444499B2 (en) 2006-03-28 2008-10-28 Sun Microsystems, Inc. Method and system for trace generation using memory index hashing
US8615599B1 (en) 2006-03-31 2013-12-24 Cisco Technology, Inc. Method and apparatus for preventing loops in a network by controlling broadcasts
WO2007134196A2 (en) 2006-05-10 2007-11-22 Digital Fountain, Inc. Code generator and decoder using hybrid codes
US20070268905A1 (en) 2006-05-18 2007-11-22 Sigmatel, Inc. Non-volatile memory error correction system and method
EP2021904A2 (en) 2006-05-24 2009-02-11 Compellent Technologies System and method for raid management, reallocation, and restriping
WO2007149977A2 (en) 2006-06-21 2007-12-27 Rf Code, Inc. Location-based security, privacy, access control and monitoring system
US8539177B1 (en) 2006-06-29 2013-09-17 Emc Corporation Partitioning of a storage array into N-storage arrays using virtual array non-disruptive data migration
US8583861B1 (en) 2006-06-29 2013-11-12 Emc Corporation Presentation of management functionality of virtual arrays
US7484059B1 (en) 2006-06-29 2009-01-27 Emc Corporation Full array non-disruptive migration of extended storage functionality
US7757059B1 (en) 2006-06-29 2010-07-13 Emc Corporation Virtual array non-disruptive management data migration
US8533408B1 (en) 2006-06-29 2013-09-10 Emc Corporation Consolidating N-storage arrays into one storage array using virtual array non-disruptive data migration
US7484057B1 (en) 2006-06-29 2009-01-27 Emc Corporation Consolidating N-storage arrays into one storage array using full array non-disruptive data migration
US7484056B2 (en) 2006-06-29 2009-01-27 Emc Corporation Partitioning of a storage array into N-storage arrays using full array non-disruptive data migration
US8452928B1 (en) 2006-06-29 2013-05-28 Emc Corporation Virtual array non-disruptive migration of extended storage functionality
US7743276B2 (en) 2006-09-27 2010-06-22 Hewlett-Packard Development Company, L.P. Sufficient free space for redundancy recovery within a distributed data-storage system
JP4932427B2 (en) 2006-10-20 2012-05-16 株式会社日立製作所 Storage device and storage method
US7970873B2 (en) 2006-10-30 2011-06-28 Dell Products L.P. System and method for assigning addresses to information handling systems
US7831768B2 (en) 2006-11-03 2010-11-09 Hewlett-Packard Development Company, L.P. Method and apparatus for writing data to a disk array
US7613947B1 (en) 2006-11-30 2009-11-03 Netapp, Inc. System and method for storage takeover
US9153337B2 (en) 2006-12-11 2015-10-06 Marvell World Trade Ltd. Fatigue management system and method for hybrid nonvolatile solid state memory system
US20080155191A1 (en) 2006-12-21 2008-06-26 Anderson Robert J Systems and methods for providing heterogeneous storage systems
US8498967B1 (en) 2007-01-30 2013-07-30 American Megatrends, Inc. Two-node high availability cluster storage solution using an intelligent initiator to avoid split brain syndrome
US7908448B1 (en) 2007-01-30 2011-03-15 American Megatrends, Inc. Maintaining data consistency in mirrored cluster storage systems with write-back cache
US8046548B1 (en) 2007-01-30 2011-10-25 American Megatrends, Inc. Maintaining data consistency in mirrored cluster storage systems using bitmap write-intent logging
US8140625B2 (en) 2007-02-20 2012-03-20 Nec Laboratories America, Inc. Method for operating a fixed prefix peer to peer network
US9207876B2 (en) 2007-04-19 2015-12-08 Microsoft Technology Licensing, Llc Remove-on-delete technologies for solid state drive optimization
US8706914B2 (en) 2007-04-23 2014-04-22 David D. Duchesneau Computing infrastructure
US7958303B2 (en) 2007-04-27 2011-06-07 Gary Stephen Shuster Flexible data storage system
US7752489B2 (en) 2007-05-10 2010-07-06 International Business Machines Corporation Data integrity validation in storage systems
US8751859B2 (en) 2007-05-10 2014-06-10 International Business Machines Corporation Monitoring lost data in a storage system
US8819311B2 (en) 2007-05-23 2014-08-26 Rpx Corporation Universal user input/output application layers
JP4894922B2 (en) 2007-06-13 2012-03-14 富士通株式会社 RAID group conversion apparatus, RAID group conversion method, and RAID group conversion program
US8140719B2 (en) * 2007-06-21 2012-03-20 Sea Micro, Inc. Dis-aggregated and distributed data-center architecture using a direct interconnect fabric
US20080320097A1 (en) 2007-06-22 2008-12-25 Tenoware R&D Limited Network distributed file system
US9063895B1 (en) 2007-06-29 2015-06-23 Emc Corporation System and method of non-disruptive data migration between heterogeneous storage arrays
US9063896B1 (en) 2007-06-29 2015-06-23 Emc Corporation System and method of non-disruptive data migration between virtual arrays of heterogeneous storage arrays
US9098211B1 (en) 2007-06-29 2015-08-04 Emc Corporation System and method of non-disruptive data migration between a full storage array and one or more virtual arrays
US7921268B2 (en) 2007-07-12 2011-04-05 Jakob Holger Method and system for function-specific time-configurable replication of data
JP2009037304A (en) 2007-07-31 2009-02-19 Hitachi Ltd Storage system with function of changing raid level
US7970919B1 (en) 2007-08-13 2011-06-28 Duran Paul A Apparatus and system for object-based storage solid-state drive and method for configuring same
US7930499B2 (en) 2007-08-15 2011-04-19 Digi-Data Corporation Method to accelerate block level snapshots in archiving storage systems
US7565446B2 (en) 2007-08-27 2009-07-21 Gear Six, Inc. Method for efficient delivery of clustered data via adaptive TCP connection migration
WO2009032711A1 (en) 2007-08-29 2009-03-12 Nirvanix, Inc. Policy-based file management for a storage delivery network
US7991822B2 (en) 2007-08-29 2011-08-02 International Business Machines Corporation Propagation of updates for attributes of a storage object from an owner node of the storage object to other nodes
US8650343B1 (en) 2007-08-30 2014-02-11 Virident Systems, Inc. Methods for upgrading, diagnosing, and maintaining replaceable non-volatile memory
US8225006B1 (en) 2007-08-30 2012-07-17 Virident Systems, Inc. Methods for data redundancy across three or more storage devices
US8639863B1 (en) 2007-08-30 2014-01-28 Virident Systems, Inc. Memory apparatus for replaceable non-volatile memory
US8706932B1 (en) 2007-08-30 2014-04-22 Virident Systems, Inc. Replaceable non-volatile memory apparatus with a plurality of pluggable electrical connectors
US8689042B1 (en) 2007-08-30 2014-04-01 Virident Systems, Inc. Methods for data redundancy across replaceable non-volatile memory storage devices
US8176405B2 (en) 2007-09-24 2012-05-08 International Business Machines Corporation Data integrity validation in a computing environment
US7873878B2 (en) 2007-09-24 2011-01-18 International Business Machines Corporation Data integrity validation in storage systems
US7827439B2 (en) 2007-09-28 2010-11-02 Symantec Corporation System and method of redundantly storing and retrieving data with cooperating storage devices
US8661218B1 (en) 2007-10-18 2014-02-25 Datadirect Networks, Inc. Method for reducing latency in a solid-state memory system while maintaining data integrity
US8838541B2 (en) 2007-10-25 2014-09-16 Hewlett-Packard Development Company, L.P. Data processing apparatus and method of processing data
US7958302B2 (en) * 2007-10-30 2011-06-07 Dell Products L.P. System and method for communicating data in a storage network
US7870105B2 (en) 2007-11-20 2011-01-11 Hitachi, Ltd. Methods and apparatus for deduplication in storage system
JP2011505617A (en) 2007-11-22 2011-02-24 中国移▲動▼通信集▲団▼公司 Data storage method, management server, storage facility and system
US7890504B2 (en) 2007-12-19 2011-02-15 Netapp, Inc. Using the LUN type for storage allocation
KR20090082784A (en) 2008-01-28 2009-07-31 삼성전자주식회사 Flash memory device employing NVRAM cells
US8423739B2 (en) 2008-02-06 2013-04-16 International Business Machines Corporation Apparatus, system, and method for relocating logical array hot spots
US8161309B2 (en) 2008-02-19 2012-04-17 International Business Machines Corporation Apparatus, system, and method for controlling power sequence in a blade center environment
US7885938B1 (en) 2008-02-27 2011-02-08 Symantec Corporation Techniques for granular recovery of data from local and remote storage
JP4729062B2 (en) 2008-03-07 2011-07-20 株式会社東芝 Memory system
US8346778B2 (en) 2008-05-21 2013-01-01 Oracle International Corporation Organizing portions of a cascading index on disk
WO2009140979A1 (en) * 2008-05-21 2009-11-26 Telefonaktiebolaget L M Ericsson (Publ) Resource pooling in a blade cluster switching center server
FR2931970B1 (en) * 2008-05-27 2010-06-11 Bull Sas METHOD FOR GENERATING HANDLING REQUIREMENTS OF SERVER CLUSTER INITIALIZATION AND ADMINISTRATION DATABASE, DATA CARRIER AND CLUSTER OF CORRESPONDING SERVERS
WO2010011428A1 (en) 2008-06-06 2010-01-28 Pivot3 Method and system for data migration in a distributed raid implementation
US9123422B2 (en) 2012-07-02 2015-09-01 Super Talent Technology, Corp. Endurance and retention flash controller with programmable binary-levels-per-cell bits identifying pages or blocks as having triple, multi, or single-level flash-memory cells
US8255739B1 (en) * 2008-06-30 2012-08-28 American Megatrends, Inc. Achieving data consistency in a node failover with a degraded RAID array
US9323681B2 (en) 2008-09-18 2016-04-26 Avere Systems, Inc. File storage system, cache appliance, and method
US8706694B2 (en) 2008-07-15 2014-04-22 American Megatrends, Inc. Continuous data protection of files stored on a remote storage device
US20100125695A1 (en) 2008-11-15 2010-05-20 Nanostar Corporation Non-volatile memory storage system
US8108502B2 (en) 2008-07-24 2012-01-31 Symform, Inc. Storage device for use in a shared community storage network
TW201007574A (en) 2008-08-13 2010-02-16 Inventec Corp Internet server system and method of constructing and starting a virtual machine
US8117521B2 (en) 2008-08-26 2012-02-14 Spansion Llc Implementation of recycling unused ECC parity bits during flash memory programming
US7992037B2 (en) 2008-09-11 2011-08-02 Nec Laboratories America, Inc. Scalable secondary storage systems and methods
US8351290B1 (en) 2008-09-12 2013-01-08 Marvell International Ltd. Erased page detection
US8224782B2 (en) 2008-09-29 2012-07-17 Hitachi, Ltd. System and method for chunk based tiered storage volume migration
US8086634B2 (en) 2008-10-07 2011-12-27 Hitachi, Ltd. Method and apparatus for improving file access performance of distributed storage system
WO2010049928A1 (en) 2008-10-27 2010-05-06 Kaminario Tehnologies Ltd. System and methods for raid writing and asynchronous parity computation
US8086911B1 (en) 2008-10-29 2011-12-27 Netapp, Inc. Method and apparatus for distributed reconstruct in a raid system
WO2010064328A1 (en) 2008-12-03 2010-06-10 Hitachi, Ltd. Information processing system and method of acquiring backup in an information processing system
US8165150B2 (en) * 2008-12-17 2012-04-24 Avaya Inc. Method and system for wireless LAN-based indoor position location
US8200922B2 (en) 2008-12-17 2012-06-12 Netapp, Inc. Storage system snapshot assisted by SSD technology
US8473815B2 (en) 2008-12-22 2013-06-25 Industrial Technology Research Institute Methods and systems of a flash memory controller and an error correction code (ECC) controller using variable-length segmented ECC data
US7941697B2 (en) 2008-12-30 2011-05-10 Symantec Operating Corporation Failure handling using overlay objects on a file system using object based storage devices
US8397016B2 (en) 2008-12-31 2013-03-12 Violin Memory, Inc. Efficient use of hybrid media in cache architectures
US8412880B2 (en) 2009-01-08 2013-04-02 Micron Technology, Inc. Memory system controller to manage wear leveling across a plurality of storage nodes
US8548669B2 (en) 2009-01-08 2013-10-01 New Flyer Industries Canada Ulc System and method for monitoring operation of vehicles
RU2501072C2 (en) 2009-02-03 2013-12-10 Битторрент, Инк. Distributed storage of recoverable data
US8145838B1 (en) 2009-03-10 2012-03-27 Netapp, Inc. Processing and distributing write logs of nodes of a cluster storage system
US8209469B2 (en) 2009-03-10 2012-06-26 Microsoft Corporation Offline device-side logical unit number controller
US8175012B2 (en) 2009-03-26 2012-05-08 Mediatek Inc. Decoding/encoding method for booting from a NAND flash and system thereof
US8364920B1 (en) 2009-04-06 2013-01-29 Network Appliance, Inc. System and method for transferring and backing up luns and lun clones on primary and secondary servers
US10395054B2 (en) 2011-06-06 2019-08-27 Pure Storage, Inc. Updating distributed storage network software
US8261016B1 (en) 2009-04-24 2012-09-04 Netapp, Inc. Method and system for balancing reconstruction load in a storage array using a scalable parity declustered layout
US8117388B2 (en) 2009-04-30 2012-02-14 Netapp, Inc. Data distribution through capacity leveling in a striped file system
US8074038B2 (en) 2009-05-12 2011-12-06 Microsoft Corporation Converting luns into files or files into luns in real time
US8281227B2 (en) 2009-05-18 2012-10-02 Fusion-10, Inc. Apparatus, system, and method to increase data integrity in a redundant storage system
EP2435926A4 (en) 2009-05-29 2013-05-29 Hewlett Packard Development Co System and method for allocating resources of a server to a virtual machine
US8903917B2 (en) 2009-06-03 2014-12-02 Novell, Inc. System and method for implementing a cluster token registry for business continuity
US8145840B2 (en) 2009-06-05 2012-03-27 Lsi Corporation Method and system for storing excess data in a redundant array of independent disk level 6
KR101626528B1 (en) 2009-06-19 2016-06-01 삼성전자주식회사 Flash memory device and data read method thereof
GB2482842B (en) 2009-06-19 2012-07-25 Hewlett Packard Development Co Enclosure power controller
EP2455865B1 (en) 2009-07-17 2020-03-04 Toshiba Memory Corporation Memory management device
US8458287B2 (en) 2009-07-31 2013-06-04 Microsoft Corporation Erasure coded storage aggregation in data centers
US8176284B2 (en) 2009-08-11 2012-05-08 Texas Memory Systems, Inc. FLASH-based memory system with variable length page stripes including data protection information
WO2011024239A1 (en) 2009-08-31 2011-03-03 Hitachi, Ltd. Storage system having plurality of flash packages
WO2011031900A2 (en) 2009-09-09 2011-03-17 Fusion-Io, Inc. Apparatus, system, and method for power reduction management in a storage device
US8671072B1 (en) 2009-09-14 2014-03-11 Netapp, Inc. System and method for hijacking inodes based on replication operations received in an arbitrary order
US8706715B2 (en) 2009-10-05 2014-04-22 Salesforce.Com, Inc. Methods and systems for joining indexes for query optimization in a multi-tenant database
US20110119462A1 (en) 2009-11-19 2011-05-19 Ocz Technology Group, Inc. Method for restoring and maintaining solid-state drive performance
US8484259B1 (en) 2009-12-08 2013-07-09 Netapp, Inc. Metadata subsystem for a distributed object store in a network storage system
US8549224B1 (en) 2009-12-16 2013-10-01 Emc Corporation Migration analyzer for hardware-based storage tiering
US8140821B1 (en) 2009-12-18 2012-03-20 Emc Corporation Efficient read/write algorithms and associated mapping for block-level data reduction processes
US8862617B2 (en) 2010-02-09 2014-10-14 Google Inc. System and method for replicating objects in a distributed storage system
US8341118B2 (en) 2010-02-09 2012-12-25 Google Inc. Method and system for dynamically replicating data within a distributed storage system
US8756387B2 (en) 2010-03-05 2014-06-17 International Business Machines Corporation Method and apparatus for optimizing the performance of a storage system
US8365041B2 (en) 2010-03-17 2013-01-29 Sandisk Enterprise Ip Llc MLC self-raid flash data protection scheme
US8627138B1 (en) 2010-03-26 2014-01-07 Emc Corporation Data protection system and method
US8793447B2 (en) 2010-03-30 2014-07-29 Netapp, Inc. Restoration of a parent LUN through modification of a read-write clone LUN as the parent LUN
US8856593B2 (en) 2010-04-12 2014-10-07 Sandisk Enterprise Ip Llc Failure recovery using consensus replication in a distributed flash memory system
US9183134B2 (en) 2010-04-22 2015-11-10 Seagate Technology Llc Data segregation in a storage device
US8719621B1 (en) 2010-05-05 2014-05-06 Marvell International Ltd. Solid-state disk cache assisted redundant array of independent disks
US8239618B2 (en) 2010-05-27 2012-08-07 Dell Products L.P. System and method for emulating preconditioning of solid-state device
JP5521794B2 (en) 2010-06-03 2014-06-18 株式会社バッファロー Storage device and control program thereof
US9552299B2 (en) 2010-06-11 2017-01-24 California Institute Of Technology Systems and methods for rapid processing and storage of data
US8719675B1 (en) 2010-06-16 2014-05-06 Google Inc. Orthogonal coding for data storage, access, and maintenance
US8631271B2 (en) 2010-06-24 2014-01-14 International Business Machines Corporation Heterogeneous recovery in a redundant memory system
US9148389B2 (en) * 2010-08-04 2015-09-29 Alcatel Lucent System and method for a virtual chassis system
US9818478B2 (en) 2012-12-07 2017-11-14 Attopsemi Technology Co., Ltd Programmable resistive device and memory using diode as selector
US8904226B2 (en) 2010-08-26 2014-12-02 Cleversafe, Inc. Migrating stored copies of a file to stored encoded data slices
US8589625B2 (en) 2010-09-15 2013-11-19 Pure Storage, Inc. Scheduling of reconstructive I/O read operations in a storage environment
US9009724B2 (en) 2010-09-24 2015-04-14 Hewlett-Packard Development Company, L.P. Load balancing data access in virtualized storage nodes
US8775868B2 (en) 2010-09-28 2014-07-08 Pure Storage, Inc. Adaptive RAID for an SSD environment
US8327080B1 (en) 2010-09-28 2012-12-04 Emc Corporation Write-back cache protection
JP5602572B2 (en) 2010-10-06 2014-10-08 富士通株式会社 Storage device, data copying method, and storage system
US11232022B2 (en) 2010-10-29 2022-01-25 Samsung Electronics Co., Ltd. Memory system, data storage device, user device and data management method thereof having a data management information matching determination
US8949502B2 (en) 2010-11-18 2015-02-03 Nimble Storage, Inc. PCIe NVRAM card based on NVDIMM
KR101694984B1 (en) 2010-12-08 2017-01-11 한국전자통신연구원 Method of parity updates in asymmetric clustering filesystem
US8484163B1 (en) * 2010-12-16 2013-07-09 Netapp, Inc. Cluster configuration backup and recovery
US9740762B2 (en) 2011-04-01 2017-08-22 Mongodb, Inc. System and method for optimizing data migration in a partitioned database
US8627136B2 (en) 2010-12-27 2014-01-07 Netapp Inc. Non-disruptive failover of RDMA connection
EP2671160A2 (en) 2011-02-01 2013-12-11 Drobo, Inc. System, apparatus, and method supporting asymmetrical block-level redundant storage
KR101502896B1 (en) 2011-02-14 2015-03-24 주식회사 케이티 Distributed memory cluster control apparatus and method using map reduce
US20120226934A1 (en) 2011-03-01 2012-09-06 Rao G R Mohan Mission critical nand flash
US9021215B2 (en) 2011-03-21 2015-04-28 Apple Inc. Storage system exporting internal storage rules
US8769232B2 (en) 2011-04-06 2014-07-01 Western Digital Technologies, Inc. Non-volatile semiconductor memory module enabling out of order host command chunk media access
US8880793B2 (en) 2011-04-08 2014-11-04 Symantec Corporation Storage management systems and methods
US9159422B1 (en) 2011-04-12 2015-10-13 Sk Hynix Memory Solutions Inc. Cross page management to avoid NAND physical page size limitation
WO2012147087A1 (en) 2011-04-29 2012-11-01 Tata Consultancy Services Limited Archival storage and retrieval system
US8725730B2 (en) 2011-05-23 2014-05-13 Hewlett-Packard Development Company, L.P. Responding to a query in a data processing system
US8544029B2 (en) 2011-05-24 2013-09-24 International Business Machines Corporation Implementing storage adapter performance optimization with chained hardware operations minimizing hardware/firmware interactions
US8805786B1 (en) 2011-06-24 2014-08-12 Emc Corporation Replicating selected snapshots from one storage array to another, with minimal data transmission
US9575903B2 (en) 2011-08-04 2017-02-21 Elwha Llc Security perimeter
US8943313B2 (en) 2011-07-19 2015-01-27 Elwha Llc Fine-grained security in federated data sets
US8874994B2 (en) 2011-07-22 2014-10-28 Sandisk Technologies Inc. Systems and methods of storing data
US8930307B2 (en) 2011-09-30 2015-01-06 Pure Storage, Inc. Method for removing duplicate data from a storage array
US8527544B1 (en) 2011-08-11 2013-09-03 Pure Storage Inc. Garbage collection in a storage system
KR101824295B1 (en) 2011-08-12 2018-01-31 샌디스크 테크놀로지스 엘엘씨 Cache management including solid state device virtualization
US9710535B2 (en) 2011-08-12 2017-07-18 Nexenta Systems, Inc. Object storage system with local transaction logs, a distributed namespace, and optimized support for user directories
US9910904B2 (en) 2011-08-30 2018-03-06 International Business Machines Corporation Replication of data objects from a source server to a target server
US8990171B2 (en) 2011-09-01 2015-03-24 Microsoft Corporation Optimization of a partially deduplicated file
US8769138B2 (en) 2011-09-02 2014-07-01 Compuverde Ab Method for data retrieval from a distributed data storage system
US9021053B2 (en) 2011-09-02 2015-04-28 Compuverde Ab Method and device for writing data to a data storage system comprising a plurality of data storage nodes
US8886910B2 (en) * 2011-09-12 2014-11-11 Microsoft Corporation Storage device drivers and cluster participation
US8959110B2 (en) 2011-09-18 2015-02-17 Microsoft Technology Licensing, Llc Dynamic query for external data connections
US8862928B2 (en) 2011-09-20 2014-10-14 Cloudbyte, Inc. Techniques for achieving high availability with multi-tenant storage when a partial fault occurs or when more than two complete faults occur
US8700875B1 (en) 2011-09-20 2014-04-15 Netapp, Inc. Cluster view for storage devices
US20130173853A1 (en) 2011-09-26 2013-07-04 Nec Laboratories America, Inc. Memory-efficient caching methods and systems
US9197623B2 (en) 2011-09-29 2015-11-24 Oracle International Corporation Multiple resource servers interacting with single OAuth server
US8990495B2 (en) 2011-11-15 2015-03-24 Emc Corporation Method and system for storing data in raid memory devices
US8713405B2 (en) 2011-11-22 2014-04-29 Simplivity Corporation Method and apparatus for allocating erasure coded data to disk storage
JP5923964B2 (en) 2011-12-13 2016-05-25 富士通株式会社 Disk array device, control device, and program
US8712963B1 (en) 2011-12-22 2014-04-29 Emc Corporation Method and apparatus for content-aware resizing of data chunks for replication
US8639669B1 (en) 2011-12-22 2014-01-28 Emc Corporation Method and apparatus for determining optimal chunk sizes of a deduplicated storage system
US8788913B1 (en) 2011-12-30 2014-07-22 Emc Corporation Selection of erasure code parameters for no data repair
JP5844473B2 (en) 2012-02-08 2016-01-20 株式会社日立製作所 Storage device having a plurality of nonvolatile semiconductor storage media, placing hot data in long-life storage medium, and placing cold data in short-life storage medium, and storage control method
US8819383B1 (en) 2012-02-17 2014-08-26 Netapp, Inc. Non-disruptive realignment of virtual data
US9619430B2 (en) 2012-02-24 2017-04-11 Hewlett Packard Enterprise Development Lp Active non-volatile memory post-processing
US8856619B1 (en) 2012-03-09 2014-10-07 Google Inc. Storing data across groups of storage nodes
US10489412B2 (en) 2012-03-29 2019-11-26 Hitachi Vantara Corporation Highly available search index with storage node addition and removal
US9323667B2 (en) 2012-04-12 2016-04-26 Violin Memory Inc. System and method for managing trim operations in a flash memory system using mapping tables and block status tables
US9335942B2 (en) 2012-04-18 2016-05-10 Avago Technologies General IP (Technologies) Pte. Ltd. Methods and structure for LUN masking in a switching device
US8996828B2 (en) 2012-04-20 2015-03-31 International Business Machines Corporation Systems and methods for migrating data
EP2660723A1 (en) * 2012-05-03 2013-11-06 Thomson Licensing Method of data storing and maintenance in a distributed data storage system and corresponding device
CN103389920B (en) 2012-05-09 2016-06-15 深圳市腾讯计算机系统有限公司 The self-sensing method of a kind of disk bad block and device
WO2013171792A1 (en) 2012-05-16 2013-11-21 Hitachi, Ltd. Storage control apparatus and storage control method
US9047214B1 (en) 2012-05-22 2015-06-02 Pmc-Sierra, Inc. System and method for tolerating a failed page in a flash device
US8972478B1 (en) 2012-05-23 2015-03-03 Netapp, Inc. Using append only log format in data storage cluster with distributed zones for determining parity of reliability groups
US9430542B2 (en) 2012-06-05 2016-08-30 International Business Machines Corporation User initiated replication in a synchronized object replication system
US8799746B2 (en) * 2012-06-13 2014-08-05 Caringo, Inc. Erasure coding and replication in storage clusters
US8762353B2 (en) * 2012-06-13 2014-06-24 Caringo, Inc. Elimination of duplicate objects in storage clusters
US8930633B2 (en) 2012-06-14 2015-01-06 International Business Machines Corporation Reducing read latency using a pool of processing cores
US9053808B2 (en) 2012-06-21 2015-06-09 Sandisk Technologies Inc. Flash memory with targeted read scrub algorithm
US8850288B1 (en) 2012-06-27 2014-09-30 Amazon Technologies, Inc. Throughput-sensitive redundancy encoding schemes for data storage
US9229656B1 (en) 2012-06-28 2016-01-05 Emc Corporation Managing settings and queries in host-based data migration
KR102003930B1 (en) 2012-07-31 2019-07-25 삼성전자주식회사 method of controlling data writing in non volatile memory device and memory controller having wearleveling control function
CN103577274B (en) 2012-07-31 2016-07-06 国际商业机器公司 The method and apparatus of management memory array
US9189650B2 (en) 2012-07-31 2015-11-17 J.D. Power And Associates Privacy preserving method for summarizing user data
US9298760B1 (en) 2012-08-03 2016-03-29 Google Inc. Method for shard assignment in a large-scale data processing job
KR102028128B1 (en) 2012-08-07 2019-10-02 삼성전자주식회사 Operating method of memory system including nonvolatile random access memory and nand flash memory
US8904231B2 (en) 2012-08-08 2014-12-02 Netapp, Inc. Synchronous local and cross-site failover in clustered storage systems
US9122401B2 (en) 2012-08-23 2015-09-01 Apple Inc. Efficient enforcement of command execution order in solid state drives
US8929066B2 (en) * 2012-08-28 2015-01-06 Skyera, Inc. Chassis with separate thermal chamber for solid state memory
US9778856B2 (en) 2012-08-30 2017-10-03 Microsoft Technology Licensing, Llc Block-level access to parallel storage
US9613656B2 (en) 2012-09-04 2017-04-04 Seagate Technology Llc Scalable storage protection
US9047181B2 (en) * 2012-09-07 2015-06-02 Splunk Inc. Visualization of data from clusters
US8887011B2 (en) 2012-09-13 2014-11-11 Sandisk Technologies Inc. Erased page confirmation in multilevel memory
US9158528B2 (en) * 2012-10-02 2015-10-13 Oracle International Corporation Forcibly completing upgrade of distributed software in presence of failures
US9116819B2 (en) 2012-10-17 2015-08-25 Datadirect Networks, Inc. Reducing metadata in a write-anywhere storage system
US9348538B2 (en) 2012-10-18 2016-05-24 Netapp, Inc. Selective deduplication
KR101544356B1 (en) 2012-10-31 2015-08-13 삼성에스디에스 주식회사 Distributed database managing method and composition node thereof supporting dynamic sharding based on the metadata and data transaction quantity
US9430250B2 (en) 2012-12-03 2016-08-30 Kingston Digital, Inc. Bootability with multiple logical unit numbers
KR20140072637A (en) 2012-12-05 2014-06-13 삼성전자주식회사 method for operating non-volatile memory device and memory controller
US9355022B2 (en) 2012-12-07 2016-05-31 Sandisk Technologies Inc. Systems and methods for intelligent flash management
US9110898B1 (en) 2012-12-20 2015-08-18 Emc Corporation Method and apparatus for automatically detecting replication performance degradation
US20140181402A1 (en) 2012-12-21 2014-06-26 Advanced Micro Devices, Inc. Selective cache memory write-back and replacement policies
US9501398B2 (en) 2012-12-26 2016-11-22 Sandisk Technologies Llc Persistent storage device with NVRAM for staging writes
AU2012398220B2 (en) 2012-12-28 2017-01-05 Huawei Technologies Co., Ltd. Data storage method and storage device
US8959388B1 (en) 2012-12-28 2015-02-17 Emc Corporation Managing TLU recovery using pre-allocated LUN slices
US9286002B1 (en) 2012-12-28 2016-03-15 Virident Systems Inc. Dynamic restriping in nonvolatile memory systems
US9134908B2 (en) 2013-01-09 2015-09-15 Apple Inc. Logical volume space sharing
US8862847B2 (en) 2013-02-08 2014-10-14 Huawei Technologies Co., Ltd. Distributed storage method, apparatus, and system for reducing a data loss that may result from a single-point failure
US20140237164A1 (en) 2013-02-19 2014-08-21 Kabushiki Kaisha Toshiba Hybrid drive that implements a deferred trim list
US9124300B2 (en) 2013-02-28 2015-09-01 Sandisk Technologies Inc. Error correction coding in non-volatile memory
US9235475B1 (en) 2013-03-05 2016-01-12 Emc Corporation Metadata optimization for network replication using representative of metadata batch
US9110964B1 (en) 2013-03-05 2015-08-18 Emc Corporation Metadata optimization for network replication using differential encoding
US8824261B1 (en) 2013-03-07 2014-09-02 Seagate Technology Llc Peer to peer vibration mitigation
US9201733B2 (en) 2013-03-13 2015-12-01 Futurewei Technologies, Inc. Systems and methods for data repair
US9021188B1 (en) 2013-03-15 2015-04-28 Virident Systems Inc. Small block write operations in non-volatile memory systems
US10073626B2 (en) 2013-03-15 2018-09-11 Virident Systems, Llc Managing the write performance of an asymmetric memory system
US9025393B2 (en) 2013-03-25 2015-05-05 Seagate Technology Llc Method of optimizing solid state drive soft retry voltages
ES2866156T3 (en) 2013-05-02 2021-10-19 Huawei Tech Co Ltd Computer system, method of accessing an express peripheral component interconnection terminal, and equipment
US9244761B2 (en) 2013-06-25 2016-01-26 Microsoft Technology Licensing, Llc Erasure coding across multiple zones and sub-zones
US9158472B2 (en) 2013-06-25 2015-10-13 Google Inc. Hierarchical chunking of objects in a distributed storage system
US9378084B2 (en) 2013-06-25 2016-06-28 Microsoft Technology Licensing, Llc Erasure coding across multiple zones
US9891860B1 (en) 2013-06-28 2018-02-13 EMC IP Holding Company, LLC. Managing copying of data in storage systems
US20150032720A1 (en) 2013-07-23 2015-01-29 Yahoo! Inc. Optimizing database queries
US10146787B2 (en) 2013-07-26 2018-12-04 Quest Software Inc. Transferring differences between chunks during replication
US9268806B1 (en) 2013-07-26 2016-02-23 Google Inc. Efficient reference counting in content addressable storage
US20150039645A1 (en) 2013-08-02 2015-02-05 Formation Data Systems, Inc. High-Performance Distributed Data Storage System with Implicit Content Routing and Data Deduplication
US20150039849A1 (en) 2013-08-02 2015-02-05 Formation Data Systems, Inc. Multi-Layer Data Storage Virtualization Using a Consistent Data Reference Model
CN104423889B (en) 2013-08-26 2017-06-16 国际商业机器公司 A kind of multi-path management method and system
KR101748717B1 (en) 2013-09-27 2017-06-19 인하대학교 산학협력단 Deduplication of parity data in ssd based raid systems
US9465735B2 (en) 2013-10-03 2016-10-11 Qualcomm Incorporated System and method for uniform interleaving of data across a multiple-channel memory architecture with asymmetric storage capacity
US9952809B2 (en) 2013-11-01 2018-04-24 Dell Products, L.P. Self destroying LUN
US9553822B2 (en) 2013-11-12 2017-01-24 Microsoft Technology Licensing, Llc Constructing virtual motherboards and virtual storage devices
US9740700B1 (en) 2013-11-18 2017-08-22 EMC IP Holding Company LLC Snapshot map
US9250999B1 (en) 2013-11-19 2016-02-02 Google Inc. Non-volatile random access memory in computer primary memory
KR20150061258A (en) 2013-11-27 2015-06-04 한국전자통신연구원 Operating System and Method for Parity chunk update processing in distributed Redundant Array of Inexpensive Disks system
US8843700B1 (en) 2013-11-29 2014-09-23 NXGN Data, Inc. Power efficient method for cold storage data retention management
US9582058B2 (en) 2013-11-29 2017-02-28 Sandisk Technologies Llc Power inrush management of storage devices
US9798486B1 (en) 2013-12-18 2017-10-24 EMC IP Holding Company LLC Method and system for file system based replication of a deduplicated storage system
US9594652B1 (en) 2013-12-19 2017-03-14 Veritas Technologies Systems and methods for decreasing RAID rebuilding time
US9417960B2 (en) 2013-12-20 2016-08-16 Seagate Technology Llc Preventing programming errors from occurring when programming flash memory cells
US9667496B2 (en) 2013-12-24 2017-05-30 International Business Machines Corporation Configuration updates across peer storage systems
US9396202B1 (en) 2013-12-27 2016-07-19 Google Inc. Weakly synchronized garbage collection and compaction for aggregated, replicated object stores
US9563517B1 (en) 2013-12-30 2017-02-07 EMC IP Holding Company LLC Cloud snapshots
US10031703B1 (en) 2013-12-31 2018-07-24 Emc Corporation Extent-based tiering for virtual storage using full LUNs
CN104765693B (en) 2014-01-06 2018-03-27 国际商业机器公司 A kind of methods, devices and systems for data storage
US9251064B2 (en) 2014-01-08 2016-02-02 Netapp, Inc. NVRAM caching and logging in a storage system
US9454434B2 (en) 2014-01-17 2016-09-27 Netapp, Inc. File system driven raid rebuild technique
US9804925B1 (en) 2014-02-25 2017-10-31 Google Inc. Data reconstruction in distributed storage systems
US11093468B1 (en) 2014-03-31 2021-08-17 EMC IP Holding Company LLC Advanced metadata management
US10264071B2 (en) 2014-03-31 2019-04-16 Amazon Technologies, Inc. Session management in distributed storage systems
US9829066B2 (en) 2014-04-07 2017-11-28 Gates Corporation Electrically conductive power transmission belt
US9003144B1 (en) 2014-06-04 2015-04-07 Pure Storage, Inc. Mechanism for persisting messages in a storage system
JP5901698B2 (en) 2014-06-17 2016-04-13 インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation Memory management method
US9811546B1 (en) 2014-06-30 2017-11-07 EMC IP Holding Company LLC Storing data and metadata in respective virtual shards on sharded storage systems
US9836245B2 (en) 2014-07-02 2017-12-05 Pure Storage, Inc. Non-volatile RAM and flash memory in a non-volatile solid-state storage
US8868825B1 (en) 2014-07-02 2014-10-21 Pure Storage, Inc. Nonrepeating identifiers in an address space of a non-volatile solid-state storage
JP6483966B2 (en) 2014-07-04 2019-03-13 キヤノン株式会社 Image reading apparatus, system including image reading apparatus, method executed by image reading apparatus, and program
EP2998881B1 (en) 2014-09-18 2018-07-25 Amplidata NV A computer implemented method for dynamic sharding
US9552248B2 (en) 2014-12-11 2017-01-24 Pure Storage, Inc. Cloud alert to replica
US20160191508A1 (en) 2014-12-31 2016-06-30 Nexenta Systems, Inc. Methods and Systems for Block Sharding of Objects Stored in Distributed Storage System
US9600193B2 (en) 2015-02-04 2017-03-21 Delphix Corporation Replicating snapshots from a source storage system to a target storage system
US9946604B1 (en) 2015-02-04 2018-04-17 Tintri Inc. Optimized remote cloning
US10082985B2 (en) 2015-03-27 2018-09-25 Pure Storage, Inc. Data striping across storage nodes that are assigned to multiple logical arrays
US9525737B2 (en) 2015-04-14 2016-12-20 E8 Storage Systems Ltd. Lockless distributed redundant storage and NVRAM cache in a highly-distributed shared topology with direct memory access capable interconnect
US9529542B2 (en) 2015-04-14 2016-12-27 E8 Storage Systems Ltd. Lockless distributed redundant storage and NVRAM caching of compressed data in a highly-distributed shared topology with direct memory access capable interconnect
US10013177B2 (en) 2015-04-20 2018-07-03 Hewlett Packard Enterprise Development Lp Low write amplification in solid state drive
US9892005B2 (en) 2015-05-21 2018-02-13 Zerto Ltd. System and method for object-based continuous data protection
US10089012B1 (en) 2015-06-25 2018-10-02 EMC IP Holding Company LLC Zero on demand operations based on zeroed chunk tables of storage drive objects stored in main memory
US11175995B2 (en) 2015-06-29 2021-11-16 Vmware, Inc. Data protection for a document database system
US9998539B1 (en) 2015-07-01 2018-06-12 Amazon Technologies, Inc. Non-parity in grid encoded data storage systems
US9904589B1 (en) 2015-07-01 2018-02-27 Amazon Technologies, Inc. Incremental media size extension for grid encoded data storage systems
US9959167B1 (en) 2015-07-01 2018-05-01 Amazon Technologies, Inc. Rebundling grid encoded data storage systems
US10089176B1 (en) 2015-07-01 2018-10-02 Amazon Technologies, Inc. Incremental updates of grid encoded data storage systems
US10108819B1 (en) 2015-07-01 2018-10-23 Amazon Technologies, Inc. Cross-datacenter extension of grid encoded data storage systems
US10162704B1 (en) 2015-07-01 2018-12-25 Amazon Technologies, Inc. Grid encoded data storage systems for efficient data repair
US9268648B1 (en) 2015-07-28 2016-02-23 Zerto Ltd. System and method for consistency verification of replicated data in a recovery system
TWI575531B (en) 2015-08-10 2017-03-21 慧榮科技股份有限公司 Method for accessing flash memory module and associated flash memory controller and memory device
US9880827B2 (en) * 2015-08-30 2018-01-30 International Business Machines Corporation Managing software version upgrades in a multiple computer system environment
US10762069B2 (en) 2015-09-30 2020-09-01 Pure Storage, Inc. Mechanism for a system where data and metadata are located closely together
US10331634B2 (en) 2015-10-07 2019-06-25 Oracle International Corporation Request routing and query processing in a sharded database
US9619321B1 (en) 2015-10-08 2017-04-11 Seagate Technology Llc Internal copy-back with read-verify
US9384082B1 (en) 2015-10-23 2016-07-05 Pure Storage, Inc. Proactively providing corrective measures for storage arrays
US10007457B2 (en) 2015-12-22 2018-06-26 Pure Storage, Inc. Distributed transactions with token-associated execution
US10437502B2 (en) 2015-12-29 2019-10-08 EMC IP Holding Company LLC Efficient deduplication of logical units
US9910748B2 (en) 2015-12-31 2018-03-06 Futurewei Technologies, Inc. Rebuilding process for storage array
US10152268B1 (en) 2016-03-30 2018-12-11 EMC IP Holding Company LLC System and methods for replication resource management in asymmetric secure multi-tenancy deployments in protection storage
US10019317B2 (en) 2016-04-25 2018-07-10 Nexenta Systems, Inc. Parity protection for data chunks in an object storage system
US10019314B2 (en) 2016-04-27 2018-07-10 Silicon Motion Inc. Flash memory apparatus and storage management method for flash memory
US10180875B2 (en) 2016-07-08 2019-01-15 Toshiba Memory Corporation Pool-level solid state drive error correction
TWI607312B (en) 2016-10-07 2017-12-01 慧榮科技股份有限公司 Data storage device and data writing method thereof
US10372541B2 (en) 2016-10-12 2019-08-06 Samsung Electronics Co., Ltd. Storage device storing data using raid
US10261719B2 (en) 2017-01-31 2019-04-16 Hewlett Packard Enterprise Development Lp Volume and snapshot replication
US10705911B2 (en) 2017-04-24 2020-07-07 Hewlett Packard Enterprise Development Lp Storing data in a distributed storage system
US20180321874A1 (en) 2017-05-03 2018-11-08 Alibaba Group Holding Limited Flash management optimization for data update with small block sizes for write amplification mitigation and fault tolerance enhancement
US20190036703A1 (en) 2017-07-28 2019-01-31 Nexenta Systems, Inc. Shard groups for efficient updates of, and access to, distributed metadata in an object storage system

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020169972A1 (en) 2001-01-25 2002-11-14 Makoto Tanaka Information storage medium, information processing system, content distribution server, methods and programs therefor, and storage medium for such programs
US20100162076A1 (en) * 2004-08-09 2010-06-24 Siew Yong Sim-Tang Method for lock-free clustered erasure coding and recovery of data across a plurality of data stores in a network
WO2008157081A2 (en) * 2007-06-15 2008-12-24 Microsoft Corporation Distributed data storage using erasure resilient coding
US20120060072A1 (en) * 2010-09-08 2012-03-08 Microsoft Corporation Erasure coding immutable data
US20140250303A1 (en) * 2012-09-26 2014-09-04 Pure Storage, Inc. Multi-drive cooperation to generate an encryption key
US8850108B1 (en) * 2014-06-04 2014-09-30 Pure Storage, Inc. Storage cluster
US8874836B1 (en) 2014-07-03 2014-10-28 Pure Storage, Inc. Scheduling policy for queues in a non-volatile solid-state storage

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3281099A4

Also Published As

Publication number Publication date
US10496295B2 (en) 2019-12-03
US9672125B2 (en) 2017-06-06
EP3281099A1 (en) 2018-02-14
EP3281099A4 (en) 2018-12-05
US11144212B2 (en) 2021-10-12
US20160299823A1 (en) 2016-10-13
US20200104059A1 (en) 2020-04-02
US20170242604A1 (en) 2017-08-24

Similar Documents

Publication Publication Date Title
US12086472B2 (en) Heterogeneous storage arrays
US11714715B2 (en) Storage system accommodating varying storage capacities
US11144212B2 (en) Independent partitions within an array
US11704073B2 (en) Ownership determination for accessing a file
AU2016218381B2 (en) Storage system architecture
WO2016179423A1 (en) Logical arrays running on physical hardware where reserve physical capacity is available

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16777006

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2016777006

Country of ref document: EP